{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T15:28:07Z","timestamp":1746199687172},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,28]],"date-time":"2012-03-28T00:00:00Z","timestamp":1332892800000},"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":[[2013,4]]},"DOI":"10.1007\/s00145-012-9122-9","type":"journal-article","created":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T07:55:21Z","timestamp":1332834921000},"page":"251-279","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Mercurial Commitments with Applications to Zero-Knowledge Sets"],"prefix":"10.1007","volume":"26","author":[{"given":"Melissa","family":"Chase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Healy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,28]]},"reference":[{"issue":"3","key":"9122_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s001459900009","volume":"9","author":"M. Bellare","year":"1996","unstructured":"M. Bellare, M. Yung, Certifying permutations: non-interactive zero-knowledge based on any trapdoor permutation. J. Cryptol.\n                  9(3), 149\u2013166 (1996)","journal-title":"J. Cryptol."},{"issue":"6","key":"9122_CR2","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De\u00a0Santis, S. Micali, G. Persiano, Non-interactive zero-knowledge. SIAM J. Comput.\n                  20(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9122_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau, Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\n                  37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9122_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/11681878_7","volume-title":"Third Theory of Cryptography Conference, TCC 2006","author":"D. Catalano","year":"2006","unstructured":"D. Catalano, Y. Dodis, I. Visconti, Mercurial commitments: minimal assumptions and efficient constructions, in Third Theory of Cryptography Conference, TCC 2006, ed. by S. Halevi, T. Rabin. Lecture Notes in Computer Science, vol. 3876 (Springer, Berlin, 2006), pp. 120\u2013144"},{"key":"9122_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-78967-3_25","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2008","author":"D. Catalano","year":"2008","unstructured":"D. Catalano, D. Fiore, M. Messina, Zero-knowledge sets with short proofs, in Advances in Cryptology\u2014EUROCRYPT 2008, ed. by N.P. Smart. Lecture Notes in Computer Science, vol. 4965 (Springer, Berlin, 2008), pp. 433\u2013450"},{"key":"9122_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11426639_25","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2005","author":"M. Chase","year":"2005","unstructured":"M. Chase, A. Healy, A. Lysyanskaya, T. Malkin, L. Reyzin, Mercurial commitments with applications to zero-knowledge sets, in Advances in Cryptology\u2014EUROCRYPT 2005, ed. by R. Cramer. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 422\u2013439"},{"issue":"1","key":"9122_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"U. Feige, D. Lapidot, A. Shamir, Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput.\n                  29(1), 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"9122_CR8","unstructured":"M. Fischlin, Trapdoor commitment schemes and their applications. PhD thesis, University of Frankfurt am Main, December 2001"},{"key":"9122_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"RSA Security 2002 Cryptographer\u2019s Track","author":"M. Fischlin","year":"2002","unstructured":"M. Fischlin, R. Fischlin, The representation problem based on factoring, in RSA Security 2002 Cryptographer\u2019s Track. Lecture Notes in Computer Science, vol. 2271 (Springer, Berlin, 2002)"},{"key":"9122_CR10","volume-title":"33rd International Colloquium on Automata, Languages and Programming (ICALP)","author":"R. Gennaro","year":"2006","unstructured":"R. Gennaro, S. Micali, Independent zero-knowledge sets, in 33rd International Colloquium on Automata, Languages and Programming (ICALP) (2006)"},{"key":"9122_CR11","series-title":"Lecture Notes in Computer Science","first-page":"228","volume-title":"Advances in Cryptology\u2014CRYPTO\u201992","author":"S. Goldwasser","year":"1992","unstructured":"S. Goldwasser, R. Ostrovsky, Invariant signatures and non-interactive zero-knowledge proofs are equivalent, in Advances in Cryptology\u2014CRYPTO\u201992, ed. by E.F. Brickell. Lecture Notes in Computer Science, vol. 740 (Springer, Berlin, 1992), pp. 228\u2013244"},{"issue":"2","key":"9122_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput.\n                  17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9122_CR13","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.\n                  28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9122_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology\u2014CRYPTO\u201994","author":"C.H. Lim","year":"1994","unstructured":"C.H. Lim, P.J. Lee, More flexible exponentiation with precomputation, in Advances in Cryptology\u2014CRYPTO\u201994, 21\u201325 August, ed. by Y.G. Desmedt. Lecture Notes in Computer Science, vol. 839 (Springer, Berlin, 1994), pp. 95\u2013107"},{"key":"9122_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11593447_10","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2005","author":"M. Liskov","year":"2005","unstructured":"M. Liskov, Updatable zero-knowledge databases, in Advances in Cryptology\u2014ASIACRYPT 2005. Lecture Notes in Computer Science, vol. 3788 (Springer, Berlin, 2005), pp. 174\u2013198"},{"key":"9122_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology\u2014CRYPTO 2002","author":"A. Lysyanskaya","year":"2002","unstructured":"A. Lysyanskaya, Unique signatures and verifiable random functions from the DH-DDH separation, in Advances in Cryptology\u2014CRYPTO 2002, ed. by M. Yung. Lecture Notes in Computer Science (Springer, Berlin, 2002), pp. 597\u2013612"},{"key":"9122_CR17","unstructured":"A. Lysyanskaya, Signature schemes and applications to cryptographic protocol design. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, September 2002"},{"key":"9122_CR18","unstructured":"S. Micali, 6.875: Introduction to Cryptography. MIT course taught in Fall 1997"},{"key":"9122_CR19","first-page":"120","volume-title":"Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Micali","year":"1999","unstructured":"S. Micali, M. Rabin, S. Vadhan, Verifiable random functions, in Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, 1999), pp. 120\u2013130"},{"key":"9122_CR20","first-page":"80","volume-title":"Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Micali","year":"2003","unstructured":"S. Micali, M. Rabin, J. Kilian, Zero-knowledge sets, in Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, 2003), pp. 80\u201391"},{"issue":"2","key":"9122_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"M. Naor, Bit commitment using pseudorandomness. J. Cryptol.\n                  4(2), 51\u2013158 (1991)","journal-title":"J. Cryptol."},{"key":"9122_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1007\/978-3-540-27836-8_87","volume-title":"Automata, Languages and Programming: 31st International Colloquium, ICALP 2004","author":"R. Ostrovsky","year":"2004","unstructured":"R. Ostrovsky, C. Rackoff, A. Smith, Efficient consistency proof on a committed database, in Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12\u201316, 2004. Lecture Notes in Computer Science, vol. 3142 (Springer, Berlin, 2004), pp. 1041\u20131053"},{"key":"9122_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology\u2014CRYPTO\u201991","author":"T.P. Pedersen","year":"1992","unstructured":"T.P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in Advances in Cryptology\u2014CRYPTO\u201991, ed. by J. Feigenbaum. Lecture Notes in Computer Science, vol. 576 (Springer, Berlin, 1992), pp. 129\u2013140"},{"key":"9122_CR24","unstructured":"M. Prabhakaran, R. Xue, Statistically hiding sets. Cryptology ePrint Archive, Report 2007\/349, 2007. \n                    http:\/\/eprint.iacr.org\/"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9122-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-012-9122-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9122-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9122-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:08:10Z","timestamp":1586333290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-012-9122-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,28]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9122"],"URL":"https:\/\/doi.org\/10.1007\/s00145-012-9122-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,28]]},"assertion":[{"value":"5 May 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2012","order":2,"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"}]}}