Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose two new chosen-ciphertext (CCA) secure schemes from the computational Diffie-Hellman (CDH) and bilinear computational Diffie-Hellman (BCDH) assumptions. Our first scheme from the CDH assumption is constructed by extending Cash-Kiltz-Shoup scheme. This scheme yields the same ciphertext as that of Hanaoka-Kurosawa scheme (and thus Cramer-Shoup scheme) with cheaper computational cost for encryption. However, key size is still the same as that of Hanaoka-Kurosawa scheme. Our second scheme from the BCDH assumption is constructed by extending Boyen-Mei-Waters scheme. Though this scheme requires a stronger underlying assumption than the CDH assumption, it yields significantly shorter key size for both public and secret keys. Furthermore, ciphertext length of our second scheme is the same as that of the original Boyen-Mei-Waters scheme.
- 2010-11-01
著者
-
Kunihiro Noboru
The University Of Electro-communications
-
Kawai Yutaka
The University Of Tokyo
-
Hanaoka Goichiro
National Inst. Of Advanced Industrial Sci. And Technol. Tokyo Jpn
-
Hanaoka Goichiro
National Institute Of Advanced Industrial Science And Technology (aist)
-
YAMADA Shota
The University of Tokyo
関連論文
- Traitor Tracing Scheme Secure against Adaptive Key Exposure and its Application to Anywhere TV Service(Discrete Mathematics and Its Applications)
- New Conditions for Secure Knapsack Schemes against Lattice Attack
- The MAC-based Construction of Strong Multiple Encryption
- Practical Password Recovery Attacks on MD4 Based Prefix and Hybrid Authentication Protocols
- A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search
- CCA-Secure Public Key Encryption without Group-Dependent Hash Functions
- Formal Security Treatments for IBE-to-Signature Transformation : Relations among Security Notions
- Key-Insulated Public Key Encryption with Auxiliary Helper Key : Model, Constructions and Formal Security Proofs(Information Theory and Its Applications)
- Efficient Identity-Based Encryption with Tight Security Reduction(Information Theory and Its Applications)
- A New Key-Insulated Public Key Encryption Scheme with Auxiliary Helper Key
- Small Secret Key Attack on a Takagi's Variant of RSA
- Provably Secure Untraceable Electronic Cash against Insider Attacks(Discrete Mathematics and Its Applications)
- Efficient Provider Authentication for Bidirectional Broadcasting Service
- A Trade-off Traitor Tracing Scheme
- Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency
- Between Hashed DH and Computational DH : Compact Encryption from Weaker Assumption
- Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
- How to Break COT-Based Fingerprinting Schemes and Design New One(Cryptography and Information Security, Information Theory and Its Applications)
- Secure Broadcast System with Simultaneous Individual Messaging
- How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model
- On the Hardness of Subset Sum Problem from Different Intervals
- Proxiable Designated Verifier Signature
- Methods for Restricting Message Space in Public-Key Encryption