{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T05:22:34Z","timestamp":1791436954395,"version":"4.3.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540789666","type":"print"},{"value":"9783540789673","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78967-3_25","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T04:11:30Z","timestamp":1207282290000},"page":"433-450","source":"Crossref","is-referenced-by-count":43,"title":["Zero-Knowledge Sets with Short Proofs"],"prefix":"10.1007","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariagrazia","family":"Messina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security (1993)","DOI":"10.1145\/168588.168596"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, P.: Non Interactive Zero Knowledge. SIAM Journal on Computing\u00a020(6) (1991)","DOI":"10.1137\/0220068"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, Springer, Heidelberg (2004)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_7","volume-title":"Theory of Cryptography","author":"D. Catalano","year":"2006","unstructured":"Catalano, D., Dodis, Y., Visconti, I.: Mercurial Commitments: Minimal Assumptions and Efficient Constructions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, Springer, Heidelberg (2006)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Chase","year":"2005","unstructured":"Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, Springer, Heidelberg (2005)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Hee Cheon","year":"2006","unstructured":"Hee Cheon, J.: Security Analysis of the Strong Diffie-Hellman Problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, Springer, Heidelberg (2006)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/3-540-68697-5_14","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"R. Cramer","year":"1996","unstructured":"Cramer, R., Damg\u00e5rd, I.: New Generation of Secure and Practical RSA-based signatures. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 173\u2013185. Springer, Heidelberg (1996)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"I. Damg\u00e5rd","year":"1988","unstructured":"Damg\u00e5rd, I.: Collision free hash functions and public key signature schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 203\u2013216. Springer, Heidelberg (1988)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s001459900043","volume":"11","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M.: An efficient existentially unforgeable signature scheme and its applications. J. of Cryptology\u00a011(3), 187\u2013208 (1998)","journal-title":"J. of Cryptology"},{"key":"25_CR10","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for Cryptographers, Cryptology ePrint Archive, Report 2006\/165 (2006), \n                  \n                    http:\/\/eprint.iacr.org\/"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_4","volume-title":"Automata, Languages and Programming","author":"R. Gennaro","year":"2006","unstructured":"Gennaro, R., Micali, S.: Independent Zero-Knowledge Sets. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, Springer, Heidelberg (2006)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"S. Goldwasser","year":"1993","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant Signatures and Non Interactive Zero Knowledge proofs are equivalent. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, Springer, Heidelberg (1993)"},{"key":"25_CR13","unstructured":"Lim, C.H.: Efficient Multi-Exponentiation and Application to Batch Verification of Digital Signatures (unpublished manuscript) (August 2000)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H.: More Flexible Exponentiation with Precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, Springer, Heidelberg (1994)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_10","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M. Liskov","year":"2005","unstructured":"Liskov, M.: Updatable zero-knowledge databases. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, Springer, Heidelberg (2005)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"R. Merkle","year":"1988","unstructured":"Merkle, R.: A Digital Signature based on a Conventional Encryption Function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 369\u2013378. Springer, Heidelberg (1988)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Kilian, J.K.: Zero-Knowledge Sets. In: In proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science \u2013 FOCS 2003 (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable Random Functions. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science \u2013 FOCS 1999 (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"R. Ostrovsky","year":"2004","unstructured":"Ostrovsky, R., Rackoff, C., Smith, A.: Efficient consistency proof on a committed database. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, Springer, Heidelberg (2004)"},{"key":"25_CR20","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 - CRYPTO \u201991","author":"T. Pedersen","year":"1992","unstructured":"Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"25_CR21","unstructured":"Prabhakaran, M., Xue, R.: Statistically Hiding Sets, Cryptology ePrint Archive, Report 2007\/349 (2007), \n                  \n                    http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78967-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:05:49Z","timestamp":1619521549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78967-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789666","9783540789673"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78967-3_25","relation":{},"subject":[]}}