Trapdoors for Ideal Lattices with Applications
From MaRDI portal
Publication:3454588
DOI10.1007/978-3-319-16745-9_14zbMath1400.94161OpenAlexW325313041MaRDI QIDQ3454588
Russell W. F. Lai, Henry K. F. Cheung, Sherman S. M. Chow
Publication date: 25 November 2015
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16745-9_14
Related Items (1)
Cites Work
- Unnamed Item
- Generating shorter bases for hard random lattices
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Homomorphic Signatures for Polynomial Functions
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Removing Escrow from Identity-Based Encryption
- Efficient Public Key Encryption Based on Ideal Lattices
- Identity-Based Encryption from the Weil Pairing
- Candidate Multilinear Maps from Ideal Lattices
- A Toolkit for Ring-LWE Cryptography
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Trapdoors for Ideal Lattices with Applications
