{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:25:51Z","timestamp":1769297151477,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001713","type":"print"},{"value":"9783540361787","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36178-2_13","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:30:14Z","timestamp":1178213414000},"page":"206-224","source":"Crossref","is-referenced-by-count":15,"title":["Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Abe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Cramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 99","author":"M. Abe","year":"1999","unstructured":"Masayuki Abe. Robust distributed multiplication without interaction. In Advances in Cryptology-CRYPTO\u2019 99, volume 1666 of Lecture Notes in Computer Science. Springer-Verlag, 1999."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Gilles Brassard, David Chaum, and Claude Cr\u00e9peau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2), 1988.","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Donald Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2), 1991.","DOI":"10.1007\/BF00196771"},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 92","author":"M. Bellare","year":"1998","unstructured":"Mihir Bellare, and Oded Goldreich. On Defining Proofs of Knowledge. In Advances in Cryptology-CRYPTO\u2019 92, volume 740 of Lecture Notes in Computer Science. Springer, 1998."},{"key":"13_CR5","unstructured":"Joan F. Boyar, Mark W. Krentel, and Stuart A. Kurtz. A discrete logarithm implementation of zero-knowledge blobs. Technical Report TR-87-02, Department of Computer Science, University of Chicago, 1987."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Ronald Cramer and Ivan Damg\u00e5rd. L Linear zero-knowledge: A note on efficient zero-knowledge proofs and arguments. In 29th ACM Symposium on Theory of Computing. ACM Press, 1997.","DOI":"10.1145\/258533.258635"},{"key":"13_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"Ronald Cramer and Ivan Damg\u00e5rd. Zero-knowledge proofs for finite field arithmetic or: Can zero-knowledge be for free? In Advances in Cryptology-CRYPTO\u2019 98, volume 1462 of Lecture Notes in Computer Science. Springer, 1998."},{"key":"13_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology-CRYPTO\u2019 94, volume 839 of Lecture Notes in Computer Science. Springer, 1994."},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 02","author":"R. Cramer","year":"2002","unstructured":"Ronald Cramer and Serge Fehr. Optimal black-box secret sharing over arbitrary Abelian groups. In Advances in Cryptology-CRYPTO\u2019 02, volume 2442 of Lecture Notes in Computer Science. Springer, 2002."},{"key":"13_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 96","author":"R. Cramer","year":"1996","unstructured":"Ronald Cramer, Matthew Franklin, Berry Schoenmakes, and Moti Yung. Multiauthority secret-ballot elections with linear work. In Advances in Cryptology-EUROCRYPT\u2019 96, volume 1070 of Lecture Notes in Computer Science. Springer, 1996."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In 26th Annual Symposium on Foundations of Computer Science. IEEE, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Michael O. Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM Symposium on Principles of Distributed Computing, 1998.","DOI":"10.1145\/277697.277716"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Martin Hirt and Ueli Maurer Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In 16th ACM Symposium on Principles of Distributed Computing, 1997. Final version appeared in Journal of Cryptology 2000.","DOI":"10.1145\/259380.259412"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Maurizio Karchmer and Avi Wigderson. On span programs. In 8th Annual Conference on Structure in Complexity Theory. IEEE, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"13_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 99","author":"P. Paillier","year":"1999","unstructured":"Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology-EUROCRYPT\u2019 99, Lecture Notes in Computer Science. Springer, 1999."},{"key":"13_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 91","author":"T. P. Pedersen","year":"1991","unstructured":"Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology-CRYPTO\u2019 91, volume 576 of Lecture Notes in Computer Science. Springer, 1991."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Adi Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11), 1979.","DOI":"10.1145\/359168.359176"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36178-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:41:06Z","timestamp":1556386866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36178-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001713","9783540361787"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36178-2_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}