{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T00:03:30Z","timestamp":1725235410705},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00145-021-09393-0","type":"journal-article","created":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T23:40:17Z","timestamp":1622590817000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptively Secure Distributed PRFs from $$\\textsf {LWE}$$"],"prefix":"10.1007","volume":"34","author":[{"given":"Beno\u00eet","family":"Libert","sequence":"first","affiliation":[]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[]},{"given":"Radu","family":"Titiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,2]]},"reference":[{"key":"9393_CR1","doi-asserted-by":"crossref","unstructured":"M.\u00a0Abe, S.\u00a0Fehr, Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography, in Crypto (2004)","DOI":"10.1007\/978-3-540-28628-8_20"},{"key":"9393_CR2","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, D.\u00a0Boneh, X.\u00a0Boyen, Efficient lattice (H)IBE in the standard model, in Eurocrypt (2010)","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"9393_CR3","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, X.\u00a0Boyen, V.\u00a0Vaikuntanathan, P.\u00a0Voulgaris, and H.\u00a0Wee. Functional encryption for threshold functions (or fuzzy ibe) from lattices, in PKC (2012)","DOI":"10.1007\/978-3-642-30057-8_17"},{"key":"9393_CR4","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, B.\u00a0Libert, D.\u00a0Stehl\u00e9, Fully secure functional encryption for inner products from standard assumptions, in Crypto (2016)","DOI":"10.1007\/978-3-662-53015-3_12"},{"key":"9393_CR5","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, P.\u00a0Mohassel, P.\u00a0Mukherjee, P.\u00a0Rindal, DiSE: distributed symmetric-key encryption, in ACM-CCS (2018)","DOI":"10.1145\/3243734.3243774"},{"key":"9393_CR6","doi-asserted-by":"crossref","unstructured":"I.\u00a0Almansa, I.\u00a0Damg\u00e5rd, J.-B. Nielsen, Simplified threshold RSA with adaptive and proactive security, in Eurocrypt (2006)","DOI":"10.1007\/11761679_35"},{"key":"9393_CR7","doi-asserted-by":"crossref","unstructured":"J.\u00a0Alwen, S.\u00a0Krenn, K.\u00a0Pietrzak, D.\u00a0Wichs, Learning with rounding, revisited\u2014new reduction, properties and applications, in Crypto (2013)","DOI":"10.1007\/978-3-642-40041-4_4"},{"key":"9393_CR8","doi-asserted-by":"crossref","unstructured":"A.\u00a0Banerjee, C.\u00a0Peikert, New and improved key-homomorphic pseudo-random functions, in Crypto (2014)","DOI":"10.1007\/978-3-662-44371-2_20"},{"key":"9393_CR9","doi-asserted-by":"crossref","unstructured":"A.\u00a0Banerjee, C.\u00a0Peikert, A.\u00a0Rosen, Pseudorandom functions and lattices, in Eurocrypt (2012)","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"9393_CR10","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, E.\u00a0Kiltz, C.\u00a0Peikert, B.\u00a0Waters, Identity-based (lossy) trapdoor functions and applications, in Eurocrypt (2012)","DOI":"10.1007\/978-3-642-29011-4_15"},{"key":"9393_CR11","unstructured":"J.\u00a0Benaloh, J.\u00a0Leichter, Generalized secret sharing and monotone functions, in Crypto (1988)"},{"key":"9393_CR12","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bendlin, I.\u00a0Damg\u00e5rd, Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems, in TCC (2010)","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"9393_CR13","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bendlin, S.\u00a0Krehbiel, C.\u00a0Peikert, How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE, in ACNS (2013)","DOI":"10.1007\/978-3-642-38980-1_14"},{"key":"9393_CR14","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, X.\u00a0Boyen, Secure identity based encryption without random oracles, in Crypto (2004)","DOI":"10.1007\/978-3-540-28628-8_27"},{"key":"9393_CR15","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, R.\u00a0Gennaro, S.\u00a0Goldfeder, A.\u00a0Jain, S.\u00a0Kim, P.\u00a0Rasmussen, A.\u00a0Sahai, Threshold cryptosystems from threshold fully homomorphic encryption, in Crypto (2018)","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"9393_CR16","unstructured":"D.\u00a0Boneh, R.\u00a0Gennaro, S.\u00a0Goldfeder, S.\u00a0Kim, A lattice-based universal thresholdizer for cryptographic systems. Cryptology ePrint Archive: Report 2017\/251, September (2017)"},{"key":"9393_CR17","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, K.\u00a0Lewi, H.\u00a0Montgomery, A.\u00a0Raghunathan, Key-homomorphic PRFs and their applications, in Crypto (2013)","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"9393_CR18","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, H.\u00a0Montogomery, A.\u00a0Raghunathan, Algebraic pseudorandom functions with improved efficiency from the augmented cascade, in ACM-CCS (2010)","DOI":"10.1145\/1866307.1866323"},{"key":"9393_CR19","doi-asserted-by":"crossref","unstructured":"C.\u00a0Cachin, K.\u00a0Kursawe, V.\u00a0Shoup, Random oracles in constantinople: practical asynchronous byzantine agreement using cryptography, in PODC (2000)","DOI":"10.1145\/343477.343531"},{"key":"9393_CR20","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, R.\u00a0Gennaro, S.\u00a0Jarecki, H.\u00a0Krawczyk, T.\u00a0Rabin, Adaptive security for threshold cryptosystems, in Crypto (1999)","DOI":"10.1007\/3-540-48405-1_7"},{"key":"9393_CR21","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, S.\u00a0Goldwasser, An efficient threshold public key cryptosystem secure against adaptive chosen-ciphertext attacks, in Eurocrypt (1999)","DOI":"10.1007\/3-540-48910-X_7"},{"key":"9393_CR22","unstructured":"M.\u00a0Chase, S.\u00a0Meiklejohn, D\u00e9j\u00e0 Q: using dual systems to revisit q-type assumptions, in Eurocrypt (2004)"},{"key":"9393_CR23","doi-asserted-by":"crossref","unstructured":"J.\u00a0Chotard, E.\u00a0Dufour\u00a0Sans, R.\u00a0Gay, D.-H. Phan, D.\u00a0Pointcheval, Decentralized multi-client functional encryption for inner product, in Asiacrypt (2018)","DOI":"10.1007\/978-3-030-03329-3_24"},{"key":"9393_CR24","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, I.\u00a0Damg\u00e5rd, S.\u00a0Dziembowski, M.\u00a0Hirt, T.\u00a0Rabin, Efficient multi-party computations secure against an adaptive adversary, in Eurocrypt (1999)","DOI":"10.1007\/3-540-48910-X_22"},{"key":"9393_CR25","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, S.\u00a0Fehr, Optimal black-box secret sharing over arbitrary abelian groups, in Crypto (2002)","DOI":"10.7146\/brics.v9i8.21726"},{"key":"9393_CR26","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, R.\u00a0Thorbek, Linear integer secret sharing and distributed exponentiation, in PKC (2006)","DOI":"10.1007\/11745853_6"},{"key":"9393_CR27","unstructured":"Y.\u00a0Desmedt, Y.\u00a0Frankel, Threshold cryptosystems, in Crypto (1989)"},{"key":"9393_CR28","unstructured":"Y.\u00a0Dodis, Exposure-resilient cryptography. PhD thesis, MIT (2000)"},{"key":"9393_CR29","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, Efficient construction of (distributed) verifiable random functions, in PKC (2003)","DOI":"10.1007\/3-540-36288-6_1"},{"key":"9393_CR30","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, A.\u00a0Yampolskiy, A verifiable random function with short proofs and keys, in PKC (2005)","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"9393_CR31","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, A.\u00a0Yampolskiy, M.\u00a0Yung, Threshold and proactive pseudo-random permutations, in TCC (2006)","DOI":"10.1007\/11681878_28"},{"key":"9393_CR32","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Frankel, P.\u00a0MacKenzie, M.\u00a0Yung, Adaptively-secure distributed public-key systems, in ESA (1999)","DOI":"10.1007\/3-540-48481-7_2"},{"key":"9393_CR33","doi-asserted-by":"crossref","unstructured":"E.\u00a0Freire, D.\u00a0Hofheinz, K.\u00a0Paterson, C.\u00a0Striecks, Programmable hash functions in the multilinear setting, in Crypto (2013)","DOI":"10.1007\/978-3-642-40041-4_28"},{"key":"9393_CR34","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, C.\u00a0Peikert, V.\u00a0Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in Proceedings of STOC (ACM, 2008), pp. 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"9393_CR35","first-page":"75","volume":"8042","author":"C Gentry","year":"2013","unstructured":"C.\u00a0Gentry, A.\u00a0Sahai, B.\u00a0Waters, Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based, in Crypto. LNCS, vol. 8042 (2013), pp. 75\u201392","journal-title":"Crypto. LNCS"},{"key":"9393_CR36","unstructured":"O.\u00a0Goldreich, Valiant\u2019s polynomial-size monotone formula for majority (2014)"},{"key":"9393_CR37","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"O.\u00a0Goldreich, S.\u00a0Goldwasser, S.\u00a0Micali, How to construct random functions. J. ACM 33, 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"9393_CR38","doi-asserted-by":"crossref","unstructured":"S.\u00a0Goldwasser, S.\u00a0Gordon, V.\u00a0Goyal, A.\u00a0Jain, J.\u00a0Katz, F.-H. Liu, A.\u00a0Sahai, E.\u00a0Shi, H.-S. Zhou, Multi-input functional encryption, in Eurocrypt (2014)","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"9393_CR39","unstructured":"S.\u00a0Goldwasser, Y.\u00a0Kalai, C.\u00a0Peikert, V.\u00a0Vaikuntanathan, Robustness of the Learning with Errors assumption, in ICS (2010)"},{"key":"9393_CR40","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gorbunov, V.\u00a0Vaikuntanathan, D.\u00a0Wichs, Leveled fully homomorphic signatures from standard lattices, in STOC (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"9393_CR41","doi-asserted-by":"crossref","unstructured":"R.\u00a0Goyal, S.\u00a0Hohenberger, V.\u00a0Koppula, B.\u00a0Waters, A generic approach to constructing and proving verifiable random functions, in TCC (2017)","DOI":"10.1007\/978-3-319-70503-3_18"},{"issue":"4","key":"9393_CR42","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"8","author":"J Hastad","year":"1999","unstructured":"J.\u00a0Hastad, R.\u00a0Impagliazzo, L.\u00a0Levin, M.\u00a0Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 8(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9393_CR43","unstructured":"D.\u00a0Hofheinz, E.\u00a0Kiltz, Programmable hash functions and their applications, in Crypto (2008)"},{"key":"9393_CR44","doi-asserted-by":"crossref","unstructured":"S.\u00a0Hoory, A.\u00a0Hager, T.\u00a0Pitassi, Monotone circuits for the majority function, in APPROX-RANDOM (2006)","DOI":"10.1007\/11830924_38"},{"key":"9393_CR45","doi-asserted-by":"crossref","unstructured":"T.\u00a0Jager, Verifiable random functions from weaker assumptions, in TCC (2015)","DOI":"10.1007\/978-3-662-46497-7_5"},{"key":"9393_CR46","doi-asserted-by":"crossref","unstructured":"S.\u00a0Jarecki, A.\u00a0Lysyanskaya, Adaptively secure threshold cryptography: introducing concurrency, removing erasures, in Eurocrypt (2000)","DOI":"10.1007\/3-540-45539-6_16"},{"key":"9393_CR47","doi-asserted-by":"crossref","unstructured":"S.\u00a0Katsumata, S.\u00a0Yamada, Partitioning via non-linear polynomial functions: more compact IBEs from ideal lattices and bilinear maps, in Asiacrypt (2016)","DOI":"10.1007\/978-3-662-53890-6_23"},{"key":"9393_CR48","doi-asserted-by":"crossref","unstructured":"A.\u00a0Lewko, B.\u00a0Waters, Efficient pseudorandom functions from the decisional linear assumption and weaker variants, in ACM-CCS (2009)","DOI":"10.1145\/1653662.1653677"},{"key":"9393_CR49","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert, M.\u00a0Joye, M.\u00a0Yung, Born and raised distributively: Fully distributed non-interactive adaptively secure threshold signatures with short shares, in PODC (2014)","DOI":"10.1145\/2611462.2611498"},{"key":"9393_CR50","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert, R.\u00a0Titiu, Multi-client functional encryption for linear functions in the standard model from LWE, in Asiacrypt (2019)","DOI":"10.1007\/978-3-030-34618-8_18"},{"key":"9393_CR51","doi-asserted-by":"crossref","unstructured":"A.\u00a0Lysyanskaya, C.\u00a0Peikert, Adaptive security in the threshold setting: from cryptosystems to signature schemes, in Asiacrypt (2001)","DOI":"10.1007\/3-540-45682-1_20"},{"key":"9393_CR52","doi-asserted-by":"crossref","unstructured":"S.\u00a0Micali, R.\u00a0Sidney, A simple method for generating and sharing pseudo-random functions, in Crypto (1995)","DOI":"10.1007\/3-540-44750-4_15"},{"key":"9393_CR53","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, C.\u00a0Peikert, Trapdoors for lattices: Simpler, tighter, faster, smaller, in Proceedings of EUROCRYPT (Springer, 2012), pp. 700\u2013718","DOI":"10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"9393_CR54","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"D.\u00a0Micciancio, O.\u00a0Regev, Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"9393_CR55","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor, B.\u00a0Pinkas, O.\u00a0Reingold, Distributed pseudo-random functions and KDCs, in Eurocrypt (1999)","DOI":"10.1007\/3-540-48910-X_23"},{"key":"9393_CR56","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor, O.\u00a0Reingold, Number-theoretic constructions of efficient pseudo-random functions, in FOCS (1997)","DOI":"10.1145\/258533.258581"},{"key":"9393_CR57","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor, O.\u00a0Reingold, A.\u00a0Rosen, Pseudo-random functions and factoring, in STOC (2000)","DOI":"10.1145\/335305.335307"},{"key":"9393_CR58","doi-asserted-by":"crossref","unstructured":"J.-B. Nielsen, A threshold pseudorandom function construction and its applications, in Crypto (2002)","DOI":"10.1007\/3-540-45708-9_26"},{"key":"9393_CR59","doi-asserted-by":"crossref","unstructured":"C.\u00a0Peikert, B.\u00a0Waters, Lossy trapdoor functions and their applications, in STOC (ACM, 2008), pp. 187\u2013196","DOI":"10.1145\/1374376.1374406"},{"key":"9393_CR60","doi-asserted-by":"crossref","unstructured":"A.\u00a0Raghunathan, G.\u00a0Segev, S.\u00a0Vadhan, Deterministic public-key encryption for adaptively chosen plaintext distributions, in Eurocrypt (2013)","DOI":"10.1007\/978-3-642-38348-9_6"},{"issue":"1","key":"9393_CR61","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"A Razborov","year":"1987","unstructured":"A.\u00a0Razborov, S.\u00a0Rudich, Natural proofs. J. Comput. Syst. Sci. 55(1), 24\u201335 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"9393_CR62","doi-asserted-by":"crossref","unstructured":"O.\u00a0Regev, On lattices, learning with errors, random linear codes, and cryptography, in STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"9393_CR63","unstructured":"R.\u00a0Thorbek, Linear integer secret sharing. PhD thesis, Department of Computer Science - University of Arhus (2009)"},{"key":"9393_CR64","unstructured":"L.\u00a0Trevisan, S.\u00a0Vadhan, Extracting randomness from samplable distributions, in FOCS (2000)"},{"issue":"5","key":"9393_CR65","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","volume":"3","author":"L Valiant","year":"1984","unstructured":"L.\u00a0Valiant, Short monotone formulae for the majority function. J. Algorithms 3(5), 363\u2013366 (1984).","journal-title":"J. Algorithms"},{"issue":"11","key":"9393_CR66","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L Valiant","year":"1984","unstructured":"L.\u00a0Valiant, A theorey of the learnable. Commun. ACM, 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"9393_CR67","doi-asserted-by":"crossref","unstructured":"B.\u00a0Waters, Efficient identity-based encryption without random oracles, in Eurocrypt (2005)","DOI":"10.1007\/11426639_7"},{"key":"9393_CR68","doi-asserted-by":"crossref","unstructured":"S.\u00a0Yamada, Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques, in Crypto (2017)","DOI":"10.1007\/978-3-319-63697-9_6"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09393-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09393-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09393-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:27:19Z","timestamp":1725150439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09393-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,2]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9393"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09393-0","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2021,6,2]]},"assertion":[{"value":"3 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"29"}}