Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On the Existence of 3-Round Zero-Knowledge Protocols
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
User's Guide To Cryptography And Standards (Artech House Computer Security)
User's Guide To Cryptography And Standards (Artech House Computer Security)
HMQV: a high-performance secure diffie-hellman protocol
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Deniable authentication and key exchange
Proceedings of the 13th ACM conference on Computer and communications security
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Deniable Authentication on the Internet
Information Security and Cryptology
Relationship between Two Approaches for Defining the Standard Model PA-ness
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Extractable Perfectly One-Way Functions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
An Efficient Deniable Key Exchange Protocol (Extended Abstract)
Financial Cryptography and Data Security
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
Relationship between Standard Model Plaintext Awareness and Message Hiding
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Towards a Theory of Extractable Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
WSEAS Transactions on Information Science and Applications
A brief history of provably-secure public-key encryption
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Relations among notions of plaintext awareness
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Deniable internet key exchange
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
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
Remote data checking using provable data possession
ACM Transactions on Information and System Security (TISSEC)
Encryption simulatability reconsidered
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Plaintext-Awareness of hybrid encryption
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Secure two-party computation with low communication
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Verified security of redundancy-free encryption from Rabin and RSA
Proceedings of the 2012 ACM conference on Computer and communications security
Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
OAKE: a new family of implicitly authenticated diffie-hellman protocols
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
TerraCheck: verification of dedicated cloud storage
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
Black-box construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.00 |
In this paper we examine the notion of plaintext awareness as it applies to hybrid encryption schemes. We apply this theory to the Cramer-Shoup hybrid scheme acting on fixed length messages and deduce that the Cramer-Shoup scheme is plaintext-aware in the standard model. This answers a previously open conjecture of Bellare and Palacio on the existence of fully plaintext-aware encryption schemes.