{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T04:36:01Z","timestamp":1728534961614},"reference-count":100,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s00145-022-09442-2","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T20:04:49Z","timestamp":1669925089000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minicrypt Primitives with Algebraic Structure and Applications"],"prefix":"10.1007","volume":"36","author":[{"given":"Navid","family":"Alamati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hart","family":"Montgomery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sikhar","family":"Patranabis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,1]]},"reference":[{"key":"9442_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case\/average-case equivalence, in 29th ACM STOC (ACM Press, 1997), pp. 284\u2013293","DOI":"10.1145\/258533.258604"},{"key":"9442_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, Generating hard instances of lattice problems (extended abstract). in 28th ACM STOC (ACM Press, 1996), pp. 99\u2013108","DOI":"10.1145\/237814.237838"},{"key":"9442_CR3","doi-asserted-by":"crossref","unstructured":"C. Aguilar-Melchor, P. Gaborit, A lattice-based computationally-efficient private information retrieval protocol. in Western European Workshop on Research in Cryptology (Citeseer, 2007)","DOI":"10.1109\/ISIT.2008.4595308"},{"key":"9442_CR4","doi-asserted-by":"crossref","unstructured":"G. Asharov, G. Segev, Limits on the power of indistinguishability obfuscation and functional encryption, in V. Guruswami (ed.), 56th FOCS (IEEE Computer Society Press, 2015), pp. 191\u2013209","DOI":"10.1109\/FOCS.2015.21"},{"key":"9442_CR5","doi-asserted-by":"crossref","unstructured":"B. Barak, The complexity of public-key cryptography, in Tutorials on the Foundations of Cryptography (Springer, 2017), pp. 45\u201377","DOI":"10.1007\/978-3-319-57048-8_2"},{"key":"9442_CR6","doi-asserted-by":"crossref","unstructured":"P. Baecher, C. Brzuska, M. Fischlin, Notions of black-box reductions, revisited, in K. Sako, P. Sarkar (eds.), ASIACRYPT\u00a02013, Part\u00a0I. LNCS, vol. 8269 (Springer, Heidelberg, 2013), pp. 296\u2013315","DOI":"10.1007\/978-3-642-42033-7_16"},{"key":"9442_CR7","doi-asserted-by":"crossref","unstructured":"D. Boneh, X. Boyen, H. Shacham, Short group signatures, in M. Franklin (ed.), CRYPTO\u00a02004. LNCS, vol. 3152 (Springer, Heidelberg, 2004), pp. 41\u201355","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"9442_CR8","doi-asserted-by":"crossref","unstructured":"I. Berman, A. Degwekar, R.D. Rothblum, P.N. Vasudevan. From laconic zero-knowledge to public-key cryptography\u2014extended abstract, in H. Shacham, A. Boldyreva (eds.), CRYPTO\u00a02018, Part\u00a0III. LNCS, vol. 10993 (Springer, Heidelberg, 2018), pp. 674\u2013697","DOI":"10.1007\/978-3-319-96878-0_23"},{"key":"9442_CR9","doi-asserted-by":"crossref","unstructured":"N. Bitansky, A. Degwekar, V. Vaikuntanathan, Structure vs. hardness through the obfuscation lens. in J. Katz, H. Shacham (eds.), CRYPTO\u00a02017, Part\u00a0I. LNCS, vol. 10401 (Springer, Heidelberg, 2017), pp. 696\u2013723","DOI":"10.1007\/978-3-319-63688-7_23"},{"key":"9442_CR10","doi-asserted-by":"crossref","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the Weil pairing, in J. Kilian (ed.), CRYPTO\u00a02001. LNCS, vol. 2139 (Springer, Heidelberg, 2001), pp. 213\u2013229","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9442_CR11","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S.P. Vadhan, K. Yang, On the (im)possibility of obfuscating programs, in J. Kilian (ed.), CRYPTO\u00a02001. LNCS, vol. 2139 (Springer, Heidelberg, 2001), pp. 1\u201318","DOI":"10.1007\/3-540-44647-8_1"},{"key":"9442_CR12","doi-asserted-by":"crossref","unstructured":"D. Boneh, M. Hamburg, Generalized identity based and broadcast encryption schemes, in J. Pieprzyk, editor, ASIACRYPT\u00a02008. LNCS, vol. 5350 (Springer, Heidelberg, 2008), pp. 455\u2013470","DOI":"10.1007\/978-3-540-89255-7_28"},{"key":"9442_CR13","doi-asserted-by":"crossref","unstructured":"M. Bellare, D. Hofheinz, S. Yilek, Possibility and impossibility results for encryption and commitment secure under selective opening, in EUROCRYPT (2009), pp. 1\u201335","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"9442_CR14","doi-asserted-by":"crossref","unstructured":"F. Benhamouda, H. Lin, k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits, in J.B. Nielsen, V. Rijmen (eds.), EUROCRYPT\u00a02018, Part\u00a0II. LNCS, vol. 10821 (Springer, Heidelberg, 2018), pp. 500\u2013532","DOI":"10.1007\/978-3-319-78375-8_17"},{"key":"9442_CR15","doi-asserted-by":"crossref","unstructured":"D. Boneh, K. Lewi, H.W. Montgomery, A. Raghunathan, Key homomorphic PRFs and their applications, in R. Canetti, J.A. Garay (eds.), CRYPTO\u00a02013, Part\u00a0I. LNCS, vol. 8042 (Springer, Heidelberg, 2013), pp. 410\u2013428","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"9442_CR16","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, A. Lombardi, G. Segev, V. Vaikuntanathan, Anonymous IBE, leakage resilience and circular security from new assumptions, in J.B. Nielsen, V. Rijmen (eds.), EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820 (Springer, Heidelberg, 2018), pp. 535\u2013564","DOI":"10.1007\/978-3-319-78381-9_20"},{"key":"9442_CR17","doi-asserted-by":"crossref","unstructured":"M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudo random bits, in 23rd FOCS (IEEE Computer Society Press, 1982), pp. 112\u2013117","DOI":"10.1109\/SFCS.1982.72"},{"key":"9442_CR18","doi-asserted-by":"crossref","unstructured":"D. Boneh, The decision Diffie-Hellman problem, in Third Algorithmic Number Theory Symposium (ANTS). LNCS, vol. 1423 (Springer, Heidelberg, 1998). Invited paper","DOI":"10.1007\/BFb0054851"},{"key":"9442_CR19","doi-asserted-by":"crossref","unstructured":"A. Bogdanov, A. Rosen, Pseudorandom functions: Three decades later, in Tutorials on the Foundations of Cryptography (Springer, 2017), pp. 79\u2013158","DOI":"10.1007\/978-3-319-57048-8_3"},{"key":"9442_CR20","doi-asserted-by":"crossref","unstructured":"D. Boneh, A. Sahai, B. Waters, Functional encryption: Definitions and challenges, in Y. Ishai (ed.), TCC\u00a02011. LNCS, vol. 6597 (Springer, Heidelberg, 2011), pp. 253\u2013273","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"9442_CR21","doi-asserted-by":"crossref","unstructured":"D. Boneh, R. Venkatesan, Hardness of computing the most significant bits of secret keys in diffie-hellman and related schemes, in Advances in Cryptology\u2014CRYPTO \u201996, 16th Annual International Cryptology Conference, Santa Barbara, California, USA. Proceedings (1996), pp. 129\u2013142","DOI":"10.1007\/3-540-68697-5_11"},{"key":"9442_CR22","doi-asserted-by":"crossref","unstructured":"D. Chaum, H.V. Antwerpen, Undeniable signatures, in CRYPTO (1989), pp. 212\u2013216","DOI":"10.1007\/0-387-34805-0_20"},{"key":"9442_CR23","doi-asserted-by":"crossref","unstructured":"A.R. Choudhuri, M. Ciampi, V. Goyal, A. Jain, R. Ostrovsky, Round optimal secure multiparty computation from minimal assumptions, in R. Pass, K. Pietrzak (eds.), TCC\u00a02020, Part\u00a0II. LNCS, vol. 12551 (Springer, Heidelberg, 2020), pp. 291\u2013319","DOI":"10.1007\/978-3-030-64378-2_11"},{"key":"9442_CR24","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser, S. Micali, Resettable zero-knowledge (extended abstract), in STOC (2000), pp. 235\u2013244","DOI":"10.1145\/335305.335334"},{"key":"9442_CR25","doi-asserted-by":"crossref","unstructured":"J. Chen, R. Gay, H. Wee, Improved dual system ABE in prime-order groups via predicate encodings, in E. Oswald, M. Fischlin (eds.), EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057 (Springer, Heidelberg, 2015), pp. 595\u2013624","DOI":"10.1007\/978-3-662-46803-6_20"},{"key":"9442_CR26","doi-asserted-by":"crossref","unstructured":"C. Cachin, S. Micali, M. Stadler, Computationally private information retrieval with polylogarithmic communication, in EUROCRYPT (1999), pp. 402\u2013414","DOI":"10.1007\/3-540-48910-X_28"},{"key":"9442_CR27","doi-asserted-by":"crossref","unstructured":"C. Cocks, An identity based encryption scheme based on quadratic residues, in B. Honary (ed.), 8th IMA International Conference on Cryptography and Coding. LNCS, vol. 2260 (Springer, Heidelberg, 2001), pp. 360\u2013363","DOI":"10.1007\/3-540-45325-3_32"},{"key":"9442_CR28","doi-asserted-by":"crossref","unstructured":"R. Cramer, V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in EUROCRYPT (2002), pp. 45\u201364","DOI":"10.1007\/3-540-46035-7_4"},{"key":"9442_CR29","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, From selective IBE to full IBE and selective HIBE, in Y. Kalai, L. Reyzin (eds.), TCC\u00a02017, Part\u00a0I. LNCS, vol. 10677 (Springer, Heidelberg, 2017), pp. 372\u2013408","DOI":"10.1007\/978-3-319-70500-2_13"},{"key":"9442_CR30","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, Identity-based encryption from the Diffie-Hellman assumption, in J. Katz, H. Shacham (eds.), CRYPTO\u00a02017, Part\u00a0I. LNCS, vol. 10401 (Springer, Heidelberg, 2017), pp. 537\u2013569.","DOI":"10.1007\/978-3-319-63688-7_18"},{"key":"9442_CR31","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, M. Hajiabadi, D. Masny, D. Wichs, Two-round oblivious transfer from CDH or LPN. in A. Canteaut, Y. Ishai (eds.), EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106 (Springer, Heidelberg, 2020), pp. 768\u2013797","DOI":"10.1007\/978-3-030-45724-2_26"},{"key":"9442_CR32","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, M. Hajiabadi, D. Masny, New constructions of identity-based and key-dependent message secure encryption schemes, in M. Abdalla, R. Dahab (eds.), PKC\u00a02018, Part\u00a0I. LNCS, vol. 10769 (Springer, Heidelberg, 2018), pp. 3\u201331","DOI":"10.1007\/978-3-319-76578-5_1"},{"key":"9442_CR33","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, Y. Ishai, G. Malavolta, T. Mour, R. Ostrovsky, Trapdoor hash functions and their applications, in A. Boldyreva, D. Micciancio (eds.), CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 1169 (Springer, Heidelberg, 2019), pp. 3\u201332","DOI":"10.1007\/978-3-030-26954-8_1"},{"issue":"6","key":"9442_CR34","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9442_CR35","doi-asserted-by":"crossref","unstructured":"D. Derler, C. Hanser, D. Slamanig, Revisiting cryptographic accumulators, additional properties and relations to other primitives, in K. Nyberg (ed.), CT-RSA\u00a02015. LNCS, vol. 9048 (Springer, Heidelberg, 2015), pp. 127\u2013144","DOI":"10.1007\/978-3-319-16715-2_7"},{"key":"9442_CR36","doi-asserted-by":"crossref","unstructured":"A. Escala, G. Herold, E. Kiltz, C. R\u00e0fols, J. Villar, An algebraic framework for Diffie-Hellman assumptions, in R. Canetti, J.A. Garay (eds.), CRYPTO\u00a02013, Part\u00a0II. LNCS, vol. 8043 (Springer, Heidelberg, 2013), pp. 129\u2013147","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"9442_CR37","doi-asserted-by":"crossref","unstructured":"T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, in G.R. Blakley, D. Chaum (eds.), CRYPTO\u201984. LNCS, vol. 196 (Springer, Heidelberg, 1984), pp. 10\u201318","DOI":"10.1007\/3-540-39568-7_2"},{"issue":"1","key":"9442_CR38","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02806383","volume":"14","author":"P Erd\u00f6s","year":"1965","unstructured":"P. Erd\u00f6s, A. R\u00e9nyi, Probabilistic methods in group theory. J. d\u2019Anal. Math. 14(1), 127\u2013138 (1965)","journal-title":"J. d\u2019Anal. Math."},{"key":"9442_CR39","doi-asserted-by":"crossref","unstructured":"M. Fischlin, P. Harasser, Invisible sanitizable signatures and public-key encryption are equivalent, in B. Preneel, F. Vercauteren (eds.), ACNS 18. LNCS, vol. 10892 (Springer, Heidelberg, 2018), pp. 202\u2013220","DOI":"10.1007\/978-3-319-93387-0_11"},{"key":"9442_CR40","doi-asserted-by":"crossref","unstructured":"M. Fischlin, Black-box reductions and separations in cryptography (invited talk), in A. Mitrokotsa, S. Vaudenay (eds.), AFRICACRYPT 12. LNCS, vol. 7374 (Springer, Heidelberg, 2012), pp. 413\u2013422","DOI":"10.1007\/978-3-642-31410-0_26"},{"key":"9442_CR41","doi-asserted-by":"crossref","unstructured":"D. Friolo, D. Masny, D. Venturi, A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement, in D. Hofheinz, A. Rosen (eds.), TCC\u00a02019, Part\u00a0I. LNCS, vol. 11891 (Springer, Heidelberg, 2019), pp. 111\u2013130","DOI":"10.1007\/978-3-030-36030-6_5"},{"key":"9442_CR42","doi-asserted-by":"crossref","unstructured":"C. Gentry, Fully homomorphic encryption using ideal lattices, in M. Mitzenmacher (ed.), 41st ACM STOC (ACM Press, 2009), pp. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"9442_CR43","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, Candidate multilinear maps from ideal lattices, in T. Johansson, P.Q. Nguyen (eds.), EUROCRYPT\u00a02013. LNCS, vol. 7881 (Springer, Heidelberg, 2013), pp. 1\u201317","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"9442_CR44","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits. in 54th FOCS (IEEE Computer Society Press, 2013), pp. 40\u201349","DOI":"10.1109\/FOCS.2013.13"},{"key":"9442_CR45","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, A. Sahai, B. Waters, Attribute-based encryption for circuits from multilinear maps, in R. Canetti, J.A. Garay (eds.), CRYPTO\u00a02013, Part\u00a0II. LNCS, vol. 8043 (Springer, Heidelberg, 2013), pp. 479\u2013499","DOI":"10.1007\/978-3-642-40084-1_27"},{"key":"9442_CR46","doi-asserted-by":"crossref","unstructured":"S. Garg, R. Gay, M. Hajiabadi, New techniques for efficient trapdoor functions and applications, in Y. Ishai, V. Rijmen (eds.), EUROCRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11478 (Springer, Heidelberg, 2019), pp. 33\u201363","DOI":"10.1007\/978-3-030-17659-4_2"},{"key":"9442_CR47","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions (extended abstract), in 25th FOCS (IEEE Computer Society Press, 1984), pp. 464\u2013479"},{"key":"9442_CR48","doi-asserted-by":"crossref","unstructured":"S. Garg, M. Hajiabadi, Trapdoor functions from the computational diffie-hellman assumption, in CRYPTO (2018), pp. 362\u2013391","DOI":"10.1007\/978-3-319-96881-0_13"},{"key":"9442_CR49","doi-asserted-by":"crossref","unstructured":"S. Garg, M. Hajiabadi, Trapdoor functions from the computational Diffie-Hellman assumption, in H. Shacham, A. Boldyreva (eds.), CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992 (Springer, Heidelberg, 2018), pp. 362\u2013391","DOI":"10.1007\/978-3-319-96881-0_13"},{"key":"9442_CR50","doi-asserted-by":"crossref","unstructured":"C. Gentry, S. Halevi, Compressible FHE with applications to PIR, in D. Hofheinz, A. Rosen (eds.), TCC\u00a02019, Part\u00a0II. LNCS, vol. 11892 (Springer, Heidelberg, 2019), pp. 438\u2013464","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"9442_CR51","doi-asserted-by":"crossref","unstructured":"S. Garg, M. Hajiabadi, M. Mahmoody, A. Mohammed, Limits on the power of garbling techniques for public-key encryption, in H. Shacham, A. Boldyreva (eds.), CRYPTO\u00a02018, Part\u00a0III. LNCS, vol. 10993 (Springer, Heidelberg, 2018), pp. 335\u2013364","DOI":"10.1007\/978-3-319-96878-0_12"},{"key":"9442_CR52","doi-asserted-by":"crossref","unstructured":"S. Garg, M. Hajiabadi, R. Ostrovsky, Efficient range-trapdoor functions and applications: Rate-1 OT and more, in R. Pass, K. Pietrzak (eds.), TCC\u00a02020, Part\u00a0I. LNCS, vol. 12550 (Springer, Heidelberg, 2020), pp. 88\u2013116","DOI":"10.1007\/978-3-030-64375-1_4"},{"key":"9442_CR53","doi-asserted-by":"crossref","unstructured":"O. Goldreich, L.A. Levin, A hard-core predicate for all one-way functions, in 21st ACM STOC (ACM Press, 1989), pp. 25\u201332","DOI":"10.1145\/73007.73010"},{"key":"9442_CR54","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption and how to play mental poker keeping secret all partial information, in 14th ACM STOC (ACM Press, 1982), pp. 365\u2013377","DOI":"10.1145\/800070.802212"},{"key":"9442_CR55","doi-asserted-by":"crossref","unstructured":"V. Goyal, O. Pandey, S. Richelson, Textbook non-malleable commitments, in STOC (2016)","DOI":"10.1145\/2897518.2897657"},{"key":"9442_CR56","doi-asserted-by":"crossref","unstructured":"V. Goyal, O. Pandey, A. Sahai, B. Waters, Attribute-based encryption for fine-grained access control of encrypted data, in A. Juels, R.N. Wright, S.D. Capitani di Vimercati (eds.), ACM CCS 2006 (ACM Press, 2006), pp. 89\u201398. Available as Cryptology ePrint Archive Report 2006\/309","DOI":"10.1145\/1180405.1180418"},{"key":"9442_CR57","doi-asserted-by":"crossref","unstructured":"S. Garg, O. Pandey, A. Srinivasan, M. Zhandry, Breaking the sub-exponential barrier in obfustopia, in J.-S. Coron, J.B. Nielsen (eds.), EUROCRYPT\u00a02017, Part\u00a0III. LNCS, vol. 10212 (Springer, Heidelberg, 2017), pp. 156\u2013181","DOI":"10.1007\/978-3-319-56617-7_6"},{"key":"9442_CR58","doi-asserted-by":"crossref","unstructured":"C. Gentry, C. Peikert, V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in R.E. Ladner, C. Dwork (eds.), 40th ACM STOC (ACM Press, 2008), pp. 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"9442_CR59","doi-asserted-by":"crossref","unstructured":"C. Gentry, Z. Ramzan, Single-database private information retrieval with constant communication rate, in ICALP (2005), pp. 803\u2013815","DOI":"10.1007\/11523468_65"},{"key":"9442_CR60","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Srinivasan, Two-round multiparty secure computation from minimal assumptions, in J.B. Nielsen, V. Rijmen (eds.), EUROCRYPT\u00a02018, Part\u00a0II. LNCS, vol.10821 (Springer, Heidelberg, 2018), pp. 468\u2013499","DOI":"10.1007\/978-3-319-78375-8_16"},{"key":"9442_CR61","doi-asserted-by":"crossref","unstructured":"C. Gentry, D. Wichs, Separating succinct non-interactive arguments from all falsifiable assumptions, in L. Fortnow, S.P. Vadhan (eds.), 43rd ACM STOC (ACM Press, 2011), pp. 99\u2013108","DOI":"10.1145\/1993636.1993651"},{"key":"9442_CR62","doi-asserted-by":"crossref","unstructured":"I. Haitner, J.J. Hoch, O. Reingold, G. Segev, Finding collisions in interactive protocols\u2014a tight lower bound on the round complexity of statistically-hiding commitments, in 48th FOCS (IEEE Computer Society Press, 2007), pp. 669\u2013679","DOI":"10.1109\/FOCS.2007.7"},{"issue":"4","key":"9442_CR63","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9442_CR64","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, E. Kiltz, Secure hybrid encryption from weakened key encapsulation, in A. Menezes (ed.), CRYPTO\u00a02007. LNCS, vol. 4622 (Springer, Heidelberg, 2007), pp. 553\u2013571","DOI":"10.1007\/978-3-540-74143-5_31"},{"key":"9442_CR65","doi-asserted-by":"crossref","unstructured":"M. Hajiabadi, B.M. Kapron, V. Srinivasan, On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes, in C.-M. Cheng, K.-M. Chung, G. Persiano, B.-Y. Yang (eds.), PKC\u00a02016, Part\u00a0II. LNCS, vol. 9615 (Springer, Heidelberg, 2016), pp. 129\u2013158","DOI":"10.1007\/978-3-662-49387-8_6"},{"key":"9442_CR66","doi-asserted-by":"crossref","unstructured":"B. Hemenway, R. Ostrovsky, On homomorphic encryption and chosen-ciphertext security, in M. Fischlin, J. Buchmann, M. Manulis (eds.), PKC\u00a02012. LNCS, vol. 7293 (Springer, Heidelberg, 2012), pp. 52\u201365","DOI":"10.1007\/978-3-642-30057-8_4"},{"key":"9442_CR67","doi-asserted-by":"crossref","unstructured":"N. Howgrave-Graham, Approximate integer common divisors, in Cryptography and Lattices, International Conference (CaLC) (2001), pp. 51\u201366","DOI":"10.1007\/3-540-44670-2_6"},{"key":"9442_CR68","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, Black-box constructions for secure computation, in J.M. Kleinberg (ed.), 38th ACM STOC (ACM Press, 2006), pp. 99\u2013108","DOI":"10.1145\/1132516.1132531"},{"key":"9442_CR69","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, Sufficient conditions for collision-resistant hashing, in J. Kilian (ed.), TCC\u00a02005. LNCS, vol. 3378 (Springer, Heidelberg, 2005), pp. 445\u2013456","DOI":"10.1007\/978-3-540-30576-7_24"},{"key":"9442_CR70","unstructured":"R. Impagliazzo, A personal view of average-case complexity, in Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference (1995), pp. 134\u2013147"},{"key":"9442_CR71","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, D. Zuckerman, How to recycle random bits, in 30th FOCS (IEEE Computer Society Press, 1989), pp. 248\u2013253","DOI":"10.1109\/SFCS.1989.63486"},{"key":"9442_CR72","doi-asserted-by":"crossref","unstructured":"C.S. Jutla, A. Roy, Shorter quasi-adaptive NIZK proofs for linear subspaces, in K. Sako, P. Sarkar (eds.), ASIACRYPT\u00a02013, Part\u00a0I. LNCS, vol. 8269 (Springer, Heidelberg, 2013), pp. 1\u201320","DOI":"10.1007\/978-3-642-42033-7_1"},{"key":"9442_CR73","unstructured":"E. Kushilevitz, R. Ostrovsky, Replication is NOT needed: SINGLE database, computationally-private information retrieval, in FOCS (1997), pp. 364\u2013373"},{"key":"9442_CR74","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval, in EUROCRYPT (2000), pp. 104\u2013121","DOI":"10.1007\/3-540-45539-6_9"},{"key":"9442_CR75","unstructured":"H. Krawczyk, T. Rabin, Chameleon signatures, in NDSS (2000)"},{"key":"9442_CR76","doi-asserted-by":"crossref","unstructured":"E. Kiltz, H. Wee, Quasi-adaptive NIZK for linear subspaces revisited, in E. Oswald, M. Fischlin (eds.), EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057 (Springer, Heidelberg, 2015), pp. 101\u2013128","DOI":"10.1007\/978-3-662-46803-6_4"},{"key":"9442_CR77","doi-asserted-by":"crossref","unstructured":"V. Koppula, B. Waters, Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption, in A. Boldyreva, D. Micciancio (eds.), CRYPTO\u00a02019, Part\u00a0II. LNCS, vol. 11693 (Springer, Heidelberg, 2019), pp. 671\u2013700","DOI":"10.1007\/978-3-030-26951-7_23"},{"key":"9442_CR78","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, C. Peikert, O. Regev, On ideal lattices and learning with errors over rings, in H. Gilbert (ed.), EUROCRYPT\u00a02010. LNCS, vol. 6110 (Springer, Heidelberg, 2010), pp. 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"9442_CR79","doi-asserted-by":"crossref","unstructured":"U.M. Maurer, Unifying zero-knowledge proofs of knowledge, in B. Preneel (ed.), AFRICACRYPT 09. LNCS, vol. 5580 (Springer, Heidelberg, 2009), pp. 272\u2013286","DOI":"10.1007\/978-3-642-02384-2_17"},{"key":"9442_CR80","doi-asserted-by":"crossref","unstructured":"M. Mahmoody, A. Mohammed, On the power of hierarchical identity-based encryption, in M. Fischlin, J.-S. Coron (eds.), EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol. 9666 (Springer, Heidelberg, 2016), pp. 243\u2013272","DOI":"10.1007\/978-3-662-49896-5_9"},{"key":"9442_CR81","doi-asserted-by":"crossref","unstructured":"M. Mahmoody, A. Mohammed, S. Nematihaji, R. Pass, A. Shelat, Lower bounds on assumptions behind indistinguishability obfuscation, in E. Kushilevitz, T. Malkin (eds.), TCC\u00a02016-A, Part\u00a0I. LNCS, vol. 9562 (Springer, Heidelberg, 2016), pp. 49\u201366","DOI":"10.1007\/978-3-662-49096-9_3"},{"key":"9442_CR82","doi-asserted-by":"crossref","unstructured":"M. Naor, O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions, in 36th FOCS (IEEE Computer Society Press, 1995), pp. 170\u2013181","DOI":"10.1109\/SFCS.1995.492474"},{"key":"9442_CR83","unstructured":"M. Naor, O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, in 38th FOCS (IEEE Computer Society Press, 1997), pp. 458\u2013467"},{"key":"9442_CR84","doi-asserted-by":"crossref","unstructured":"M. Naor, O. Reingold, From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs (extended abstract), in H. Krawczyk (ed.), CRYPTO\u201998. LNCS, vol. 1462 (Springer, Heidelberg, 1998), pp. 267\u2013282","DOI":"10.1007\/BFb0055734"},{"key":"9442_CR85","doi-asserted-by":"crossref","unstructured":"W. Ogata, K. Kurosawa, On claw free families, in H. Imai, R.L. Rivest, T. Matsumoto (eds.), ASIACRYPT\u201991. LNCS, vol. 739 (Springer, Heidelberg, 1993), pp. 111\u2013123","DOI":"10.1007\/3-540-57332-1_9"},{"key":"9442_CR86","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, A. Scafuro, M. Venkitasubramaniam, Resettably sound zero-knowledge arguments from OWFs\u2014the (semi) black-box way, in Y. Dodis, J.B. Nielsen (eds.), TCC\u00a02015, Part\u00a0I. LNCS, vol. 9014 (Springer, Heidelberg, 2015), pp. 345\u2013374","DOI":"10.1007\/978-3-662-46494-6_15"},{"key":"9442_CR87","doi-asserted-by":"crossref","unstructured":"P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in J. Stern (ed.), EUROCRYPT\u201999. LNCS, vol. 1592 (Springer, Heidelberg, 1999), pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9442_CR88","doi-asserted-by":"crossref","unstructured":"P. Paillier, Public-key cryptosystems based on composite degree residuosity classes,. in EUROCRYPT (1999), pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"3","key":"9442_CR89","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","unstructured":"D. Pointcheval, J. Stern, Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000).","journal-title":"J. Cryptol."},{"key":"9442_CR90","unstructured":"K. Pietrzak, J. Sj\u00f6din, Weak pseudorandom functions in minicrypt, in L. Aceto, I. Damg\u00e5rd, L.A. Goldberg, M.M. Halld\u00f3rsson, A. Ing\u00f3lfsd\u00f3ttir, I. Walukiewicz (eds.), ICALP 2008, Part\u00a0II. LNCS, vol. 5126 (Springer, Heidelberg, 2008), pp. 423\u2013436"},{"key":"9442_CR91","doi-asserted-by":"crossref","unstructured":"C. Peikert, B. Waters, Lossy trapdoor functions and their applications, in R.E. Ladner, C. Dwork (eds.), 40th ACM STOC (ACM Press, 2008), pp. 187\u2013196","DOI":"10.1145\/1374376.1374406"},{"key":"9442_CR92","unstructured":"M.O. Rabin, Digital signatures and public key functions as intractable as factorization. Technical Report MIT\/LCS\/TR-212 (Massachusetts Institute of Technology, 1979)"},{"key":"9442_CR93","doi-asserted-by":"crossref","unstructured":"O. Regev, On lattices, learning with errors, random linear codes, and cryptography, in H.N. Gabow, R. Fagin (eds.), 37th ACM STOC (ACM Press, 2005), pp. 84\u201393","DOI":"10.1145\/1060590.1060603"},{"key":"9442_CR94","doi-asserted-by":"crossref","unstructured":"J. Rompel, One-way functions are necessary and sufficient for secure signatures, in 22nd ACM STOC (ACM Press, 1990), pp. 387\u2013394","DOI":"10.1145\/100216.100269"},{"key":"9442_CR95","doi-asserted-by":"crossref","unstructured":"R. Rothblum, Homomorphic encryption: From private-key to public-key, in Y. Ishai (ed.), TCC\u00a02011. LNCS, vol. 6597 (Springer, Heidelberg, 2011) pp. 219\u2013234","DOI":"10.1007\/978-3-642-19571-6_14"},{"issue":"2","key":"9442_CR96","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2),pp. 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"9442_CR97","doi-asserted-by":"crossref","unstructured":"O. Reingold, L. Trevisan, S.P. Vadhan, Notions of reducibility between cryptographic primitives, in M. Naor (ed.), TCC\u00a02004. LNCS, vol. 2951 (Springer, Heidelberg, 2004), pp. 1\u201320","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"9442_CR98","unstructured":"H. Shacham, A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants. Cryptology ePrint Archive, Report 2007\/074 (2007). https:\/\/eprint.iacr.org\/2007\/074"},{"key":"9442_CR99","doi-asserted-by":"crossref","unstructured":"A. Sahai, B.R. Waters, Fuzzy identity-based encryption, in R. Cramer (ed.), EUROCRYPT\u00a02005. LNCS, vol. 3494 (Springer, Heidelberg, 2005), pp. 457\u2013473","DOI":"10.1007\/11426639_27"},{"key":"9442_CR100","doi-asserted-by":"crossref","unstructured":"B. Waters, Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions, in S. Halevi (ed.), CRYPTO\u00a02009. LNCS, vol. 5677 (Springer, Heidelberg, 2009), pp. 619\u2013636","DOI":"10.1007\/978-3-642-03356-8_36"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09442-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09442-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09442-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T20:22:31Z","timestamp":1728505351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09442-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":100,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["9442"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09442-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2022,12,1]]},"assertion":[{"value":"26 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}