Lattice-based key exchange on small integer solution problem
type: Item
instance of: scholarly article
title: Lattice-based key exchange on small integer solution problem
zbMATH Open document ID: 1398.94176
author: Yan Zhu
author: Di Ma
author: Shan-Biao Wang
author: Rongquan Feng
publication date: 2018-11-01T00:00:00Z
full work available at URL: s11432-014-5147-z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6969838
zbMATH Keywords: cryptography
zbMATH Keywords: lattices
zbMATH Keywords: small integer solutions
zbMATH Keywords: key exchange protocol
zbMATH Keywords: secure communications
MaRDI profile type: Publication
OpenAlex ID: W2254502705
cites work: Q4228459
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: Q4526993
cites work: New lattice-based cryptographic constructions
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Lossy trapdoor functions and their applications
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
cites work: Lattice Signatures without Trapdoors
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
cites work: Fully homomorphic encryption using ideal lattices
cites work: Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Lattice-based Cryptography
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Lattice-Based Identification Schemes Secure Under Active Attacks
cites work: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
cites work: New directions in cryptography
cites work: Q3840150
cites work: Q4341751
cites work: Q4387321
cites work: Q4542560
cites work: On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
cites work: On Quadratic Bent Functions in Polynomial Forms
cites work: Sieve algorithms for the shortest vector problem are practical
cites work: A sieve algorithm for the shortest lattice vector problem
cites work: Paillier's trapdoor function hides \(\Theta(n)\) bits
cites work: A New Hard-Core Predicate of Paillier’s Trapdoor Function
cites work: New Sets of Zero or Low Correlation Zone Sequences via Interleaving Techniques
cites work: A Three-Valued Walsh Transform From Decimations of Helleseth–Gong Sequences
cites work: On the Dual of Certain Ternary Weakly Regular Bent Functions
DOI: 10.1007/S11432-014-5147-Z
published in: Science China Information Sciences
description: scientific article; zbMATH DE number 6969838