{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:28:46Z","timestamp":1768318126474,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583332","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_8","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"61-74","source":"Crossref","is-referenced-by-count":45,"title":["Designated Confirmer Signatures and Public-Key Encryption are Equivalent"],"prefix":"10.1007","author":[{"given":"Tatsuaki","family":"Okamoto","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., and Cr\u00e9peau, C.: Minimum Disclosure Proofs of Knowledge. J. Computer and System Sciences, 37 (1988) 156\u2013189","journal-title":"J. Computer and System Sciences"},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-38424-3_14","volume-title":"Proc. of Crypto\u201990","author":"J. Boyar","year":"1991","unstructured":"Boyar, J., Chaum, D., Damg\u00e5rd, I., Pedersen, T.: Convertible Undeniable Signatures. Proc. of Crypto\u201990, LNCS 537, Springer-Verlag, (1991) 189\u2013205"},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Proc. of Eurocrypto\u201990","author":"D. Chaum","year":"1991","unstructured":"Chaum, D.: Zero-Knowledge Undeniable Signatures. Proc. of Eurocrypto\u201990, LNCS 473, Springer-Verlag, (1991) 458\u2013464"},{"key":"8_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Eurocrypt\u2019 94","author":"D. Chaum","year":"1994","unstructured":"Chaum, D.: Designated Confirmer Signatures. Proc. of Eurocrypt\u2019 94, LNCS, Springer-Verlag (to appear)"},{"key":"8_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Proc. of Crypto\u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., van Antwerpen, H.: Undeniable Signatures. Proc. of Crypto\u201989, LNCS 435, Springer-Verlag, (1990) 212\u2013216"},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M. E.: New Directions in Cryptography. IEEE Trans. Information Theory, 22,6, (1976) 644\u2013654","journal-title":"IEEE Trans. Information Theory"},{"issue":"4","key":"8_CR7","first-page":"460","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Information Theory, 31,4, (1985) 460\u2013472","journal-title":"IEEE Trans. Information Theory"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-Knowledge Proofs of Identity. J. of Cryptology, 1,2 (1988) 77\u201394","journal-title":"J. of Cryptology"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1984","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. J. of ACM, 33,4 (1984) 792\u2013807","journal-title":"J. of ACM"},{"key":"8_CR10","unstructured":"Goldreich, O., Levin, L.: A Hard-Core Predicate for any One-way Function. Proc. of STOC\u201989 (1989) 25\u201332"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Computer and System Sciences, 28,2 (1984) 270\u2013299","journal-title":"J. Computer and System Sciences"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., 18,1 (1989) 186\u2013208","journal-title":"SIAM J. Comput."},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput., 17,2 (1988) 281\u2013308","journal-title":"SIAM J. Comput."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design. Proc. FOCS (1986) 174\u2013187","DOI":"10.1109\/SFCS.1986.47"},{"key":"8_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Proc. of Eurocrypt\u201988","author":"L. C. Guillou","year":"1988","unstructured":"Guillou, L. C., Quisquater, J.J.: A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. Proc. of Eurocrypt\u201988, LNCS 330, Springer-Verlag (1988) 123\u2013128"},{"key":"8_CR16","unstructured":"H\u00e5stad, J.: Pseudo-Random Generators under Uniform Assumptions. Proc. of STOC (1990) 395\u2013404"},{"key":"8_CR17","unstructured":"Impagliazzo, R., Levin, L., Luby, L.: Pseudo-Random Number Generation from One-Way Functions. Proc. of STOC (1989) 12\u201324"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the Provable Consequence of One-Way Permutations. Proc. of STOC (1989) 44\u201361","DOI":"10.1145\/73007.73012"},{"key":"8_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48184-2_4","volume-title":"Proc. of Crypto\u201987","author":"R. Impagliazzo","year":"1988","unstructured":"Impagliazzo, R., Yung, M.: Direct Minimum-Knowledge Computations. Proc. of Crypto\u201987, LNCS 293, Springer-Verlag (1988) 40\u201351"},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"Micali, S., Rackoff, C., Sloan, B.: The Notion of Security of Probabilistic Cryptosystems. SIAM J. Comput., 17,2 (1988) 412\u2013426","journal-title":"SIAM J. Comput."},{"key":"8_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Proc. of Crypto\u201989","author":"M. Naor","year":"1990","unstructured":"Naor, M.: Bit Commitment Using Pseudo-Randomness. Proc. of Crypto\u201989, LNCS 435, Springer-Verlag, (1990) 128\u2013136"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal One-Way Hash Functions and Their Cryptographic Applications. Proc. of STOC (1989) 33\u201343","DOI":"10.1145\/73007.73011"},{"key":"8_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/0-387-34799-2_17","volume-title":"Proc. of Crypto\u201988","author":"K. Ohta","year":"1990","unstructured":"Ohta, K., Okamoto, T.: A Modification of the Fiat-Shamir Scheme. Proc. of Crypto\u201988, LNCS 403, Springer-Verlag (1990) 232\u2013243"},{"key":"8_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Proc. of Crypto\u201992","author":"T. Okamoto","year":"1993","unstructured":"Okamoto, T.: Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. Proc. of Crypto\u201992, LNCS 740, Springer-Verlag, (1993) 31\u201353"},{"key":"8_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-57568-5_268","volume-title":"Proc. of ISAAC\u201993","author":"T. Okamoto","year":"1993","unstructured":"Okamoto, T.: On the Relationship among Cryptographic Physical Assumptions. Proc. of ISAAC\u201993, LNCS 762, Springer-Verlag, (1993) 369\u2013378"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-Way Functions are Necessary and Sufficient for Secure Signature. Proc. of STOC (1990) 387\u2013394","DOI":"10.1145\/100216.100269"},{"issue":"3","key":"8_CR27","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"Schnorr, C. P.: Efficient Signature Generation by Smart Cards. J. of Cryptology, 4,3 (1991) 161\u2013174","journal-title":"J. of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:19Z","timestamp":1605647779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_8","relation":{},"subject":[]}}