Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
From MaRDI portal
Publication:2215969
DOI10.1016/j.tcs.2020.10.010zbMath1467.94041OpenAlexW3093377501WikidataQ123000320 ScholiaQ123000320MaRDI QIDQ2215969
Atsushi Takayasu, Yodai Watanabe
Publication date: 15 December 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.010
anonymitylattice-based cryptographydual system encryptionrevocable identity-based encryptionkey exposure resistance
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Efficient selective identity-based encryption without random oracles
- Revocable hierarchical identity-based encryption via history-free approach
- Families of finite sets in which no set is covered by the union of \(r\) others
- Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Revocable identity-based encryption from the computational Diffie-Hellman problem
- Adaptive-ID secure revocable hierarchical identity-based encryption
- Server-aided revocable identity-based encryption from lattices
- Bonsai trees, or how to delegate a lattice basis
- Revocable identity-based encryption from codes with rank metric
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- Efficient revocable identity-based encryption via subset difference methods
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Bounded-Collusion IBE from Key Homomorphism
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
- Revocable Identity-Based Encryption from Lattices
- Efficient (Anonymous) Compact HIBE from Standard Assumptions
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Identity-Based Cryptosystems and Signature Schemes
- New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Constructions of CCA-Secure Revocable Identity-Based Encryption
- Simplified Revocable Hierarchical Identity-Based Encryption from Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Efficient Lattice (H)IBE in the Standard Model
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Identity-Based Encryption from the Weil Pairing
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Identity-Based Encryption Without Random Oracles
- Fuzzy Identity-Based Encryption
- Classical hardness of learning with errors
- An Introduction to Computational Physics
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- On lattices, learning with errors, random linear codes, and cryptography
- Topics in Cryptology – CT-RSA 2004
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
This page was built for publication: Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
