{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:16:28Z","timestamp":1779934588062,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642363610","type":"print"},{"value":"9783642363627","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36362-7_5","type":"book-chapter","created":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T13:35:17Z","timestamp":1359984917000},"page":"55-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":254,"title":["Vector Commitments and Their Applications"],"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"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-39927-8_28","volume-title":"Information and Communications Security","author":"F. Bao","year":"2003","unstructured":"Bao, F., Deng, R.H., Zhu, H.: Variations of Diffie-Hellman Problem. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol.\u00a02836, pp. 301\u2013312. Springer, Heidelberg (2003)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-69053-0_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Micciancio, D.: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 163\u2013192. Springer, Heidelberg (1997)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-22792-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Benabbas","year":"2011","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable Delegation of Computation over Large Datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 111\u2013131. Springer, Heidelberg (2011)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"J.C. Benaloh","year":"1994","unstructured":"Benaloh, J.C., de Mare, M.: One-Way Accumulators: A Decentralized Alternative to Digital Signatures (Extended Abstract). In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 274\u2013285. Springer, Heidelberg (1994)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-00468-1_27","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 481\u2013500. Springer, Heidelberg (2009)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"5_CR8","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":"5_CR9","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. Cryptology ePrint Archive (2011), http:\/\/eprint.iacr.org\/2011\/495"},{"key":"5_CR10","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 \u2013 EUROCRYPT 2008","author":"D. Catalano","year":"2008","unstructured":"Catalano, D., Fiore, D., Messina, M.: Zero-Knowledge Sets with Short Proofs. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 433\u2013450. Springer, Heidelberg (2008)"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"2488","DOI":"10.1109\/TIT.2011.2112150","volume":"57","author":"D. Catalano","year":"2011","unstructured":"Catalano, D., Di Raimondo, M., Fiore, D., Messina, M.: Zero-knowledge sets with short proofs. IEEE Transactions on Information Theory\u00a057(4), 2488\u20132502 (2011)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR12","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":"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. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 422\u2013439. Springer, Heidelberg (2005)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11761679_1","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J.H. Cheon","year":"2006","unstructured":"Cheon, J.H.: Security Analysis of the Strong Diffie-Hellman Problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 1\u201311. Springer, Heidelberg (2006)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","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, pp. 34\u201345. Springer, Heidelberg (2006)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-03356-8_38","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"S. Hohenberger","year":"2009","unstructured":"Hohenberger, S., Waters, B.: Short and Stateless Signatures from the RSA Assumption. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 654\u2013670. Springer, Heidelberg (2009)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A. Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-Size Commitments to Polynomials and Their Applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 177\u2013194. Springer, Heidelberg (2010)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-72738-5_17","volume-title":"Applied Cryptography and Network Security","author":"J. Li","year":"2007","unstructured":"Li, J., Li, N., Xue, R.: Universal Accumulators with Efficient Nonmembership Proofs. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 253\u2013269. Springer, Heidelberg (2007)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-32009-5_34","volume-title":"CRYPTO 2012","author":"B. Libert","year":"2012","unstructured":"Libert, B., Peters, T., Yung, M.: Group Signatures with Almost-for-Free Revocation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 571\u2013589. Springer, Heidelberg (2012)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-11799-2_30","volume-title":"Theory of Cryptography","author":"B. Libert","year":"2010","unstructured":"Libert, B., Yung, M.: Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 499\u2013517. Springer, Heidelberg (2010)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","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, pp. 174\u2013198. Springer, Heidelberg (2005)"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-003-1076-8","volume":"39","author":"C.U. Martel","year":"2004","unstructured":"Martel, C.U., Nuckolls, G., Devanbu, P.T., Gertz, M., Kwong, A., Stubblebine, S.G.: A general model for authenticated data structures. Algorithmica\u00a039(1), 21\u201341 (2004)","journal-title":"Algorithmica"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-68697-5_21","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"U.M. Maurer","year":"1996","unstructured":"Maurer, U.M., Wolf, S.: Diffie-Hellman Oracles. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 268\u2013282. Springer, Heidelberg (1996)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: 44th FOCS, pp. 80\u201391. IEEE Computer Society Press (October 2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS, pp. 120\u2013130. IEEE Computer Society Press (October 1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"5_CR25","unstructured":"Naor, M., Nissim, K.: Certificate revocation and certificate update. In: Proceedings of the 7th Conference on USENIX Security Symposium, vol.\u00a07, p. 17 (1998)"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L. Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from Bilinear Pairings and Applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 275\u2013292. Springer, Heidelberg (2005)"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77048-0_1","volume-title":"Information and Communications Security","author":"C. Papamanthou","year":"2007","unstructured":"Papamanthou, C., Tamassia, R.: Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol.\u00a04861, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-30057-8_35","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"Y. Sakemi","year":"2012","unstructured":"Sakemi, Y., Hanaoka, G., Izu, T., Takenaka, M., Yasuda, M.: Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 595\u2013608. Springer, Heidelberg (2012)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Stefanov, E., van Dijk, M., Oprea, A., Juels, A.: Iris: A scalable cloud file system with efficient integrity checks. Cryptology ePrint Archive, Report 2011\/585 (2011), http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2420950.2420985"},{"key":"5_CR30","unstructured":"Tamassia, R., Triandopoulos, N.: Certification and authentication of data structures. In: Alberto Mendelzon Workshop on Foundations of Data Management (2010)"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36362-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T19:24:44Z","timestamp":1745954684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36362-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363610","9783642363627"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}