Efficient revocable identity-based encryption with short public parameters
From MaRDI portal
Publication:2658050
DOI10.1016/J.TCS.2021.02.024zbMATH Open1501.94040OpenAlexW3130473008WikidataQ122941820 ScholiaQ122941820MaRDI QIDQ2658050FDOQ2658050
Authors: Keita Emura, Jae Hong Seo, Yodai Watanabe 
Publication date: 18 March 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.024
Recommendations
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- Constructions of CCA-Secure Revocable Identity-Based Encryption
- Revocable identity-based encryption revisited: security model and construction
- CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
- Efficient revocable identity-based encryption via subset difference methods
revocable identity-based encryptionasymmetric pairingsstatic assumptionsdecryption key exposure resistance
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Efficient revocable identity-based encryption via subset difference methods
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- 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
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient delegation of key generation and revocation functionalities in identity-based encryption
- Revocable identity-based encryption revisited: security model and construction
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Pairing-Friendly Elliptic Curves of Prime Order
- Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
- Pairings for cryptographers
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Shorter identity-based encryption via asymmetric pairings
- Title not available (Why is that?)
- Variants of Waters' dual system primitives using asymmetric pairings. (Extended abstract)
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Revocable hierarchical identity-based encryption
- Revocable hierarchical identity-based encryption: history-free update, security against insiders, and short ciphertexts
- Revocable hierarchical identity-based encryption via history-free approach
- Adaptive-ID secure revocable hierarchical identity-based encryption
- Server-aided revocable identity-based encryption from lattices
- Déjà Q: encore! Un petit IBE
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- Efficient (anonymous) compact HIBE from standard assumptions
- Simplified revocable hierarchical identity-based encryption from lattices
- Server-aided revocable identity-based encryption
- Identity-based broadcast encryption with efficient revocation
- Generic constructions of revocable identity-based encryption
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Constructions of CCA-Secure Revocable Identity-Based Encryption
- Sequential aggregate signatures with short public keys without random oracles
- Sequential aggregate signatures made shorter
- Sequential aggregate signatures with short public keys: design, analysis and implementation studies
Cited In (14)
- Title not available (Why is that?)
- CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
- Efficient delegation of key generation and revocation functionalities in identity-based encryption
- Revocable identity-based encryption revisited: security model and construction
- Generic constructions of revocable identity-based encryption
- Making the identity-based Diffie-Hellman key exchange efficiently revocable
- Shorter identity-based encryption via asymmetric pairings
- Identity-based broadcast encryption with efficient revocation
- Efficient revocable identity-based encryption via subset difference methods
- Efficient Identity-Based Outsider Anonymous Public-Key Trace and Revoke with Constant Ciphertext-Size and Fast Decryption
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- Revocable hierarchical identity-based encryption
- Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters
- A fully secure revocable ID-based encryption in the standard model
This page was built for publication: Efficient revocable identity-based encryption with short public parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2658050)
