Paper Info
Title
Generic and Practical Key Establishment from Lattice.
Abstract
In this work, we abstract some key ingredients in previous key establishment and public-key encryption schemes from LWE and its variants. Specifically, we explicitly formalize the building tool, referred to as key consensus (KC) and its asymmetric variant AKC. KC and AKC allow two communicating parties to reach consensus from close values, which plays the fundamental role in lattice-based cryptography. We then prove the upper bounds on parameters for any KC and AKC, which reveal the inherent constraints on the parameters among security, bandwidth, error probability, and consensus range. As a conceptual contribution, this simplifies the design and analysis of these cryptosystems in the future. Guided by the proved upper bounds, we design and analyze both generic and highly practical KC and AKC schemes, which are referred to as OKCN and AKCN respectively for presentation simplicity. We present a generic protocol structure for key establishment from learning with rounding (LWR), which can be instantiated with either KC or AKC. We then provide an analysis breaking the correlation between the rounded deterministic noise and the secret, and design an algorithm to calculate the error probability numerically. When applied to LWEbased key establishment, OKCN and AKCN can result in more practical or well-balanced schemes, compared to existing LWE-based protocols in the literature.
Year
DOI
Venue
2019
10.1007/978-3-030-21568-2_15
Lecture Notes in Computer Science
Field
DocType
Volume
Deterministic noise,Lattice (order),Computer science,Cryptography,Theoretical computer science,Cryptosystem,Encryption,Rounding,Bandwidth (signal processing),Key establishment
Conference
11464
ISSN
Citations 
PageRank 
0302-9743
1
0.36
References 
Authors
0
2
Name
Order
Citations
PageRank
Zhengzhong Jin143.78
Yunlei Zhao229829.79