An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
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 Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On the Security of a Modified Paillier Public-Key Primitive
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Observability Analysis - Detecting When Improved Cryptosystems Fail
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
A Public Key Cryptosystem Based on the Subgroup Membership Problem
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Practical Security in Public-Key Cryptography
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
An IND-CCA2 Public-Key Cryptosystem with Fast Decryption
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Proceedings of the 8th IMA International Conference on Cryptography and Coding
IND-CCA Public Key Schemes Equivalent to Factoring n=pq
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Formal Proofs for the Security of Signcryption
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Orthogonality between Key Privacy and Data Privacy, Revisited
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
Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
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
Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Chosen Ciphertext Secure Public Key Encryption with a Simple Structure
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
CCA-Secure Proxy Re-encryption without Pairings
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption
Information Security and Cryptology --- ICISC 2008
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
On the Impossibility of Strong Encryption Over $\aleph_0$
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Hedged Public-Key Encryption: How to Protect against Bad Randomness
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Security of sequential multiple encryption
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Identity based encryption: Progress and challenges
Information Security Tech. Report
Attribute-based authenticated key exchange
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
A generic method for reducing ciphertext length of reproducible KEMs in the RO model
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Generic construction of strongly secure timed-release public-key encryption
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
New constructions of public-key encryption schemes from conjugacy search problems
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Verifiable security of Boneh-Franklin identity-based encryption
ProvSec'11 Proceedings of the 5th international conference on Provable security
ProvSec'11 Proceedings of the 5th international conference on Provable security
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
Reducing the spread of damage of key exposures in key-insulated encryption
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Identity-Based hierarchical strongly key-insulated encryption and its application
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On achieving chosen ciphertext security with decryption errors
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Applying fujisaki-okamoto to identity-based encryption
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Identity based encryption without redundancy
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
A generic conversion with optimal redundancy
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient and non-interactive timed-release encryption
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Constant size ciphertexts in threshold attribute-based encryption
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Encoding-Free elgamal encryption without random oracles
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Parallel key-insulated public key encryption
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
On constructing certificateless cryptosystems from identity based encryption
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Automated proofs for asymmetric encryption
Concurrency, Compositionality, and Correctness
Efficient identity-based encryption with tight security reduction
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Chosen-Ciphertext secure certificateless proxy re-encryption
CMS'10 Proceedings of the 11th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
An efficient public key cryptosystem with a privacy enhanced double decryption mechanism
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
CHECKER: on-site checking in RFID-based supply chains
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
NTRUCCA: how to strengthen NTRUEncrypt to chosen-ciphertext security in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Threshold ciphertext policy attribute-based encryption with constant size ciphertexts
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Strong security notions for timed-release public-key encryption revisited
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
An efficient IND-CCA2 secure Paillier-based cryptosystem
Information Processing Letters
Verified security of redundancy-free encryption from Rabin and RSA
Proceedings of the 2012 ACM conference on Computer and communications security
Improved anonymous timed-release encryption
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
A note on an IND-CCA2 secure Paillier-based cryptosystem
Information Processing Letters
| Hi-index | 0.00 |
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure) public-key encryption scheme against adaptive chosen-ciphertext attacks (active adversaries) in the random oracle model. Since our conversion requires only one random (hash) function operation, the converted scheme is almost as efficient as the original one, when the random function is replaced by a practical hash function such as SHA-1 and MD5. We also give a concrete analysis of the reduction for proving its security, and show that our security reduction is (almost) optimally efficient. Finally this paper gives some practical examples of applying this conversion to some practical and semantically secure encryption schemes such as the ElGamal, Blum-Goldwasser and Okamoto-Uchiyama schemes[4, 7, 9].