Designated confirmer signatures and public-key encryption are equivalent

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 839 LNCS, Issue , 1994, Pages 61-74

  Okamoto, Tatsuaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

DESIGNATED CONFIRMER SIGNATURES; IMPROVE-A; PUBLIC-KEY ENCRYPTION; PUBLIC-KEY ENCRYPTION SCHEME; UNDENIABLE SIGNATURE;

AUTHENTICATION;

EID: 84979016283     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_8     Document Type: Conference Paper

References (27)

1. Brassard, G., Chaum, D., and Crépeau, C.: Minimum Disclosure Proofs of Knowledge. J. Computer and System Sciences, 37 (1988) 156–189
2. Boyar, J., Chaum, D., Damgård, I., Pedersen, T.: Convertible Undeniable Signatures. Proc. of Crypto’90, LNCS 537, Springer-Verlag, (1991) 189–205
3. Chaum, D.: Zero-Knowledge Undeniable Signatures. Proc. of Eurocrypto’90, LNCS 473, Springer-Verlag, (1991) 458–464
4. Chaum, D.: Designated Confirmer Signatures. Proc. of Eurocrypt’ 94, LNCS, Springer-Verlag (to appear)
5. Chaum, D., van Antwerpen, H.: Undeniable Signatures. Proc. of Crypto’89, LNCS 435, Springer-Verlag, (1990) 212–216
6. Diffie, W., Hellman, M. E.: New Directions in Cryptography. IEEE Trans. Information Theory, 22,6, (1976) 644–654
7. ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Information Theory, 31,4, (1985) 460–472
8. Feige, U., Fiat, A., Shamir, A.: Zero-Knowledge Proofs of Identity. J. of Cryptology, 1,2 (1988) 77–94
9. Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. J. of ACM, 33,4 (1984) 792–807
10. Goldreich, O., Levin, L.: A Hard-Core Predicate for any One-way Function. Proc. of STOC’89 (1989) 25–32
11. Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Computer and System Sciences, 28,2 (1984) 270–299
12. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., 18,1 (1989) 186–208
13. Goldwasser, S., Micali, S., Rivest, R.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput., 17,2 (1988) 281–308
14. Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design. Proc. FOCS (1986) 174–187
15. Guillou, L. C., Quisquater, J.J.: A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. Proc. of Eurocrypt’88, LNCS 330, Springer-Verlag (1988) 123–128
16. Håstad, J.: Pseudo-Random Generators under Uniform Assumptions. Proc. of STOC (1990) 395–404
17. Impagliazzo, R., Levin, L., Luby, L.: Pseudo-Random Number Generation from One-Way Functions. Proc. of STOC (1989) 12–24
18. Impagliazzo, R., Rudich, S.: Limits on the Provable Consequence of One-Way Permutations. Proc. of STOC (1989) 44–61
19. Impagliazzo, R., Yung, M.: Direct Minimum-Knowledge Computations. Proc. of Crypto’87, LNCS 293, Springer-Verlag (1988) 40–51
20. Micali, S., Rackoff, C., Sloan, B.: The Notion of Security of Probabilistic Cryptosystems. SIAM J. Comput., 17,2 (1988) 412–426
21. Naor, M.: Bit Commitment Using Pseudo-Randomness. Proc. of Crypto’89, LNCS 435, Springer-Verlag, (1990) 128–136
22. Naor, M., Yung, M.: Universal One-Way Hash Functions and Their Cryptographic Applications. Proc. of STOC (1989) 33–43
23. Ohta, K., Okamoto, T.: A Modification of the Fiat-Shamir Scheme. Proc. of Crypto’88, LNCS 403, Springer-Verlag (1990) 232–243
24. Okamoto, T.: Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. Proc. of Crypto’92, LNCS 740, Springer-Verlag, (1993) 31–53
25. Okamoto, T.: On the Relationship among Cryptographic Physical Assumptions. Proc. of ISAAC’93, LNCS 762, Springer-Verlag, (1993) 369–378
26. Rompel, J.: One-Way Functions are Necessary and Sufficient for Secure Signature. Proc. of STOC (1990) 387–394
27. Schnorr, C. P.: Efficient Signature Generation by Smart Cards. J. of Cryptology, 4,3 (1991) 161–174