Cryptoanalysis of the Immunized LL Public Key Systems
Yair Frankel,Moti Yung +1 more
- pp 287-296
Reads0
Chats0
TLDR
This paper demonstrates that the RSA based scheme is insecure under an adaptive chosen ciphertext attack, and point weaknesses in the design of both their RSA and EI Gamal based schemes regarding the use of pseudorandom-generators.Abstract:
In CRYPTO '93 Lim and Lee provided a valuable investigation of public key encryption systems secure against adaptive chosen ciphertext attacks. In this paper we identify several insecurities of both their RSA and El Gamal based schemes. We first demonstrate that the RSA based scheme is insecure under an adaptive chosen ciphertext attack. We also point weaknesses in the design of both their RSA and EI Gamal based schemes regarding the use of pseudorandom-generators, and in particular show that their choice of pseudorandom-generators for the RSA based scheme may be insecure even with respect to a known ciphertext only attack.They further claim that their schemes are particularly useful in the context of group-oriented cryptosystems due to the unique verification method used. (In fact their scheme is the only group-oriented practical encryption claimed to be secure against chosen ciphertext attacks). Group oriented cryptosystems distribute the decryption process amongst a multiple of individuals in order to provide a mechanism in which no single person is trusted. We further demonstrate that both their schemes are completely insecure in this setting.read more
Citations
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Book ChapterDOI
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
Ronald Cramer,Victor Shoup +1 more
TL;DR: In this paper, a new public key cryptosystem is proposed and analyzed, which is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. But the scheme is quite practical, and is not provable to be used in practice.
Journal Article
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Ronald Cramer,Victor Shoup +1 more
TL;DR: In this article, a new public key cryptosystem is proposed and analyzed, which is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. But the scheme is quite practical, and is not provable to be used in practice.
Posted Content
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack.
Ronald Cramer,Victor Shoup +1 more
TL;DR: A new public-key encryption scheme, along with several variants, is proposed and analyzed that appear to be the first public- key encryption schemes in the literature that are simultaneously practical and provably secure.
Journal Article
Secure integration of asymmetric and symmetric encryption schemes
TL;DR: This conversion is the first generic transformation from an arbitrary one-way asymmetricryption scheme to a chosen-ciphertext secure asymmetric encryption scheme in the random oracle model.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
A public key cryptosystem and a signature scheme based on discrete logarithms
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Book
Introduction to analytic number theory
TL;DR: The Mathematics 160 course at the California Institute of Technology as discussed by the authors was the first volume of a two-volume textbook which evolved from a course (Mathematics 160) offered at the University of California during the last 25 years.
Related Papers (5)
Public-key cryptosystems provably secure against chosen ciphertext attacks
Moni Naor,Moti Yung +1 more
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Charles Rackoff,Daniel R. Simon +1 more