Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups
From MaRDI portal
Publication:2801775
DOI10.1007/978-3-319-29814-6_21zbMath1384.94115OpenAlexW2465816939MaRDI QIDQ2801775
Siyu Xiao, Jie Zhang, Ai-Jun Ge, Chuan-Gui Ma
Publication date: 21 April 2016
Published in: Information and Communications Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29814-6_21
Cites Work
- Unnamed Item
- A forward-secure public-key encryption scheme
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Hierarchical Predicate Encryption for Inner-Products
- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
This page was built for publication: Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups
