{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T08:25:37Z","timestamp":1769588737618,"version":"3.49.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018779","type":"print"},{"value":"9783032018786","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01878-6_7","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:08:50Z","timestamp":1755367730000},"page":"203-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Traceable Verifiable Random Functions"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Aditi","family":"Partap","sequence":"additional","affiliation":[]},{"given":"Lior","family":"Rotem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-01001-9_2","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"D Aggarwal","year":"2009","unstructured":"Aggarwal, D., Maurer, U.: Breaking RSA generically is equivalent to factoring. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 36\u201353. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_2"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bellare, M., Crites, E.C., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Better than advertised security for non-interactive threshold signatures. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part IV. LNCS, vol. 13510, pp. 517\u2013550. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_18","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: CCS 2006, pp. 390\u2013399. ACM (2006)","DOI":"10.1145\/1180405.1180453"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Tessaro, S., Zhu, C.: Stronger security for non-interactive threshold signatures: BLS and FROST. Cryptology ePrint Archive, Report 2022\/833 (2022)","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: ASIACRYPT 2018, pp. 435\u2013463 (2018)","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"7_CR8","unstructured":"Boneh, D., Haitner, I., Lindell, Y.: Exponent-VRFs and their applications. Cryptology ePrint Archive, Paper 2024\/397 (2024)"},{"key":"7_CR9","unstructured":"Boneh, D., Partap, A., Rotem, L.: Proactive refresh for accountable threshold signatures. Cryptology ePrint Archive, Paper 2022\/1656 (2022). link"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Partap, A., Rotem, L.: Accountability for misbehavior in threshold decryption via threshold traitor tracing. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VII. LNCS, vol. 14926, pp. 317\u2013351. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_11","DOI":"10.1007\/978-3-031-68394-7_11"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable secret sharing: strong security and efficient constructions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part V. LNCS, vol. 14924, pp. 221\u2013256. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_9","DOI":"10.1007\/978-3-031-68388-6_9"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable verifiable random functions. Cryptology ePrint Archive, Paper 2025\/312 (2025). link","DOI":"10.1007\/978-3-032-01878-6_7"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 573\u2013592. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_34"},{"key":"7_CR14","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography (2023). Cryptobook"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"7_CR17","unstructured":"Chainlink VRF: On-chain verifiable randomness. link"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-03810-6_13","volume-title":"Theory of Cryptography","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Vaikuntanathan, V., Waters, B., Wee, H., Wichs, D.: Traitor-tracing from LWE made simple and attribute-based. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 341\u2013369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_13"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Choi, K., Manoj, A., Bonneau, J.: SoK: distributed randomness beacons. In: 2023 IEEE Symposium on Security and Privacy, San Francisco, CA, USA, 21\u201325 May 2023, pp. 75\u201392. IEEE Computer Society Press (2023)","DOI":"10.1109\/SP46215.2023.10179419"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Das, P., Faust, S., Loss, J.: A formal treatment of deterministic wallets. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, London, UK, 11\u201315 November 2019, pp. 651\u2013668. ACM Press (2019)","DOI":"10.1145\/3319535.3354236"},{"key":"7_CR23","unstructured":"Das, S., Pinkas, B., Tomescu, A., Xiang, Z.: Distributed randomness using weighted VRFs. Cryptology ePrint Archive, Report 2024\/198 (2024)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36288-6_1","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"Y Dodis","year":"2003","unstructured":"Dodis, Y.: Efficient construction of (distributed) verifiable random functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 1\u201317. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_1"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Fleischhacker, N., Simkin, M., Zhang, Z.: Squirrel: efficient synchronized multi-signatures from lattices. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 1109\u20131123. ACM Press (2022)","DOI":"10.1145\/3548606.3560655"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P-A Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 90\u2013104. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45472-1_7"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Galindo, D., Liu, J., Ordean, M., Wong, J.-M.: Fully distributed verifiable random functions and their application to decentralised random beacons. In: 2021 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 88\u2013102 (2021)","DOI":"10.1109\/EuroSP51992.2021.00017"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Garg, S., Kumarasubramanian, A., Sahai, A., Waters, B.: Building efficient fully collusion-resilient traitor tracing and revocation schemes. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, Chicago, Illinois, USA, 4\u20138 October 2010, pp. 121\u2013130. ACM Press (2010)","DOI":"10.1145\/1866307.1866322"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48071-4_16","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"S Goldwasser","year":"1993","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant signatures and non-interactive zero-knowledge proofs are equivalent. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 228\u2013245. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_16"},{"key":"7_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-031-30620-4_21","volume-title":"EUROCRYPT 2023, Part III","author":"J Gong","year":"2023","unstructured":"Gong, J., Luo, J., Wee, H.: Traitor tracing with $${N}^{1\/3}$$-size ciphertexts and $${O}(1)$$-size keys from $$k$$-Lin. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 637\u2013668. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_21"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 660\u2013670. ACM Press (2018)","DOI":"10.1145\/3188745.3188844"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-030-84252-9_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Song, Y., Srinivasan, A.: Traceable secret sharing and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 718\u2013747. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_24"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. In: 39th FOCS, Palo Alto, CA, USA, 8\u201311 November 1998, pp. 28\u201339. IEEE Computer Society Press (1998)","DOI":"10.1109\/SFCS.1998.743426"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-27954-6_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"C Hazay","year":"2012","unstructured":"Hazay, C., Mikkelsen, G.L., Rabin, T., Toft, T.: Efficient RSA key generation and threshold paillier in the two-party setting. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 313\u2013331. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_20"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. In: Halld\u00f3rsson, M.M., Dolev, S. (eds.) 33rd ACM PODC, Paris, France, 15\u201318 July 2014, pp. 303\u2013312. ACM (2014)","DOI":"10.1145\/2611462.2611498"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-11799-2_30","volume-title":"Theory of Cryptography","author":"B Libert","year":"2010","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_30"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"A Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 597\u2013612. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_38"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: extended abstract. In: CCS 2001, pp. 245\u2013254. ACM (2001)","DOI":"10.1145\/501983.502017"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS, New York, NY, USA, 17\u201319 October 1999, pp. 120\u2013130. IEEE Computer Society Press (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-84242-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Nick","year":"2021","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: simple two-round schnorr multi-signatures. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 189\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, Virtual Event, USA, 9\u201313 November 2020, pp. 1717\u20131731. ACM Press (2020)","DOI":"10.1145\/3372297.3417236"},{"key":"7_CR43","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-x_16","DOI":"10.1007\/3-540-48910-x_16"},{"key":"7_CR44","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, Baltimore, MA, USA, 22\u201324 May 2005, pp. 84\u201393. ACM Press (2005)"},{"issue":"11","key":"7_CR45","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207\u2013220. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Sudan, M.: Maximum likelihood decoding of reed solomon codes. In: 37th FOCS, Burlington, Vermont, 14\u201316 October 1996, pp. 164\u2013172. IEEE Computer Society Press (1996)","DOI":"10.1109\/SFCS.1996.548475"},{"key":"7_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_7"},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-030-64375-1_8","volume-title":"Theory of Cryptography","author":"H Wee","year":"2020","unstructured":"Wee, H.: Functional encryption for quadratic functions from k-lin, revisited. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 210\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_8"},{"key":"7_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-030-56784-2_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Zhandry","year":"2020","unstructured":"Zhandry, M.: New techniques for traitor tracing: size $$N^{1\/3}$$ and more from pairings. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 652\u2013682. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_22"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:11:15Z","timestamp":1757430675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}