Towards practical public key systems secure against chosen ciphertext attacks

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

Volumn 576 LNCS, Issue , 1992, Pages 445-456

  Damgård, Ivan ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; CRYPTOGRAPHIC ASSUMPTIONS; EFFICIENT CONSTRUCTION; IDENTIFICATION SCHEME; PASSIVE ATTACKS; PUBLIC KEY SYSTEMS;

CRYPTOGRAPHY;

EID: 85029541173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46766-1_36     Document Type: Conference Paper

References (9)

1. M. Blum and S. Goldwasser: An Efficient Probabilistic Public-Key Encryption Scheme which Hides all Partial Information, Proc. of Crypto 84, Springer Verlag.
2. B. den Boer: Diffie-Hellman is as Strong as Discrete Log for Certain Primes, Proc. of Crypto 84, Springer Verlag.
3. T. El Gamal: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. on Inf. Theory, vol.IT-31, 1985.
4. U. Feige, A. Fiat and A. Shamir: Zero-Knowledge Proofs of Identity, J.Crypt, vol. 1, 1988, Springer Verlag.
5. O. Goldreich and H. Krawczyk: On the Composition of Zero-Knowledge Proof Systems, Proc. of ICALP 90.
6. S. Goldwasser, S. Micali and R. Rivest: A “Paradoxical” Solution to the Signature Problem, proc. of FOCS 84.
7. M. Naor and M. Yung: Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks, Proc. of FOCS 90.
8. M.O. Rabin: Digital Signatures and Public Key Encryption as Intractable as Factorization, Tech. report, MIT/LCS/TR-212. M.I.T., 1978.
9. C. Rackoff and D. Simon: Non-Interactive Zero-Knowledge Proofs of Knowledge and Chosen Ciphertext Attacks, these proceedings.