Identity-based encryption with security against the KGC: a formal model and its instantiations
From MaRDI portal
Publication:2062134
DOI10.1016/j.tcs.2021.11.021OpenAlexW3004153294WikidataQ115036456 ScholiaQ115036456MaRDI QIDQ2062134
Keita Emura, Shuichi Katsumata, Yodai Watanabe
Publication date: 22 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.021
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Registration-based encryption: removing private-key generator from IBE
- Verifiable registration-based encryption
- Identity-based encryption with security against the KGC: a formal model and its instantiation from lattices
- Registration-based encryption from standard assumptions
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Identity-Based Cryptosystems and Signature Schemes
- Lattice-Based Blind Signatures
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- An Efficient and Parallel Gaussian Sampler for Lattices
- Practical Identity-Based Encryption Without Random Oracles
- Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
- Removing Escrow from Identity-Based Encryption
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Public-key cryptosystems from the worst-case shortest vector problem
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Classical hardness of learning with errors
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- New Anonymity Notions for Identity-Based Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Advances in Cryptology - ASIACRYPT 2003
- Tighter security proofs for GPV-IBE in the quantum random oracle model
This page was built for publication: Identity-based encryption with security against the KGC: a formal model and its instantiations
