Between Hashed DH and Computational DH : Compact Encryption from Weaker Assumption
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we introduce the intermediate hashed Diffie-Hellman (IHDH) assumption which is weaker than the hashed DH (HDH) assumption (and thus the decisional DH assumption), and is stronger than the computational DH assumption. We then present two public key encryption schemes with short ciphertexts which are both chosen-ciphertext secure under this assumption. The short-message scheme has smaller size of ciphertexts than Kurosawa-Desmedt (KD) scheme, and the long-message scheme is a KD-size scheme (with arbitrary plaintext length) which is based on a weaker assumption than the HDH assumption.
- （社）電子情報通信学会の論文
- 2010-11-01
著者
-
Kurosawa Kaoru
Ibaraki Univ. Hitachi‐shi Jpn
-
Hanaoka Goichiro
National Inst. Of Advanced Industrial Sci. And Technol. Tokyo Jpn
関連論文
- Traitor Tracing Scheme Secure against Adaptive Key Exposure and its Application to Anywhere TV Service(Discrete Mathematics and Its Applications)
- The MAC-based Construction of Strong Multiple Encryption
- Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Tag-KEM from Set Partial Domain One-Way Permutations
- 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
- Security of the Five-Round KASUMI Type Permutation
- 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)
- How to Construct Super-Pseudorandom Permutations with Short Keys(Symmetric Cryptography,Cryptography and Information Security)
- An Electronic Voting Protocol Preserving Voter's Privacy(Applications of Information Security Techniques)
- Secure Broadcast System with Simultaneous Individual Messaging
- How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model
- Undeniable and Unpretendable Signatures
- Methods for Restricting Message Space in Public-Key Encryption