A key distribution “Paradox”

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

Volumn 537 LNCS, Issue , 1991, Pages 268-273

  Yacobi, Yacov ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY;

CHOSEN CIPHERTEXT ATTACK; CHOSEN MESSAGE ATTACKS; CIPHERTEXT-ONLY ATTACKS; KEY DISTRIBUTION SYSTEMS; PROBABILISTIC POLYNOMIAL TIME; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC-KEY SIGNATURES; TRAPDOOR ONE WAY FUNCTION;

PROBABILITY DISTRIBUTIONS;

EID: 0348250970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38424-3_19     Document Type: Conference Paper

References (13)

1. Ben-David, S., Chor, B., Goldreich, O., Luby, M.: “On the Theory of Average Case Complexity,” STOC, 1989, pp. 204-216.
2. Bellare, M., and Micali, S.: “How to Sign Given Any Trap-Door Function”, STOC, 1988, pp. 32-34.
3. Dolev, D., Even, S., Karp, R.: “On the Security of Ping-Pong Protocols,” Advances in Cryptology: Proc. of Crypto’82, Plenum Press, pp. 177-186, 1983.
4. Diffie, W., Heilman, M.: “New Directions In Cryptography,” IEEE Trans, on Inf. Theory, 1976, IT-22, pp. 644-654.
5. Goldwasser, S., Micali, S., Rivest, R. L.: “A Digital Signature Scheme Secure Against Chosen Message Attacks,” SIAM J. On Comput., Vol. 17, No. 2, 1988, pp. 281-308.
6. McCurley, K. S.: “A Key Distribution System Equivalent to Factoring,” J. of Cryptology, Vol. 1, No. 2, 1988, pp. 95-106.
7. Matsumoto, T., Takashima, Y., Imai, H.: “On Seeking Smart Public-Key-Distribution Systems,” The Transactions of the IECE of Japan, Vol. E69, No. 2, February 1986, pp. 99-106.
8. Naor, M., Yung, M.: “Universal One-Way Hash Functions and their Cryptographic Applications,” STOC, 1989, pp. 33-43, 1989.
9. Naor, M., Yung, M.: “Public-Key cryptosystems provably secure against chosen ciphertext attacks,” to appear.
10. Rabin, M. O.: “Digital Signature and Public Key Functions as Intractable as Factoring,” Technical Memo TM-212, Lab for Computer Science, MIT, 1979.
11. Rivest, R. L., Shamir, A., and Adelman, L.: “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Commun. ACM 1978, 21, pp. 120-126.
12. Shmuely, Z.: “Composite Diffie-Hellman Public-Key Generating Systems Are Hard to Break,” TR. No. 356, Computer Science Dept. Techniort, 11T, Feb. 1985.
13. Yacobi, Y., Shmuely, Z.: “On Key Distribution Systems,” Proc. Crypto’89.