Relations among notions of plaintext awareness

Authors:
James Birkett;Alexander W. Dent
Affiliations:
Information Security Group, Royal Holloway, University of London, Egham, UK;Information Security Group, Royal Holloway, University of London, Egham, UK
Venue:
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Year:
2008

Citing 7
Cited 6

Pseudo-random generation from one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A computational introduction to number theory and algebra

A computational introduction to number theory and algebra
Deniable authentication and key exchange

Proceedings of the 13th ACM conference on Computer and communications security
New classes and applications of hash functions

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Relationship between standard model plaintext awareness and message hiding

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
The cramer-shoup encryption scheme is plaintext aware in the standard model

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Relationship between Two Approaches for Defining the Standard Model PA-ness

ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption

SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
A brief history of provably-secure public-key encryption

AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Strong knowledge extractors for public-key encryption schemes

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
PA1 and IND-CCA2 do not guarantee PA2: brief examples

IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Verified security of redundancy-free encryption from Rabin and RSA

Proceedings of the 2012 ACM conference on Computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new simplified notion of plaintext awareness, which we term PA2I, and show that this is equivalent to the standard definition of PA2 plaintext awareness for encryption schemes that satisfy certain weak security and randomness requirements. We also show that PA2 plaintext awareness is equivalent to PA2+ plaintext awareness under similar security and randomness requirements. This proves a conjecture of Dent that, for suitably random public-key encryption schemes, PA2 plaintext awareness implies PA1+ plaintext awareness.