Shorter identity-based encryption via asymmetric pairings
From MaRDI portal
Publication:404944
DOI10.1007/s10623-013-9834-3zbMath1299.94080OpenAlexW1999078045WikidataQ123027269 ScholiaQ123027269MaRDI QIDQ404944
Hoeteck Wee, Hoon Wei Lim, San Ling, Jie Chen, Huaxiong Wang
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9834-3
Related Items (4)
Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ Efficient revocable identity-based encryption with short public parameters ⋮ Identity-based matchmaking encryption from standard assumptions ⋮ New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
Cites Work
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Short signatures from the Weil pairing
- A taxonomy of pairing-friendly elliptic curves
- Elliptic curves suitable for pairing based cryptography
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Variants of Waters’ Dual System Primitives Using Asymmetric Pairings
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- 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
- Trapdoors for hard lattices and new cryptographic constructions
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Practical Identity-Based Encryption Without Random Oracles
- Homomorphic Encryption and Signatures from Vector Decomposition
- Hierarchical Predicate Encryption for Inner-Products
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Identity-Based Encryption from the Weil Pairing
- Easy Decision Diffie-Hellman Groups
- Anonymity from Asymmetry: New Constructions for Anonymous HIBE
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Pairing-Friendly Elliptic Curves of Prime Order
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Unnamed Item
- Unnamed Item
This page was built for publication: Shorter identity-based encryption via asymmetric pairings
