Lattice Signatures Without Trapdoors

By Vadim Lyubashevsky. IACR Cryptology ePrint Archive, 2012

892 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/4da4823134a6a4136cda4d01ace45d3e64485796

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Discrete Gaussian Leftover Hash Lemma over Infinite Domains (2013, background): “Related questions were considered by Lyubashevsky [Lyu12] where he computes the expectation of the inner product of discrete Gaussians.”
A Toolkit for Ring-LWE Cryptography (2013, background): “, [25, 24, 21, 14, 15, 26, 33, 9, 8, 17, 18, 22, 5, 28, 20, 16]), often to the exclusion of all other rings.”
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography (2016, methodology): “R-LWE-based schemes have been proposed for public-key encryption [35, 24, 28], digital signatures [22, 12], and key exchange [11, 28, 36, 6, 2].”
On Ideal Lattices and Learning with Errors over Rings (2010, methodology): “The SIS problem has been the foundation for one-way [Ajt96] and collision-resistant hash functions [GGH96], identiﬁcation schemes [MV03, Lyu08, KTX08], and digital signatures [GPV08, CHKP10, Boy10, MP12, Lyu12].”
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (2012, background): “In a concurrent and independent work, Lyubashevsky [27] constructs a signature scheme in the random oracle model “without (strong) trapdoors,” i.”
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018, methodology): “The proof that our signature scheme is zero-knowledge is fairly standard and follows the framework from [Lyu09, Lyu12, BG14].”
Classical hardness of learning with errors (2013, background): “The SIS problem has been the foundation for oneway [3] and collision-resistant hash functions [19], identification schemes [35, 27, 22], and digital signatures [18, 15, 11, 33, 28].”
Lattice Signatures and Bimodal Gaussians (2013, methodology): “In particular, it is no longer clear how to perform key generation, and also the outline for the security proof from [24] no longer holds.”
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems (2012, methodology): “In [20], Lyubashevsky constructed a lattice-based signature scheme based on the hardness of the Ring-SIS problem, and this scheme was later improved in two ways [21].”
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes (2016, background): “In addition to encryption/signature schemes ([15, 25, 18, 7, 21, 22]), identity-based encryption [8], multilinear maps [10, 16], lattices are also involved in homomorphic encryption (HE).”
Post-quantum Key Exchange - A New Hope (2016, methodology): “We recall that the use of discrete Gaussians (or other distributions with very high-precision sampling) is only crucial for signatures [60] and lattice trapdoors [39], to provide zero-knowledgeness.”
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, methodology): “More efficient approaches [7, 9, 65, 66] rely on the FS transform instead of FDH. BLISS [36], a very practical scheme, also relies on the FS transform, but buys efficiency at the cost of more pragmatic assumptions, i.e., a ring version of the SIS problem.”
Software Speed Records for Lattice-Based Signatures (2013, methodology): “For more detailed information as well as security proofs, please refer to [14, 17].”
Post-quantum cryptography (2008, neutral): “The most promising signature systems are based on Lyubashevsky’s signature system [40] from 2012.”