Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th 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
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
Chosen-Ciphertext Security from Identity-Based Encryption
SIAM Journal on Computing
A knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
A Forward-Secure Public-Key Encryption Scheme
Journal of Cryptology
Certificateless threshold cryptosystem secure against chosen-ciphertext attack
Information Sciences: an International Journal
Convertible multi-authenticated encryption scheme
Information Sciences: an International Journal
Improved certificate-based encryption in the standard model
Journal of Systems and Software
Tweaking TBE/IBE to PKE Transforms with Chameleon Hash Functions
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Improved efficiency for CCA-secure cryptosystems built using identity-based encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Public-Key encryption from ID-Based encryption without one-time signature
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Chosen ciphertext security from identity-based encryption without strong condition
IWSEC'06 Proceedings of the 1st international conference on Security
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
An efficient probabilistic public-key cryptosystem over quadratic fields quotients
Finite Fields and Their Applications
Certificateless signcryption scheme in the standard model
Information Sciences: an International Journal
A chaos-based symmetric image encryption scheme using a bit-level permutation
Information Sciences: an International Journal
An efficient incomparable public key encryption scheme
Information Sciences: an International Journal
| Hi-index | 0.08 |
Since the first practical and secure public-key encryption scheme without random oracles proposed by Cramer and Shoup in 1998, Cramer-Shoup's scheme and its variants remained the only practical and secure public-key encryption scheme without random oracles until 2004. In 2004, Canetti et al. proposed a generic transformation from a selective identity-based encryption scheme to a public-key encryption by adding a one-time strongly signature scheme. Since then, some transformation techniques from a selective identity-based encryption scheme to a public-key encryption have been proposed to enhance the computational efficiency, for example, Boneh-Katz's construction and Boyen-Mei-Waters' scheme. These transformations have either traded-off the publicly verifiable properties or tightness of security reduction. In 2007, Zhang proposed another generic transformation by adding Chameleon hash functions. In this paper, we introduce another technique from the Boneh-Boyen's selective identity-based encryption scheme to a public-key encryption which is publicly verifiable and is slightly more efficient than Zhang's transformation. The proposed public-key encryption scheme is based on the decisional bilinear Diffie-Hellman assumption and the target collision resistant hash functions.