{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:36:22Z","timestamp":1771706182003,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_35","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"433-444","source":"Crossref","is-referenced-by-count":497,"title":["Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack"],"prefix":"10.1007","author":[{"given":"Charles","family":"Rackoff","sequence":"first","affiliation":[]},{"given":"Daniel R.","family":"Simon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero Knowledge and its Applications, Proc. 20th ACM Symposium on Theory of Computing (1988), pp. 103\u2013112.","DOI":"10.1145\/62212.62222"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and S. Goldwasser, New Paradigms for Digital signatures and Message Authentication based on Non-Interactive Zero-Knowledge Proofs, Proc. CRYPTO\u2019 89.","DOI":"10.1007\/0-387-34805-0_19"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork and M. Naor, Non-Malleable Cryptography, Proc. 23rd ACM Symposium on Theory of Computing (1991), pp. 542\u2013552.","DOI":"10.1145\/103418.103474"},{"issue":"6","key":"35_CR4","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, New directions in Cryptography, IEEE Trans. on Information Theory 22(6), 1976, pp. 644\u2013654.","journal-title":"IEEE Trans. on Information Theory"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"A. De Santis and M. Yung, Cryptographic Applications of the Non-Interactive Metaproof and Many-Prover Systems, Proc. CRYPTO\u2019 90.","DOI":"10.1007\/3-540-38424-3_27"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat, and A. Shamir, Zero Knowledge Proofs of Identity, Proc. 19th ACM Symp. on Theory of Computing (1987), pp. 210\u2013217.","DOI":"10.1145\/28395.28419"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"U. Feige, D. Lapidot and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proc. 31st IEEE Symp. on Foundations of Computer Science (1990), pp. 308\u2013317.","DOI":"10.1109\/FSCS.1990.89549"},{"key":"35_CR8","unstructured":"Z. Galil, S. Haber and M. Yung, Symmetric Public-Key Cryptosystems, submitted to J. of Cryptology."},{"issue":"2","key":"35_CR9","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, Probabilistic Encryption, JCSS Vol. 28, No. 2 (April 1984), pp. 270\u2013299.","journal-title":"JCSS"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 291\u2013304.","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R. Rivest, A Secure Digital Signature Scheme, SIAM J. on Computing, Vol. 17,2 (1988), pp. 281\u2013308.","journal-title":"SIAM J. on Computing"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, Public-Key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks, Proc. 22nd ACM Symp on Theory of Computing (1990), pp. 427\u2013437.","DOI":"10.1145\/100216.100273"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"J. Rompel, One-Way Functions Are Necessary and Sufficient for Secure Signatures, Proc. 31st IEEE Symp. on Foundations of Computer Science (1990), pp. 387\u2013394.","DOI":"10.1145\/100216.100269"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:34Z","timestamp":1605647614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_35","relation":{},"subject":[]}}