{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,26]],"date-time":"2026-10-26T17:06:17Z","timestamp":1793034377096,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540432241","type":"print"},{"value":"9783540457602","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45760-7_17","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:11:12Z","timestamp":1184962272000},"page":"244-262","source":"Crossref","is-referenced-by-count":304,"title":["Homomorphic Signature Schemes"],"prefix":"10.1007","author":[{"given":"Robert","family":"Johnson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Molnar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dawn","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"issue":"9","key":"17_CR1","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/30401.30404","volume":"30","author":"N. Ahituv","year":"1987","unstructured":"Niv Ahituv, Yeheskel Lapid, and Seev Neumann. Processing encrypted data. Communications of the ACM, 30(9):777\u2013780, 1987.","journal-title":"Communications of the ACM"},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 97","author":"N. Baric","year":"1997","unstructured":"Niko Baric and Birgit Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology-EUROCRYPT\u2019 97, volume 1233 of Lecture Notes in Computer Science, pages 480\u2013494. Springer-Verlag, 1997."},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Advances in Cryptology-CRYPTO\u2019 94","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: the case of hashing and signing. In Yvo Desmedt, editor, Advances in Cryptology-CRYPTO\u2019 94, pages 216\u2013233, Berlin, 1994. Springer-Verlag. Lecture Notes in Computer Science Volume 839."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography with application to virus protection. In FOCS 1995, Berlin, 1995. Springer-Verlag.","DOI":"10.1145\/225058.225080"},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 96","author":"M. Bellare","year":"1996","unstructured":"M. Bellare and P. Rogaway. The exact security of digital signatures-how to sign with RSA and Rabin. In Ueli Maurer, editor, Advances in Cryptology-EUROCRYPT\u2019 96, pages 399\u2013416, Berlin, 1996. Springer-Verlag. Lecture Notes in Computer Science Volume 1070."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62\u201373, Fairfax, 1993.","DOI":"10.1145\/168588.168596"},{"key":"17_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT 96","author":"M. Bellare","year":"1996","unstructured":"Mihir Bellare and Phillip Rogaway. The exact security of digital signatures-how to sign with RSA and Rabin. In Ueli Maurer, editor, Advances in Cryptology-EUROCRYPT 96, volume 1070 of Lecture Notes in Computer Science. Springer-Verlag, 1996."},{"key":"17_CR8","unstructured":"J Benaloh. Dense probabilistic encryption. In Selected Areas in Cryptography, 1994."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"J.C. Benaloh and M. de Mare. One-way accumulators: A decentralized alternative to digital signatures. In EUROCRYPT\u201993, 1993.","DOI":"10.1007\/3-540-48285-7_24"},{"key":"17_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology-CRYPTO\u2019 96","author":"D. Boneh","year":"1996","unstructured":"D. Boneh and R. J. Lipton. Algorithms for black-box fields and their application to cryptography. In Neal Koblitz, editor, Advances in Cryptology-CRYPTO\u2019 96, pages 283\u2013297, Berlin, 1996. Springer-Verlag. Lecture Notes in Computer Science Volume 1109."},{"key":"17_CR11","series-title":"Lect Notes Comput Sci","first-page":"117","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 87","author":"E. F. Brickell","year":"1987","unstructured":"E. F. Brickell and Y. Yacobi. On privacy homomorphisms. In David Chaum and Wyn L. Price, editors, Advances in Cryptology-EUROCRYPT\u2019 87, pages 117\u2013126, Berlin, 1987. Springer-Verlag. Lecture Notes in Computer Science Volume 304."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"J. Cohen and M. Fischer. A robust and verifiable cryptographically secure election scheme. In 26th Symposium on the Foundations of Computer Science, 1985.","DOI":"10.1109\/SFCS.1985.2"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Cramer and Damgard. Zero knowledge proofs for finite field arithmetic-or, can zero knowledge be for free? In Advances in Cryptology-CRYPTO\u2019 98, Berlin, 1998. Springer-Verlag.","DOI":"10.1007\/BFb0055745"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum and Merritt. Open questions, talk abstracts, and summary of discussions. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1\u201345, 1991.","DOI":"10.1090\/dimacs\/002\/01"},{"key":"17_CR15","unstructured":"E. Fujisaki, T. Okamoto, and Uchiyama. EPOC: Efficient probabilistic encryption. In Submission to IEEE P1363, 1998."},{"key":"17_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology-EUROCRYPT\u201999","author":"R. Gennaro","year":"1999","unstructured":"Rosario Gennaro, Shai Halevi, and Tal Rabin. Secure hash-and-sign signatures without the random oracle. In Advances in Cryptology-EUROCRYPT\u201999, pages 123\u2013139. Springer-Verlag, 1999. Lecture Notes in Computer Science Volume 1592."},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270\u2013299, April 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Ralph Merkle. Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, CA, April 1980. IEEE Computer Society Press.","DOI":"10.1109\/SP.1980.10006"},{"key":"17_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-45760-7_16","volume-title":"Topics in Cryptology-CT-RSA 2002","author":"S. Micali","year":"2002","unstructured":"S. Micali and R. Rivest. Transitive signature schemes. In Topics in Cryptology-CT-RSA 2002, pages 236\u2013243. Springer-Verlag, 2002. Lecture Notes in Computer Science Volume 2271 (This Volume)."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"D. Naccache and J. Stern. A new public key cryptosystem based on higher residues. In 5th ACM Symposium on Computer and Communications Security, 1998.","DOI":"10.1145\/288090.288106"},{"issue":"4","key":"17_CR21","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"G. Oded","year":"1986","unstructured":"Goldreich Oded, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the ACM, 33(4):792\u2013807, October 1986.","journal-title":"Journal of the ACM"},{"key":"17_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 99","author":"P. Paillier","year":"1999","unstructured":"P Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology-EUROCRYPT\u2019 99, volume 1592 of LNCS, 1999."},{"key":"17_CR23","unstructured":"R Peralta and J. Boyar. Short discreet proofs. In Journal of Cryptology, 2000."},{"key":"17_CR24","unstructured":"R. Rivest. Two new signature schemes. Presented at Cambridge seminar; see http:\/\/www.cl.cam.ac.uk\/Research\/Security\/seminars\/2000\/rivest-tss.pdf , 2001."},{"key":"17_CR25","unstructured":"R. Rivest, L. Adleman, and M.L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, pages 169\u2013178. Academic Press, 1978."},{"key":"17_CR26","unstructured":"T. Sander, A Young, and M Yung. Non-interactive cryptocomputing in NC1. In FOCS\u2019 99, 1999."}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45760-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:07:13Z","timestamp":1556708833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45760-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432241","9783540457602"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45760-7_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}