Efficient revocable identity-based encryption with short public parameters

DOI10.1016/J.TCS.2021.02.024MaRDI QIDQ2658050zbMATH OpenOpenAlexWikidataFDO

Authors Keita Emura, Jae Hong Seo, Yodai Watanabe

Publication date 18 March 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.tcs.2021.02.024

zbMATH Keywords

revocable identity-based encryptionasymmetric pairingsstatic assumptionsdecryption key exposure resistance

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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

Cites work

• scientific article; zbMATH DE number 1942412 (Why is no real title available?)
• scientific article; zbMATH DE number 1842485 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Adaptive-ID Secure Revocable Identity-Based Encryption
• Adaptive-ID secure revocable hierarchical identity-based encryption
• Advances in Cryptology - EUROCRYPT 2004
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Constructions of CCA-Secure Revocable Identity-Based Encryption
• Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Déjà Q: encore! Un petit IBE
• Efficient (anonymous) compact HIBE from standard assumptions
• Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient delegation of key generation and revocation functionalities in identity-based encryption
• Efficient revocable identity-based encryption via subset difference methods
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Generic constructions of revocable identity-based encryption
• Identity-based broadcast encryption with efficient revocation
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
• Pairing-Friendly Elliptic Curves of Prime Order
• Pairings for cryptographers
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Practical Identity-Based Encryption Without Random Oracles
• Revocable hierarchical identity-based encryption
• Revocable hierarchical identity-based encryption via history-free approach
• Revocable hierarchical identity-based encryption with shorter private keys and update keys
• Revocable hierarchical identity-based encryption: history-free update, security against insiders, and short ciphertexts
• Revocable identity-based encryption revisited: security model and construction
• Sequential aggregate signatures made shorter
• Sequential aggregate signatures with short public keys without random oracles
• Sequential aggregate signatures with short public keys: design, analysis and implementation studies
• Server-aided revocable identity-based encryption
• Server-aided revocable identity-based encryption from lattices
• Shorter identity-based encryption via asymmetric pairings
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Simplified revocable hierarchical identity-based encryption from lattices
• Tools for simulating features of composite order bilinear groups in the prime order setting
• Variants of Waters' dual system primitives using asymmetric pairings. (Extended abstract)

Cited in

(14)

• scientific article; zbMATH DE number 1302843 (Why is no real title available?)
• 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)