{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:46:30Z","timestamp":1767339990177,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":54,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819608874"},{"type":"electronic","value":"9789819608881"}],"license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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-0888-1_3","type":"book-chapter","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:11:50Z","timestamp":1733821910000},"page":"70-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Non-Interactive Blind Signatures: Post-Quantum and\u00a0Stronger Security"],"prefix":"10.1007","author":[{"given":"Foteini","family":"Baldimtsi","sequence":"first","affiliation":[]},{"given":"Jiaqi","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Rishab","family":"Goyal","sequence":"additional","affiliation":[]},{"given":"Aayush","family":"Yadav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Shweta Agrawal, Dan Boneh, and Xavier Boyen. Efficient lattice (H)IBE in the standard model. In Henri Gilbert, editor, EUROCRYPT\u00a02010, volume 6110 of LNCS, pages 553\u2013572, French Riviera, May\u00a030\u00a0\u2013\u00a0June\u00a03, 2010. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Shweta Agrawal, Dan Boneh, and Xavier Boyen. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Tal Rabin, editor, CRYPTO\u00a02010, volume 6223 of LNCS, pages 98\u2013115, Santa Barbara, CA, USA, August\u00a015\u201319, 2010. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Masayuki Abe and Eiichiro Fujisaki. How to date blind signatures. In Kwangjo Kim and Tsutomu Matsumoto, editors, ASIACRYPT\u201996, volume 1163 of LNCS, pages 244\u2013251, Kyongju, Korea, November\u00a03\u20137, 1996. Springer, Heidelberg, Germany.","DOI":"10.1007\/BFb0034851"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Gilad Asharov, Abhishek Jain, Adriana L\u00f3pez-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs. Multiparty computation with low communication, computation and interaction via threshold FHE. In David Pointcheval and Thomas Johansson, editors, EUROCRYPT\u00a02012, volume 7237 of LNCS, pages 483\u2013501, Cambridge, UK, April\u00a015\u201319, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ajtai. Generating hard instances of lattice problems (extended abstract). In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201996, page 99-108, New York, NY, USA, 1996. Association for Computing Machinery.","DOI":"10.1145\/237814.237838"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Shweta Agrawal, Elena Kirshanova, Damien Stehl\u00e9, and Anshu Yadav. Practical, round-optimal lattice-based blind signatures. In Heng Yin, Angelos Stavrou, Cas Cremers, and Elaine Shi, editors, ACM CCS 2022, pages 39\u201353, Los Angeles, CA, USA, November\u00a07\u201311, 2022. ACM Press.","DOI":"10.1145\/3548606.3560650"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-55220-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Afshar","year":"2014","unstructured":"Arash Afshar, Payman Mohassel, Benny Pinkas, and Ben Riva. Non-interactive secure computation based on cut-and-choose. In Phong\u00a0Q. Nguyen and Elisabeth Oswald, editors, EUROCRYPT\u00a02014, volume 8441 of LNCS, pages 387\u2013404, Copenhagen, Denmark, May\u00a011\u201315, 2014. Springer, Heidelberg, Germany."},{"key":"3_CR8","unstructured":"Ernest\u00a0F. Brickell, Jan Camenisch, and Liqun Chen. Direct anonymous attestation. In Vijayalakshmi Atluri, Birgit Pfitzmann, and Patrick McDaniel, editors, ACM CCS 2004, pages 132\u2013145, Washington, DC, USA, October\u00a025\u201329, 2004. ACM Press."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Saikrishna Badrinarayanan, Abhishek Jain, Rafail Ostrovsky, and Ivan Visconti. Non-interactive secure computation from one-way functions. In Thomas Peyrin and Steven Galbraith, editors, ASIACRYPT\u00a02018, Part\u00a0III, volume 11274 of LNCS, pages 118\u2013138, Brisbane, Queensland, Australia, December\u00a02\u20136, 2018. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-03332-3_5"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Foteini Baldimtsi and Anna Lysyanskaya. Anonymous credentials light. In Ahmad-Reza Sadeghi, Virgil\u00a0D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 1087\u20131098, Berlin, Germany, November\u00a04\u20138, 2013. ACM Press.","DOI":"10.1145\/2508859.2516687"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ward Beullens, Vadim Lyubashevsky, Ngoc\u00a0Khanh Nguyen, and Gregor Seiler. Lattice-based blind signatures: Short, efficient, and round-optimal. Cryptology ePrint Archive, Report 2023\/077, 2023. https:\/\/eprint.iacr.org\/2023\/077.","DOI":"10.1145\/3576915.3616613"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle, Vadim Lyubashevsky, Ngoc\u00a0Khanh Nguyen, and Alessandro Sorniotti. A framework for practical anonymous credentials from lattices. In CRYPTO\u00a02023, Part\u00a0II, LNCS, pages 384\u2013417, Santa Barbara, CA, USA, August 2023. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-031-38545-2_13"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Mihir Bellare, Chanathip Namprempre, David Pointcheval, and Michael Semanko. The power of RSA inversion oracles and the security of Chaum\u2019s RSA-based blind signature scheme. In Paul\u00a0F. Syverson, editor, FC 2001, volume 2339 of LNCS, pages 319\u2013338, Grand Cayman, British West Indies, February\u00a019\u201322, 2002. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-46088-8_25"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Mihir Bellare, Chanathip Namprempre, David Pointcheval, and Michael Semanko. The one-more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. Journal of Cryptology, 16(3):185\u2013215, June 2003.","DOI":"10.1007\/s00145-002-0120-1"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Alexandra Boldyreva. Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In Yvo Desmedt, editor, PKC\u00a02003, volume 2567 of LNCS, pages 31\u201346, Miami, FL, USA, January\u00a06\u20138, 2003. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-36288-6_3"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, and Vinod Vaikuntanathan. Reusable non-interactive secure computation. In Alexandra Boldyreva and Daniele Micciancio, editors, CRYPTO\u00a02019, Part\u00a0III, volume 11694 of LNCS, pages 462\u2013488, Santa Barbara, CA, USA, August\u00a018\u201322, 2019. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-26954-8_15"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"S\u00e9bastien Canard, Matthieu Gaud, and Jacques Traor\u00e9. Defeating malicious servers in a blind signatures based voting system. In Giovanni Di Crescenzo and Avi Rubin, editors, FC 2006, volume 4107 of LNCS, pages 148\u2013153, Anguilla, British West Indies, February\u00a027\u00a0\u2013\u00a0March\u00a02, 2006. Springer, Heidelberg, Germany.","DOI":"10.1007\/11889663_11"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"David Chaum. Blind signature system. In David Chaum, editor, CRYPTO\u201983, page 153, Santa Barbara, CA, USA, 1983. Plenum Press, New York, USA.","DOI":"10.1007\/978-1-4684-4730-9_14"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"David Cash, Dennis Hofheinz, Eike Kiltz, and Chris Peikert. Bonsai trees, or how to delegate a lattice basis. In Henri Gilbert, editor, Advances in Cryptology \u2013 EUROCRYPT 2010, pages 523\u2013552, Berlin, Heidelberg, 2010. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Alex Davidson, Ian Goldberg, Nick Sullivan, George Tankersley, and Filippo Valsorda. Privacy pass: Bypassing internet challenges anonymously. PoPETs, 2018(3):164\u2013180, July 2018.","DOI":"10.1515\/popets-2018-0026"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Rafa\u00ebl del Pino and Shuichi Katsumata. A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO\u00a02022, Part\u00a0II, volume 13508 of LNCS, pages 306\u2013336, Santa Barbara, CA, USA, August\u00a015\u201318, 2022. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-031-15979-4_11"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam\u00a0D. Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput., 38(1):97\u2013139, 2008.","journal-title":"SIAM J. Comput."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Yevgeniy Dodis, Leonid Reyzin, and Adam Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In Christian Cachin and Jan Camenisch, editors, EUROCRYPT\u00a02004, volume 3027 of LNCS, pages 523\u2013540, Interlaken, Switzerland, May\u00a02\u20136, 2004. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"3_CR24","volume-title":"and Zhenfei Zhang","author":"P-A Fouque","year":"2017","unstructured":"Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Prest, Thomas Ricosset, Gregor Seiler, William Whyte, and Zhenfei Zhang. Falcon: Fast-fourier lattice-based compact signatures over ntru. Technical report, 2017."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Christian Hanser, Chethan Kamath, and Daniel Slamanig. Practical round-optimal blind signatures in the standard model from weaker assumptions. In Vassilis Zikas and Roberto De Prisco, editors, SCN 16, volume 9841 of LNCS, pages 391\u2013408, Amalfi, Italy, August\u00a031\u00a0\u2013\u00a0September\u00a02, 2016. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-319-44618-9_21"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Christian Hanser, and Daniel Slamanig. Practical round-optimal blind signatures in the standard model. In Rosario Gennaro and Matthew J.\u00a0B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, volume 9216 of LNCS, pages 233\u2013253, Santa Barbara, CA, USA, August\u00a016\u201320, 2015. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-48000-7_12"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Christian Hanser, and Daniel Slamanig. Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. Journal of Cryptology, 32(2):498\u2013546, April 2019.","DOI":"10.1007\/s00145-018-9281-4"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Marc Fischlin. Round-optimal composable blind signatures in the common reference string model. In Cynthia Dwork, editor, CRYPTO\u00a02006, volume 4117 of LNCS, pages 60\u201377, Santa Barbara, CA, USA, August\u00a020\u201324, 2006. Springer, Heidelberg, Germany.","DOI":"10.1007\/11818175_4"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Essam Ghadafi. Efficient round-optimal blind signatures in the standard model. In Aggelos Kiayias, editor, FC 2017, volume 10322 of LNCS, pages 455\u2013473, Sliema, Malta, April\u00a03\u20137, 2017. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-319-70972-7_26"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Richard\u00a0E. Ladner and Cynthia Dwork, editors, 40th ACM STOC, pages 197\u2013206, Victoria, BC, Canada, May\u00a017\u201320, 2008. ACM Press.","DOI":"10.1145\/1374376.1374407"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Sanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schr\u00f6der, and Dominique Unruh. Round optimal blind signatures. In Phillip Rogaway, editor, CRYPTO\u00a02011, volume 6841 of LNCS, pages 630\u2013648, Santa Barbara, CA, USA, August\u00a014\u201318, 2011. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-22792-9_36"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Ethan Heilman, Leen Alshenibr, Foteini Baldimtsi, Alessandra Scafuro, and Sharon Goldberg. TumbleBit: An untrusted bitcoin-compatible anonymous payment hub. In NDSS\u00a02017, San Diego, CA, USA, February\u00a026\u00a0\u2013\u00a0March\u00a01, 2017. The Internet Society.","DOI":"10.14722\/ndss.2017.23086"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Lucjan Hanzlik. Non-interactive blind signatures for random messages. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT\u00a02023, Part\u00a0V, volume 14008 of LNCS, pages 722\u2013752, Lyon, France, April\u00a023\u201327, 2023. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-031-30589-4_25"},{"key":"3_CR34","unstructured":"Ethan Heilman, Foteini Baldimtsi, and Sharon Goldberg. Blindly signed contracts: Anonymous on-blockchain and off-blockchain bitcoin transactions. In Jeremy Clark, Sarah Meiklejohn, Peter Y.\u00a0A. Ryan, Dan\u00a0S. Wallach, Michael Brenner, and Kurt Rohloff, editors, Financial Cryptography and Data Security - FC 2016 International Workshops, BITCOIN, VOTING, and WAHC, Christ Church, Barbados, February 26, 2016, Revised Selected Papers, volume 9604 of Lecture Notes in Computer Science, pages 43\u201360. Springer, 2016."},{"issue":"4","key":"3_CR35","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"Johan H\u00e5stad, Russell Impagliazzo, Leonid\u00a0A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364\u20131396, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, and Yehuda Lindell. Concurrently-secure blind signatures without random oracles or setup assumptions. In Salil\u00a0P. Vadhan, editor, TCC\u00a02007, volume 4392 of LNCS, pages 323\u2013341, Amsterdam, The Netherlands, February\u00a021\u201324, 2007. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-70936-7_18"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Christian Hanser and Daniel Slamanig. Structure-preserving signatures on equivalence classes and their application to anonymous credentials. In Palash Sarkar and Tetsu Iwata, editors, ASIACRYPT\u00a02014, Part\u00a0I, volume 8873 of LNCS, pages 491\u2013511, Kaoshiung, Taiwan, R.O.C., December\u00a07\u201311, 2014. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-45611-8_26"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Lucjan Hanzlik and Daniel Slamanig. With a little help from my friends: Constructing practical anonymous credentials. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 2004\u20132023, Virtual Event, Republic of Korea, November\u00a015\u201319, 2021. ACM Press.","DOI":"10.1145\/3460120.3484582"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Christian Hanser and Daniel Slamanig. Structure-preserving signatures on equivalence classes and their application to anonymous credentials. In Palash Sarkar and Tetsu Iwata, editors, ASIACRYPT\u00a02014, Part\u00a0I, volume 8873 of LNCS, pages 491\u2013511, Kaoshiung, Taiwan, R.O.C., December\u00a07\u201311, 2014. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-45611-8_26"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, and Takashi Yamakawa. Round-optimal blind signatures in the plain model from classical and quantum standard assumptions. In Anne Canteaut and Fran\u00e7ois-Xavier Standaert, editors, EUROCRYPT\u00a02021, Part\u00a0I, volume 12696 of LNCS, pages 404\u2013434, Zagreb, Croatia, October\u00a017\u201321, 2021. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-77870-5_15"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell. Lower bounds and impossibility results for concurrent self composition. Journal of Cryptology, 21(2):200\u2013249, April 2008.","DOI":"10.1007\/s00145-007-9015-5"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky, Ngoc\u00a0Khanh Nguyen, and Maxime Plan\u00e7on. Efficient lattice-based blind signatures via gaussian one-time signatures. In Goichiro Hanaoka, Junji Shikata, and Yohei Watanabe, editors, PKC\u00a02022, Part\u00a0II, volume 13178 of LNCS, pages 498\u2013527, Virtual Event, March\u00a08\u201311, 2022. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-97131-1_17"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky, Ngoc\u00a0Khanh Nguyen, and Maxime Plan\u00e7on. Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO\u00a02022, Part\u00a0II, volume 13508 of LNCS, pages 71\u2013101, Santa Barbara, CA, USA, August\u00a015\u201318, 2022. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky, Adriana Palacio, and Gil Segev. Public-key cryptographic primitives provably as secure as subset sum. In Daniele Micciancio, editor, Theory of Cryptography, pages 382\u2013400, Berlin, Heidelberg, 2010. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-11799-2_23"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky. Lattice signatures without trapdoors. In David Pointcheval and Thomas Johansson, editors, EUROCRYPT\u00a02012, volume 7237 of LNCS, pages 738\u2013755, Cambridge, UK, April\u00a015\u201319, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Silvio Micali, Kazuo Ohta, and Leonid Reyzin. Accountable-subgroup multisignatures: Extended abstract. In Michael\u00a0K. Reiter and Pierangela Samarati, editors, ACM CCS 2001, pages 245\u2013254, Philadelphia, PA, USA, November\u00a05\u20138, 2001. ACM Press.","DOI":"10.1145\/501983.502017"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"Daniele Micciancio and Chris Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In David Pointcheval and Thomas Johansson, editors, EUROCRYPT\u00a02012, volume 7237 of LNCS, pages 700\u2013718, Cambridge, UK, April\u00a015\u201319, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio and O.\u00a0Regev. Worst-case to average-case reductions based on gaussian measures. In 45th Annual IEEE Symposium on Foundations of Computer Science, pages 372\u2013381, 2004.","DOI":"10.1109\/FOCS.2004.72"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"Payman Mohassel and Mike Rosulek. Non-interactive secure 2PC in the offline\/online and batch settings. In Jean-S\u00e9bastien Coron and Jesper\u00a0Buus Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0III, volume 10212 of LNCS, pages 425\u2013455, Paris, France, April\u00a030\u00a0\u2013\u00a0May\u00a04, 2017. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-319-56617-7_15"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Pratyay Mukherjee and Daniel Wichs. Two round multiparty computation via multi-key FHE. In Marc Fischlin and Jean-S\u00e9bastien Coron, editors, EUROCRYPT\u00a02016, Part\u00a0II, volume 9666 of LNCS, pages 735\u2013763, Vienna, Austria, May\u00a08\u201312, 2016. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Rafail Ostrovsky, Anat Paskin-Cherniavsky, and Beni Paskin-Cherniavsky. Maliciously circuit-private FHE. In Juan\u00a0A. Garay and Rosario Gennaro, editors, CRYPTO\u00a02014, Part\u00a0I, volume 8616 of LNCS, pages 536\u2013553, Santa Barbara, CA, USA, August\u00a017\u201321, 2014. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-44371-2_30"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"David Pointcheval and Jacques Stern. Provably secure blind signature schemes. In Kwangjo Kim and Tsutomu Matsumoto, editors, ASIACRYPT\u201996, volume 1163 of LNCS, pages 252\u2013265, Kyongju, Korea, November\u00a03\u20137, 1996. Springer, Heidelberg, Germany.","DOI":"10.1007\/BFb0034852"},{"key":"3_CR53","unstructured":"Christian Paquin and Greg Zaverucha. U-prove cryptographic specification v1.1 (revision 3). Technical report, Microsoft Corporation, December 2013."},{"key":"3_CR54","doi-asserted-by":"crossref","unstructured":"Jae\u00a0Hong Seo and Jung\u00a0Hee Cheon. Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures. In Ronald Cramer, editor, TCC\u00a02012, volume 7194 of LNCS, pages 133\u2013150, Taormina, Sicily, Italy, March\u00a019\u201321, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-28914-9_8"}],"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-0888-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:35:35Z","timestamp":1733823335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0888-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"ISBN":["9789819608874","9789819608881"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0888-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"11 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Foteini Baldimtsi and Aayush Yadav were supported by NSF #2143287 and #2247304. Rishab Goyal was supported by OVCRGE at UW\u2013Madison with funding from the Wisconsin Alumni Research Foundation.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"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"}}]}}