New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
From MaRDI portal
Publication:1750339
DOI10.1016/J.INS.2015.07.011zbMath1391.94786OpenAlexW916194494WikidataQ121774341 ScholiaQ121774341MaRDI QIDQ1750339
Publication date: 18 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.07.011
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tapestry of identity-based encryption: practical frameworks compared
- Generic constructions of identity-based and certificateless kEMs
- Fully secure hidden vector encryption under standard assumptions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Identity-Based Cryptosystems and Signature Schemes
- Number-theoretic constructions of efficient pseudo-random functions
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Practical Identity-Based Encryption Without Random Oracles
- Identity Based Encryption Without Redundancy
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Hierarchical ID-Based Cryptography
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Secure integration of asymmetric and symmetric encryption schemes
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- The Twin Diffie-Hellman Problem and Applications
- Efficient Identity-Based Encryption with Tight Security Reduction
- Automata, Languages and Programming
- Generic Transforms to Acquire CCA-Security for Identity Based Encryption: The Cases of FOpkc and REACT
- Cryptography and Coding
This page was built for publication: New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
