{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:41:14Z","timestamp":1794382874897,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642173721","type":"print"},{"value":"9783642173738","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17373-8_11","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T10:22:55Z","timestamp":1291285375000},"page":"177-194","source":"Crossref","is-referenced-by-count":565,"title":["Constant-Size Commitments to Polynomials and Their Applications"],"prefix":"10.1007","author":[{"given":"Aniket","family":"Kate","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregory M.","family":"Zaverucha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11967668_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"M.H. Au","year":"2006","unstructured":"Au, M.H., Wu, Q., Susilo, W., Mu, Y.: Compact E-Cash from Bounded Accumulator. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 178\u2013195. Springer, Heidelberg (2006)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-85230-8_26","volume-title":"Financial Cryptography and Data Security","author":"M.H. Au","year":"2008","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Practical anonymous divisible e-cash from bounded accumulators. In: Tsudik, G. (ed.) FC 2008. LNCS, vol.\u00a05143, pp. 287\u2013301. Springer, Heidelberg (2008)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"11_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"11_CR6","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":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Boyen, X., Goh, E.J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 440\u2013456. Springer, Heidelberg (2005)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.3233\/JCS-2002-10304","volume":"10","author":"A. Buldas","year":"2002","unstructured":"Buldas, A., Laud, P., Lipmaa, H.: Eliminating Counterevidence with Applications to Accountable Certificate Management. Journal of Computer Security\u00a010(3), 273\u2013296 (2002)","journal-title":"Journal of Computer Security"},{"key":"11_CR10","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":"11_CR11","unstructured":"Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical report, 260, Dept. of Computer Science, ETH Zurich (1997)"},{"key":"11_CR12","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)"},{"key":"11_CR13","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":"11_CR14","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\u201313. Springer, Heidelberg (2006)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In: Proceedings of FOCS 1985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-48969-X_3","volume-title":"Lectures on Data Security","author":"I. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I.: Commitment schemes and zero-knowledge protocols. In: Damg\u00e5rd, I.B. (ed.) EEF School 1998. LNCS, vol.\u00a01561, pp. 63\u201386. Springer, Heidelberg (1999)"},{"key":"11_CR17","unstructured":"Damg\u00e5rd, I., Triandopoulos, N.: Supporting non-membership proofs with bilinear-map accumulators. Cryptology ePrint Archive: Report 2008\/538 (2008)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: Proceedings of FOCS 1987, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"11_CR19","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":"11_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/277697.277716","volume-title":"Proceedings of PODC 1998","author":"R. Gennaro","year":"1998","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In: Proceedings of PODC 1998, pp. 101\u2013111. ACM Press, New York (1998)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-74143-5_24","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"V. Goyal","year":"2007","unstructured":"Goyal, V.: Reducing Trust in the PKG in Identity Based Cryptosystems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 430\u2013447. Springer, Heidelberg (2007)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-540-73489-5_22","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"F. Guo","year":"2007","unstructured":"Guo, F., Mu, Y., Chen, Z.: Identity-Based Encryption: How to Decrypt Multiple Ciphertexts Using a Single Decryption Key. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 392\u2013406. Springer, Heidelberg (2007)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"11_CR24","unstructured":"Kate, A., Zaverucha, G., Goldberg, I.: Polynomial commitments. Technical report, CACR 2010-10, Centre for Applied Cryptographic Research, University of Waterloo (2010)"},{"key":"11_CR25","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.) Theory of Cryptography. LNCS, vol.\u00a05978, pp. 499\u2013517. Springer, Heidelberg (2010)"},{"key":"11_CR26","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., Van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, 1st edn. CRC Press, Boca Raton (1997)","edition":"1"},{"key":"11_CR27","first-page":"80","volume-title":"Proceedings of FOCS 2003","author":"S. Micali","year":"2003","unstructured":"Micali, S., Rabin, M., Kilian, J.: Zero-knowledge sets. In: Proceedings of FOCS 2003, pp. 80\u201391. IEEE, Los Alamitos (2003)"},{"issue":"2","key":"11_CR28","first-page":"481","volume":"E85-A","author":"S. Mitsunari","year":"2002","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A New Traitor Tracing. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E85-A(2), 481\u2013484 (2002)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"11_CR29","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":"11_CR30","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":"R. Ostrovsky","year":"2004","unstructured":"Ostrovsky, R., Rackoff, C., 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":"11_CR31","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":"11_CR32","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On the evaluation of powers and related problems. In: IEEE SFCS FOCS 1976, pp. 258\u2013263 (1976)","DOI":"10.1109\/SFCS.1976.21"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-642-00862-7_7","volume-title":"CT-RSA 2009","author":"M. Prabhakaran","year":"2009","unstructured":"Prabhakaran, M., Xue, R.: Statistically Hiding Sets. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 100\u2013116. Springer, Heidelberg (2009)"},{"issue":"11","key":"11_CR34","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. ACM Commun.\u00a022(11), 612\u2013613 (1979)","journal-title":"ACM Commun."},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45861-1_22","volume-title":"Information Security and Cryptology - ICISC 2001","author":"R. Steinfeld","year":"2002","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, pp. 285\u2013304. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17373-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:47:31Z","timestamp":1619772451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17373-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173721","9783642173738"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-17373-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}