Lattice-based key exchange on small integer solution problem
From MaRDI portal
Publication:1616180
DOI10.1007/s11432-014-5147-zzbMath1398.94176OpenAlexW2254502705MaRDI QIDQ1616180
Di Ma, Yan Zhu, Rong Quan Feng, Shan-Biao Wang
Publication date: 1 November 2018
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-014-5147-z
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Paillier's trapdoor function hides \(\Theta(n)\) bits
- (Leveled) fully homomorphic encryption without bootstrapping
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Sieve algorithms for the shortest vector problem are practical
- On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
- On Quadratic Bent Functions in Polynomial Forms
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- A Framework for Efficient and Composable Oblivious Transfer
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Lattice-based Cryptography
- A New Hard-Core Predicate of Paillier’s Trapdoor Function
- New directions in cryptography
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On the Dual of Certain Ternary Weakly Regular Bent Functions
- A Three-Valued Walsh Transform From Decimations of Helleseth–Gong Sequences
- New Sets of Zero or Low Correlation Zone Sequences via Interleaving Techniques
- Advances in Cryptology - CRYPTO 2003
- New lattice-based cryptographic constructions
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Lattice-based key exchange on small integer solution problem
