{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:35:35Z","timestamp":1765960535695,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359074"},{"type":"electronic","value":"9783540359081"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11787006_4","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T23:23:09Z","timestamp":1151536989000},"page":"34-45","source":"Crossref","is-referenced-by-count":26,"title":["Independent Zero-Knowledge Sets"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00204448","volume":"2","author":"J. Boyar","year":"1990","unstructured":"Boyar, J., Kurtz, S.A., Krentel, M.W.: A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. J. Cryptology\u00a02(2), 63\u201376 (1990)","journal-title":"J. Cryptology"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","first-page":"480","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"B. Pfitzmann","year":"1997","unstructured":"Pfitzmann, B., Bari\u0107, N.: Collision-Free Accumulators and Fail-Stop Signature Schemes without Trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 480\u2013494. Springer, Heidelberg (1997)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","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, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, Springer, Heidelberg (2001)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","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, pp. 120\u2013144. Springer, Heidelberg (2006)"},{"key":"4_CR6","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.J.F. Cramer","year":"1996","unstructured":"Cramer, R.J.F., Damg\u00e5rd, I.B.: 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":"4_CR7","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Groth, J.: Non-interactive and reusable non-malleable commitment schemes. In: STOC 2003, pp. 426\u2013437 (2003)","DOI":"10.1145\/780542.780605"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-Interactive and Non-Malleable Commitment. In: STOC, pp. 141\u2013150 (1998)","DOI":"10.1145\/276698.276722"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"Di Crescenzo, G., Ostrovsky, R., Katz, J., Smith, A.: Efficient and Non-interactive Non-malleable Commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, Springer, Heidelberg (2001)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable Cryptography. SIAM J. Comp.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comp."},{"key":"4_CR11","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.: Magic Functions. In: FOCS (1999)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-28628-8_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"R. Gennaro","year":"2004","unstructured":"Gennaro, R.: Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 220\u2013236. Springer, Heidelberg (2004)"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11426639_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"T.G. Malkin","year":"2005","unstructured":"Malkin, T.G., Reyzin, L., Lysyanskaya, A., Chase, M., Healy, A.: Mercurial Commitments with Applications to Zero-Knowledge Sets. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 422\u2013439. Springer, Heidelberg (2005)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24676-3_23","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P.D. MacKenzie","year":"2004","unstructured":"MacKenzie, P.D., Yang, K.: On Simulation-Sound Trapdoor Commitments. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 382\u2013400. Springer, Heidelberg (2004)"},{"key":"4_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.C. Merkle","year":"1988","unstructured":"Merkle, R.C.: 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":"4_CR17","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-Knowledge Sets. In: FOCS 2003, pp. 80\u201391 (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"4_CR18","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.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: 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":"4_CR19","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","author":"C. Rackoff","year":"2004","unstructured":"Rackoff, C., Ostrovsky, R., Smith, A.: Efficient Consistency Proofs for Generalized Queries on a Committed Database. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1041\u20131053. Springer, Heidelberg (2004)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adelman, L.: A Method for Obtaining Digital Signature and Public Key Cryptosystems. Comm. of ACM\u00a021, 120\u2013126 (1978)","journal-title":"Comm. of ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787006_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:27:37Z","timestamp":1736440057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787006_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359074","9783540359081"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11787006_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}