{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:28:22Z","timestamp":1753601302272,"version":"3.41.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T00:00:00Z","timestamp":1526256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00145-018-9292-1","type":"journal-article","created":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T18:21:35Z","timestamp":1526322095000},"page":"239-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Impossibility of Structure-Preserving Deterministic Primitives"],"prefix":"10.1007","volume":"32","author":[{"given":"Masayuki","family":"Abe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Camenisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Dubovitskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,14]]},"reference":[{"key":"9292_CR1","doi-asserted-by":"crossref","unstructured":"M. Abdalla, D. Catalano, D. Fiore, Verifiable random functions from identity-based key encapsulation, in A. Joux, editor, Advances in Cryptology\u2014EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26\u201330, 2009. Proceedings. LNCS, vol. 5479 (Springer, Berlin, 2009), pp. 554\u2013571","DOI":"10.1007\/978-3-642-01001-9_32"},{"issue":"4","key":"9292_CR2","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s00145-015-9211-7","volume":"29","author":"M Abe","year":"2016","unstructured":"M. Abe, M. Chase, B. David, M. Kohlweiss, R. Nishimaki, M. Ohkubo, Constant-size structure-preserving signatures: generic constructions and simple assumptions. J. Cryptol. 29(4):833\u2013878 (2016)","journal-title":"J. Cryptol."},{"issue":"2","key":"9292_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00145-014-9196-7","volume":"29","author":"M Abe","year":"2016","unstructured":"M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Structure-preserving signatures and commitments to group elements. J. Cryptol. 29(2):363\u2013421 (2016)","journal-title":"J. Cryptol."},{"key":"9292_CR4","doi-asserted-by":"crossref","unstructured":"M. Abe, J. Groth, K. Haralambiev, M. Ohkubo, Optimal structure-preserving signatures in asymmetric bilinear groups, in Advances in Cryptology\u2014CRYPTO\u201911. LNCS. (Springer, Berlin, 2011)","DOI":"10.1007\/978-3-642-22792-9_37"},{"key":"9292_CR5","doi-asserted-by":"crossref","unstructured":"M. Abe, K. Haralambiev, M. Ohkubo, Group to group commitments do not shrink, in D. Pointcheval, T. Johansson, editors, Advances in Cryptology\u2014EUROCRYPT 2012\u201431st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15\u201319, 2012. Proceedings. LNCS, vol. 7237 (Springer, Berlin 2012), pp. 301\u2013317","DOI":"10.1007\/978-3-642-29011-4_19"},{"key":"9292_CR6","unstructured":"M. Belenkiy, M. Chase, M. Kohlweiss, A. Lysyanskaya, Non-interactive anonymous credentials, in R. Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008. LNCS, vol. 4948 (Springer, Berlin, 2008). Also available on IACR ePrint Archive, 2007\/384"},{"key":"9292_CR7","unstructured":"M. Belenkiy, M. Chase, M. Kohlweiss, A. Lysyanskaya, Compact e-cash and simulatable VRFs revisited, in H. Shacham, B. Waters, editors, Pairing-Based Cryptography\u2014Pairing 2009, Third International Conference, Palo Alto, CA, USA, August 12\u201314, 2009, Proceedings. LNCS, vol. 5671 (Springer, Berlin 2009), pp. 114\u2013131."},{"key":"9292_CR8","unstructured":"M.\u00a0Bellare, D.\u00a0Micciancio, B.\u00a0Warinschi, Foundations of group signatures: formal definitions, simplified requirements and a construction based on general assumptions, in E.\u00a0Biham, editor, Advances in Cryptology\u2014EUROCRPYT\u201903. LNCS, vol. 2656 (2003), pp. 614\u2013629"},{"key":"9292_CR9","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, A.\u00a0Palacio, The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols, in M.\u00a0Franklin, editor, Advances in Cryptology\u2014CRYPTO\u00a02004. LNCS, vol. 3152 (Springer, Berlin 2004), pp. 273\u2013289","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"9292_CR10","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, A. O\u2019Neill, Deterministic and efficiently searchable encryption, in A. Menezes, editor, Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2007, Proceedings. LNCS, vol. 4622 (Springer, Berlin, 2007), pp. 535\u2013552","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"9292_CR11","doi-asserted-by":"crossref","unstructured":"M. Bellare, M. Fischlin, A. O\u2019Neill, T. Ristenpart, Deterministic encryption: definitional equivalences and constructions without random oracles, in D. Wagner, editor, Advances in Cryptology\u2014CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2008. Proceedings. LNCS, vol. 5157 (Springer, Berlin, 2008), pp. 360\u2013378","DOI":"10.1007\/978-3-540-85174-5_20"},{"key":"9292_CR12","doi-asserted-by":"crossref","unstructured":"A. Boldyreva, S. Fehr, A. O\u2019Neill, On notions of security for deterministic encryption, and efficient constructions without random oracles, in D. Wagner, editor, Advances in Cryptology\u2014CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2008. Proceedings. LNCS, vol. 5157 (Springer, Berlin, 2008), pp. 335\u2013359","DOI":"10.1007\/978-3-540-85174-5_19"},{"key":"9292_CR13","doi-asserted-by":"crossref","unstructured":"J. Camenisch, M. Dubovitskaya, K. Haralambiev, Efficient structure-preserving signature scheme from standard assumptions, in SCN. LNCS, vol. 7485 (Springer, Berlin, 2012), pp. 76\u201394","DOI":"10.1007\/978-3-642-32928-9_5"},{"key":"9292_CR14","doi-asserted-by":"crossref","unstructured":"J. Camenisch, M. Dubovitskaya, G. Neven, Oblivious transfer with access control, in E. Al-Shaer, S. Jha, A.D. Keromytis, editors, Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, Chicago, Illinois, USA, November 9\u201313, 2009 (ACM, 2009), pp. 131\u2013140","DOI":"10.1145\/1653662.1653679"},{"key":"9292_CR15","doi-asserted-by":"crossref","unstructured":"J. Camenisch, M. Dubovitskaya, G. Neven, G.M. Zaverucha, Oblivious transfer with hidden access control policies, in D. Catalano, N. Fazio, R. Gennaro, A. Nicolosi, editors, Public Key Cryptography\u2014PKC 2011\u201414th International Conference on Practice and Theory in Public Key Cryptography, Taormina, Italy, March 6\u20139, 2011. Proceedings. LNCS, vol. 6571 (Springer, Berlin, 2011), pp. 192\u2013209","DOI":"10.1007\/978-3-642-19379-8_12"},{"key":"9292_CR16","doi-asserted-by":"crossref","unstructured":"J. Camenisch, K. Haralambiev, M. Kohlweiss, J. Lapon, V. Naessens, Structure preserving CCA secure encryption and applications, in Advances in Cryptology\u2014Asiacrypt 2011. LNCS (Springer, Berlin, 2011)","DOI":"10.1007\/978-3-642-25385-0_5"},{"key":"9292_CR17","unstructured":"J. Camenisch, S. Hohenberger, A. Lysyanskaya, Compact e-cash, in R. Cramer, editor, Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings. LNCS, vol. 3494 (Springer, Berlin 2005), pp. 302\u2013321"},{"key":"9292_CR18","doi-asserted-by":"crossref","unstructured":"J. Camenisch, A. Kiayias, M. Yung, On the portability of generalized Schnorr proofs, in A. Joux, editor, Advances in Cryptology\u2014EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26\u201330, 2009. Proceedings. LNCS, vol. 5479 (Springer, Berlin, 2009), pp. 425\u2013442","DOI":"10.1007\/978-3-642-01001-9_25"},{"key":"9292_CR19","doi-asserted-by":"crossref","unstructured":"J. Camenisch, A. Lysyanskaya, An efficient system for non-transferable anonymous credentials with optional anonymity revocation, in B. Pfitzmann, editor, Advances in Cryptology\u2014EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6\u201310, 2001, Proceeding. LNCS, vol. 2045 (Springer, Berlin, 2001), pp. 93\u2013118","DOI":"10.1007\/3-540-44987-6_7"},{"key":"9292_CR20","doi-asserted-by":"crossref","unstructured":"J. Camenisch, A. Lysyanskaya, A signature scheme with efficient protocols, in S. Cimato, C. Galdi, G. Persiano, editors, Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11\u201313, 2002. Revised Papers. LNCS, vol. 2576 (Springer, Berlin, 2002), pp. 268\u2013289","DOI":"10.1007\/3-540-36413-7_20"},{"key":"9292_CR21","doi-asserted-by":"crossref","unstructured":"J. Camenisch, A. Lysyanskaya, Signature schemes and anonymous credentials from bilinear maps, in M.K. Franklin, editor, Advances in Cryptology\u2014CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15\u201319, 2004, Proceedings. LNCS, vol. 3152 (Springer, Berlin, 2004), pp. 56\u201372","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"9292_CR22","doi-asserted-by":"crossref","unstructured":"J. Camenisch, G. Neven, A. Shelat, Simulatable adaptive oblivious transfer, in M. Naor, editor, Advances in Cryptology\u2014EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20\u201324, 2007, Proceedings. LNCS, vol. 4515 (Springer, Berlin, 2007), pp. 573\u2013590","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"9292_CR23","doi-asserted-by":"crossref","unstructured":"J. Camenisch, V. Shoup, Practical verifiable encryption and decryption of discrete logarithms, in D. Boneh, editor, Advances in Cryptology\u2014CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17\u201321, 2003, Proceedings. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 126\u2013144","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"9292_CR24","unstructured":"R.\u00a0Canetti, Universally composable security: a new paradigm for cryptographic protocols, in Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (2001), pp. 136\u2013145"},{"key":"9292_CR25","unstructured":"R.\u00a0Canetti, O.\u00a0Goldreich, S.\u00a0Halevi, The random oracle methodology, revisited, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (1998), pp. 209\u2013218"},{"key":"9292_CR26","doi-asserted-by":"crossref","unstructured":"M. Chase, A. Lysyanskaya, Simulatable VRFs with applications to multi-theorem NIZK, in A. Menezes, editor, Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2007, Proceedings. LNCS, vol. 4622 (Springer, Berlin, 2007), pp. 303\u2013322","DOI":"10.1007\/978-3-540-74143-5_17"},{"issue":"1","key":"9292_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2003","unstructured":"R.\u00a0Cramer, V.\u00a0Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput.\u00a0 33(1):167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"9292_CR28","doi-asserted-by":"crossref","unstructured":"Y. Dodis, Efficient construction of (distributed) verifiable random functions, in Y. Desmedt, editor, Public Key Cryptography\u2014PKC 2003, 6th International Workshop on Theory and Practice in Public Key Cryptography, Miami, FL, USA, January 6\u20138, 2003, Proceedings. LNCS, vol. 2567 (Springer, Berlin, 2003), pp. 1\u201317","DOI":"10.1007\/3-540-36288-6_1"},{"key":"9292_CR29","doi-asserted-by":"crossref","unstructured":"Y. Dodis, A. Yampolskiym, A verifiable random function with short proofs and keys, in S. Vaudenay, editor, Public Key Cryptography\u2014PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23\u201326, 2005, Proceedings. LNCS, vol. 3386 (Springer, Berlin, 2005), pp. 416\u2013431","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"9292_CR30","doi-asserted-by":"crossref","unstructured":"T.\u00a0ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, in G.R. Blakley, D. Chaum, editors, Advances in Cryptology\u2014CRYPTO\u201984. LNCS, vol. 196 (Springer, Berlin, 1985), pp. 10\u201318","DOI":"10.1007\/3-540-39568-7_2"},{"key":"9292_CR31","doi-asserted-by":"crossref","unstructured":"A. Escala, J. Groth, Fine-tuning Groth\u2013Sahai proofs, in H. Krawczyk, editor, Public-Key Cryptography\u2014PKC 2014\u201417th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26\u201328, 2014. Proceedings. LNCS, vol. 8383 (Springer, Berlin, 2014), pp. 630\u2013649","DOI":"10.1007\/978-3-642-54631-0_36"},{"key":"9292_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0Fiat, A. Shamir, How to prove yourself: practical solutions to identification and signature problems, in A.M. Odlyzko, editor, Advances in Cryptology\u2014CRYPTO\u201986. LNCS, vol. 263 (Springer, Berlinm 1987), pp. 186\u2013199","DOI":"10.1007\/3-540-47721-7_12"},{"key":"9292_CR33","doi-asserted-by":"crossref","unstructured":"M.J. Freedman, Y. Ishai, B. Pinkas, O. Reingold, Keyword search and oblivious pseudorandom functions, in J. Kilian, editor, Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10\u201312, 2005, Proceedings. LNCS, vol. 3378 (Springer, Berlin, 2005), pp. 303\u2013324","DOI":"10.1007\/978-3-540-30576-7_17"},{"issue":"16","key":"9292_CR34","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"S.D. Galbraith, K.G. Peterson, N.P. Smart, Pairings for cryptographers. Discrete Appl. Math.\u00a0 156(16):3113\u20133121 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9292_CR35","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\u00a0 33(4):792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"9292_CR36","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y.T. Kalai, On the (in)security of the Fiat\u2013Shamir paradigm, in 44th Symposium on Foundations of Computer Science (FOCS 2003), 11\u201314 October 2003, Cambridge, MA, USA, Proceedings (IEEE Computer Society, 2003), pp. 102\u2013113","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"9292_CR37","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, R. Ostrovsky, Invariant signatures and non-interactive zero-knowledge proofs are equivalent (extended abstract), in E.F. Brickell, editor, Advances in Cryptology\u2014CRYPTO\u201992, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16\u201320, 1992, Proceedings. LNCS, vol. 740 (Springer, Berlin, 1992), pp. 228\u2013245","DOI":"10.1007\/3-540-48071-4_16"},{"issue":"5","key":"9292_CR38","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"J Groth","year":"2012","unstructured":"J. Groth, A. Sahai, Efficient noninteractive proof systems for bilinear groups. SIAM J. Comput.\u00a0 41(5):1193\u20131232 (2012)","journal-title":"SIAM J. Comput."},{"key":"9292_CR39","doi-asserted-by":"crossref","unstructured":"C. Hazay, Y. Lindell, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, in R. Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19\u201321, 2008. LNCS, vol. 4948 (Springer, Berlin, 2008), pp. 155\u2013175","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"9292_CR40","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, T. Jager, Tightly secure signatures and public-key encryption, in CRYPTO. LNCS, vol. 7417 (Springer, Berlin, 2012), pp. 590\u2013607","DOI":"10.1007\/978-3-642-32009-5_35"},{"key":"9292_CR41","doi-asserted-by":"crossref","unstructured":"S. Hohenberger, B. Waters, Constructing verifiable random functions with large input spaces, in H. Gilbert, editor, Advances in Cryptology\u2014EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings. LNCS, vol. 6110 (Springer, Berlin, 2010), pp. 656\u2013672","DOI":"10.1007\/978-3-642-13190-5_33"},{"key":"9292_CR42","doi-asserted-by":"crossref","unstructured":"S. Jarecki, X. Liu, Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection, in O. Reingold, editor, Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15\u201317, 2009. Proceedings. LNCS, vol. 5444 (Springer, Berlin, 2009), pp. 577\u2013594","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"9292_CR43","doi-asserted-by":"crossref","unstructured":"S. Jarecki, V. Shmatikov, Handcuffing big brother: an abuse-resilient transaction escrow scheme, in C. Cachin, J. Camenisch, editors, Advances in Cryptology\u2014EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2\u20136, 2004, Proceedings. LNCS, vol. 3027 (Springer, Berlin, 2004), pp. 590\u2013608","DOI":"10.1007\/978-3-540-24676-3_35"},{"key":"9292_CR44","doi-asserted-by":"crossref","unstructured":"A. Kiayias, M. Yung, Group signatures with efficient concurrent join, in R.\u00a0Cramer, editor, Advances in Cryptology\u2014EUROCRYPT 2005. LNCS, vol. 3494 (Springer, Berlin, 2005), pp. 198\u2013214","DOI":"10.1007\/11426639_12"},{"key":"9292_CR45","doi-asserted-by":"crossref","unstructured":"M. Liskov, Updatable zero-knowledge databases, in B.K. Roy, editor, Advances in Cryptology\u2014ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4\u20138, 2005, Proceedings. LNCS, vol. 3788 (Springer, Berlin, 2005), pp. 174\u2013198","DOI":"10.1007\/11593447_10"},{"key":"9292_CR46","doi-asserted-by":"crossref","unstructured":"A. Lysyanskaya, Unique signatures and verifiable random functions from the DH-DDH separation, in M. Yung, editor, Advances in Cryptology\u2014CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18\u201322, 2002, Proceedings. LNCS, vol. 2442 (Springer, Berlin, 2002), pp. 597\u2013612","DOI":"10.1007\/3-540-45708-9_38"},{"key":"9292_CR47","doi-asserted-by":"crossref","unstructured":"S. Micali, M.O. Rabin, S.P. Vadhan, Verifiable random functions, in 40th Annual Symposium on Foundations of Computer Science, FOCS\u201999, 17\u201318 October, 1999, New York, NY, USA (IEEE Computer Society, 1999), pp. 120\u2013130","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"9292_CR48","doi-asserted-by":"crossref","unstructured":"S. Micali, L. Reyzin, Soundness in the public-key model, in J. Kilian, editor, Advances in Cryptology\u2014CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19\u201323, 2001, Proceedings. LNCS, vol. 2139 (Springer, Berlin 2001), pp. 542\u2013565","DOI":"10.1007\/3-540-44647-8_32"},{"key":"9292_CR49","doi-asserted-by":"crossref","unstructured":"S. Micali, R.L. Rivest, Micropayments revisited, in B. Preneel, editor, Topics in Cryptology\u2014CT-RSA 2002, The Cryptographer\u2019s Track at the RSA Conference, 2002, San Jose, CA, USA, February 18\u201322, 2002, Proceedings. LNCS, vol. 2271 (Springer, Berlin, 2002), pp. 149\u2013163","DOI":"10.1007\/3-540-45760-7_11"},{"key":"9292_CR50","doi-asserted-by":"crossref","unstructured":"T.P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in J.\u00a0Feigenbaum, editor, Advances in Cryptology\u2014CRYPTO\u201991. LNCS, vol. 576 (Springer, Berlin 1992), pp. 129\u2013140","DOI":"10.1007\/3-540-46766-1_9"},{"issue":"3","key":"9292_CR51","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"C.P. Schnorr, Efficient signature generation for smart cards. J. Cryptol.\u00a0 4(3):239\u2013252 (1991).","journal-title":"J. Cryptol."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-9292-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9292-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9292-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T14:13:36Z","timestamp":1751638416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-9292-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,14]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["9292"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-9292-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2018,5,14]]},"assertion":[{"value":"4 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}