{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T21:15:49Z","timestamp":1765142149584,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609406"},{"type":"electronic","value":"9789819609413"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-981-96-0941-3_1","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T14:01:43Z","timestamp":1733666503000},"page":"3-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Complexity of\u00a0Cryptographic Groups and\u00a0Generic Group Models"],"prefix":"10.1007","author":[{"given":"Keyu","family":"Ji","sequence":"first","affiliation":[]},{"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Taiyu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Bingsheng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hong-Sheng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kui","family":"Ren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink, and John\u00a0P. Steinberger.On the indifferentiability of key-alternating ciphers.In Ran Canetti and Juan\u00a0A. Garay, editors, CRYPTO\u00a02013, Part\u00a0I, volume 8042 of LNCS, pages 531\u2013550. Springer, Heidelberg, August 2013.","key":"1_CR1","DOI":"10.1007\/978-3-642-40041-4_29"},{"doi-asserted-by":"crossref","unstructured":"Elaine Barker. Recommendation for key management: Part 1 \u2013 general, 2020. https:\/\/doi.org\/10.6028\/NIST.SP.800-57pt1r5.","key":"1_CR2","DOI":"10.6028\/NIST.SP.800-57pt1r5"},{"doi-asserted-by":"crossref","unstructured":"Manuel Barbosa and Pooya Farshim. Indifferentiable authenticated encryption. In Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0I, volume 10991 of LNCS, pages 187\u2013220. Springer, Heidelberg, August 2018.","key":"1_CR3","DOI":"10.1007\/978-3-319-96884-1_7"},{"doi-asserted-by":"crossref","unstructured":"Zvika Brakerski, Jonathan Katz, Gil Segev, and Arkady Yerukhimovich. Limits on the power of zero-knowledge proofs in cryptographic constructions.In Yuval Ishai, editor, TCC\u00a02011, volume 6597 of LNCS, pages 559\u2013578. Springer, Heidelberg, March 2011.","key":"1_CR4","DOI":"10.1007\/978-3-642-19571-6_34"},{"doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Dorothy\u00a0E. Denning, Raymond Pyle, Ravi Ganesan, Ravi\u00a0S. Sandhu, and Victoria Ashby, editors, ACM CCS 93, pages 62\u201373. ACM Press, November 1993.","key":"1_CR5","DOI":"10.1145\/168588.168596"},{"doi-asserted-by":"crossref","unstructured":"Jean-S\u00e9bastien Coron, Yevgeniy Dodis, C\u00e9cile Malinaud, and Prashant Puniya. Merkle-Damg\u00e5rd revisited: How to construct a hash function.In Victor Shoup, editor, CRYPTO\u00a02005, volume 3621 of LNCS, pages 430\u2013448. Springer, Heidelberg, August 2005.","key":"1_CR6","DOI":"10.1007\/11535218_26"},{"doi-asserted-by":"crossref","unstructured":"Jean-S\u00e9bastien Coron, Yevgeniy Dodis, Avradip Mandal, and Yannick Seurin. A domain extender for the ideal cipher. In Daniele Micciancio, editor, TCC\u00a02010, volume 5978 of LNCS, pages 273\u2013289. Springer, Heidelberg, February 2010.","key":"1_CR7","DOI":"10.1007\/978-3-642-11799-2_17"},{"doi-asserted-by":"crossref","unstructured":"Jean-S\u00e9bastien Coron, Thomas Holenstein, Robin K\u00fcnzler, Jacques Patarin, Yannick Seurin, and Stefano Tessaro.How to build an ideal cipher: The indifferentiability of the Feistel construction.Journal of Cryptology, 29(1):61\u2013114, January 2016.","key":"1_CR8","DOI":"10.1007\/s00145-014-9189-6"},{"doi-asserted-by":"publisher","unstructured":"Lily Chen, Dustin Moody, Karen Randall, Andrew Regenscheid, and Angela Robinson. Recommendations for discrete logarithm-based cryptography: Elliptic curve domain parameters, 2023. https:\/\/doi.org\/10.6028\/NIST.SP.800-186.","key":"1_CR9","DOI":"10.6028\/NIST.SP.800-186"},{"issue":"6","key":"1_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Whitfield Diffie and Martin\u00a0E. Hellman. New directions in cryptography. IEEE Trans. Inf. Theory, 22(6):644\u2013654, 1976.","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Nico D\u00f6ttling, Dominik Hartmann, Dennis Hofheinz, Eike Kiltz, Sven Sch\u00e4ge, and Bogdan Ursu.On the impossibility of purely algebraic signatures.In Kobbi Nissim and Brent Waters, editors, TCC\u00a02021, Part\u00a0III, volume 13044 of LNCS, pages 317\u2013349. Springer, Heidelberg, November 2021.","key":"1_CR11","DOI":"10.1007\/978-3-030-90456-2_11"},{"doi-asserted-by":"crossref","unstructured":"Yevgeniy Dodis, Thomas Ristenpart, and Thomas Shrimpton. Salvaging Merkle-Damg\u00e5rd for practical applications. In Antoine Joux, editor, EUROCRYPT\u00a02009, volume 5479 of LNCS, pages 371\u2013388. Springer, Heidelberg, April 2009.","key":"1_CR12","DOI":"10.1007\/978-3-642-01001-9_22"},{"doi-asserted-by":"crossref","unstructured":"Yevgeniy Dodis, Martijn Stam, John\u00a0P. Steinberger, and Tianren Liu. Indifferentiability of confusion-diffusion networks. In Marc Fischlin and Jean-S\u00e9bastien Coron, editors, EUROCRYPT\u00a02016, Part\u00a0II, volume 9666 of LNCS, pages 679\u2013704. Springer, Heidelberg, May 2016.","key":"1_CR13","DOI":"10.1007\/978-3-662-49896-5_24"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"Taher ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Sanjam Garg, Mohammad Mahmoody, and Ameer Mohammed. When does functional encryption imply obfuscation? In Yael Kalai and Leonid Reyzin, editors, TCC\u00a02017, Part\u00a0I, volume 10677 of LNCS, pages 82\u2013115. Springer, Heidelberg, November 2017.","key":"1_CR15","DOI":"10.1007\/978-3-319-70500-2_4"},{"doi-asserted-by":"crossref","unstructured":"Chun Guo, Lei Wang, and Dongdai Lin. Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT\u00a02023, Part\u00a0IV, volume 14007 of LNCS, pages 408\u2013439. Springer, Heidelberg, April 2023.","key":"1_CR16","DOI":"10.1007\/978-3-031-30634-1_14"},{"doi-asserted-by":"crossref","unstructured":"Thomas Holenstein, Robin K\u00fcnzler, and Stefano Tessaro. The equivalence of the random oracle model and the ideal cipher model, revisited. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC \u201911, page 89\u201398, New York, NY, USA, 2011. Association for Computing Machinery.","key":"1_CR17","DOI":"10.1145\/1993636.1993650"},{"doi-asserted-by":"crossref","unstructured":"Mohammad Hajiabadi, Mohammad Mahmoody, Wei Qi, and Sara Sarfaraz. Lower bounds on assumptions behind registration-based encryption. In Guy Rothblum and Hoeteck Wee, editors, Theory of Cryptography, pages 306\u2013334, Cham, 2023. Springer Nature Switzerland.","key":"1_CR18","DOI":"10.1007\/978-3-031-48618-0_11"},{"doi-asserted-by":"crossref","unstructured":"Chun-Yuan Hsiao and Leonid Reyzin. Finding collisions on a public road, or do secure hash functions need secret coins? In Matthew Franklin, editor, CRYPTO\u00a02004, volume 3152 of LNCS, pages 92\u2013105. Springer, Heidelberg, August 2004.","key":"1_CR19","DOI":"10.1007\/978-3-540-28628-8_6"},{"doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In 21st ACM STOC, pages 44\u201361. ACM Press, May 1989.","key":"1_CR20","DOI":"10.1145\/73007.73012"},{"doi-asserted-by":"crossref","unstructured":"Ueli\u00a0M. Maurer. Abstract models of computation in cryptography (invited paper). In Nigel\u00a0P. Smart, editor, 10th IMA International Conference on Cryptography and Coding, volume 3796 of LNCS, pages 1\u201312. Springer, Heidelberg, December 2005.","key":"1_CR21","DOI":"10.1007\/11586821_1"},{"doi-asserted-by":"crossref","unstructured":"Takahiro Matsuda and Kanta Matsuura. On black-box separations among injective one-way functions. In Yuval Ishai, editor, TCC\u00a02011, volume 6597 of LNCS, pages 597\u2013614. Springer, Heidelberg, March 2011.","key":"1_CR22","DOI":"10.1007\/978-3-642-19571-6_36"},{"doi-asserted-by":"crossref","unstructured":"Mohammad Mahmoody, Ameer Mohammed, and Soheil Nematihaji. On the impossibility of virtual black-box obfuscation in idealized models. In Eyal Kushilevitz and Tal Malkin, editors, TCC\u00a02016-A, Part\u00a0I, volume 9562 of LNCS, pages 18\u201348. Springer, Heidelberg, January 2016.","key":"1_CR23","DOI":"10.1007\/978-3-662-49096-9_2"},{"unstructured":"Ueli Maurer, Christopher Portmann, and Jiamin Zhu. Unifying generic group models. Cryptology ePrint Archive, Report 2020\/996, 2020. https:\/\/eprint.iacr.org\/2020\/996.","key":"1_CR24"},{"doi-asserted-by":"crossref","unstructured":"Ueli\u00a0M. Maurer, Renato Renner, and Clemens Holenstein. Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology.In Moni Naor, editor, TCC\u00a02004, volume 2951 of LNCS, pages 21\u201339. Springer, Heidelberg, February 2004.","key":"1_CR25","DOI":"10.1007\/978-3-540-24638-1_2"},{"issue":"2","key":"1_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"Vassiliy Ilyich Nechaev","year":"1994","unstructured":"Vassiliy\u00a0Ilyich Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2):165\u2013172, 1994.","journal-title":"Mathematical Notes"},{"doi-asserted-by":"crossref","unstructured":"Stephen Pohlig and Martin Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.). IEEE Transactions on Information Theory, 24(1):106\u2013110, 1978.","key":"1_CR27","DOI":"10.1109\/TIT.1978.1055817"},{"doi-asserted-by":"crossref","unstructured":"John\u00a0M Pollard. Monte Carlo methods for index computation (mod p). Mathematics of Computation, 32(143):918\u2013924, 1978.","key":"1_CR28","DOI":"10.1090\/S0025-5718-1978-0491431-9"},{"unstructured":"Periklis\u00a0A. Papakonstantinou, Charles\u00a0W. Rackoff, and Yevgeniy Vahlis. How powerful are the DDH hard groups? Cryptology ePrint Archive, Report 2012\/653, 2012. https:\/\/eprint.iacr.org\/2012\/653.","key":"1_CR29"},{"doi-asserted-by":"crossref","unstructured":"Phillip Rogaway and John\u00a0P. Steinberger. Constructing cryptographic hash functions from fixed-key blockciphers. In David Wagner, editor, CRYPTO\u00a02008, volume 5157 of LNCS, pages 433\u2013450. Springer, Heidelberg, August 2008.","key":"1_CR30","DOI":"10.1007\/978-3-540-85174-5_24"},{"doi-asserted-by":"crossref","unstructured":"Thomas Ristenpart, Hovav Shacham, and Thomas Shrimpton. Careful with composition: Limitations of the indifferentiability framework.In Kenneth\u00a0G. Paterson, editor, EUROCRYPT\u00a02011, volume 6632 of LNCS, pages 487\u2013506. Springer, Heidelberg, May 2011.","key":"1_CR31","DOI":"10.1007\/978-3-642-20465-4_27"},{"doi-asserted-by":"crossref","unstructured":"Lior Rotem, Gil Segev, and Ido Shahaf. Generic-group delay functions require hidden-order groups. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0III, volume 12107 of LNCS, pages 155\u2013180. Springer, Heidelberg, May 2020.","key":"1_CR32","DOI":"10.1007\/978-3-030-45727-3_6"},{"doi-asserted-by":"crossref","unstructured":"Omer Reingold, Luca Trevisan, and Salil\u00a0P. Vadhan. Notions of reducibility between cryptographic primitives. In Moni Naor, editor, TCC\u00a02004, volume 2951 of LNCS, pages 1\u201320. Springer, Heidelberg, February 2004.","key":"1_CR33","DOI":"10.1007\/978-3-540-24638-1_1"},{"doi-asserted-by":"crossref","unstructured":"Gili Schul-Ganz and Gil Segev. Accumulators in (and beyond) generic groups: Non-trivial batch verification requires interaction.In Rafael Pass and Krzysztof Pietrzak, editors, TCC\u00a02020, Part\u00a0II, volume 12551 of LNCS, pages 77\u2013107. Springer, Heidelberg, November 2020.","key":"1_CR34","DOI":"10.1007\/978-3-030-64378-2_4"},{"unstructured":"Gili Schul-Ganz and Gil Segev. Generic-group identity-based encryption: A tight impossibility result. In Information Theoretic Cryptography, 2021.","key":"1_CR35"},{"doi-asserted-by":"crossref","unstructured":"Victor Shoup. Lower bounds for discrete logarithms and related problems. In Walter Fumy, editor, EUROCRYPT\u201997, volume 1233 of LNCS, pages 256\u2013266. Springer, Heidelberg, May 1997.","key":"1_CR36","DOI":"10.1007\/3-540-69053-0_18"},{"doi-asserted-by":"crossref","unstructured":"Mark Zhandry. To label, or not to label (in generic groups).In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO\u00a02022, Part\u00a0III, volume 13509 of LNCS, pages 66\u201396. Springer, Heidelberg, August 2022.","key":"1_CR37","DOI":"10.1007\/978-3-031-15982-4_3"},{"unstructured":"Cong Zhang, Keyu Ji, Taiyu Wang, Bingsheng Zhang, Hong-Sheng Zhou, Xin Wang, and Kui Ren. On the complexity of cryptographic groups and generic group models. In Cryptology ePrint Archive, Paper 2024\/1452, 2024. https:\/\/eprint.iacr.org\/2024\/1452.","key":"1_CR38"},{"doi-asserted-by":"crossref","unstructured":"Mark Zhandry and Cong Zhang. Impossibility of order-revealing encryption in idealized models. In Amos Beimel and Stefan Dziembowski, editors, TCC\u00a02018, Part\u00a0II, volume 11240 of LNCS, pages 129\u2013158. Springer, Heidelberg, November 2018.","key":"1_CR39","DOI":"10.1007\/978-3-030-03810-6_5"},{"doi-asserted-by":"crossref","unstructured":"Mark Zhandry and Cong Zhang. Indifferentiability for public key cryptosystems. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0I, volume 12170 of LNCS, pages 63\u201393. Springer, Heidelberg, August 2020.","key":"1_CR40","DOI":"10.1007\/978-3-030-56784-2_3"},{"doi-asserted-by":"crossref","unstructured":"Cong Zhang and Mark Zhandry. The relationship between idealized models under computationally bounded adversaries. In ASIACRYPT\u00a02023, 2023.","key":"1_CR41","DOI":"10.1007\/978-981-99-8736-8_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0941-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T14:01:59Z","timestamp":1733666519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0941-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609406","9789819609413"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0941-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}