Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

By Vadim Lyubashevsky. International Conference on the Theory and Application of Cryptology and Information Security, 2009

609 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/590e955f7f42900c121f1181c90d6526de732ba4

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

In Information Systems

Citations in the corpus

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018, methodology): “The design of the scheme is based on the “Fiat-Shamir with Aborts” approach [Lyu09] and bears most resemblance to the schemes proposed in [GLP12, BG14].”
Lattice Signatures and Bimodal Gaussians (2013, methodology): “Among known provably-secure signature schemes, [11,23], [24,27], the most efficient seems to be that of [24] whose most efficient instantiation has both signature and key size of the order of 9kb [15] for approximately 80 bits of security.”
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.”
Multiparty Computation from Somewhat Homomorphic Encryption (2012, neutral): “This is an idea from [21].”
Advances in quantum cryptography (2019, neutral): “Examples of such schemes are the Lamport [730], Merkle [731], Ring-Learning-With-Errors [732], CFS [733], etc.”
On Ideal Lattices and Learning with Errors over Rings (2010, methodology): “These results paved the way for other efficient cryptographic constructions, including identification schemes [ 19 ] and signatures [21, 19].”
Lattice Signatures Without Trapdoors (2012, methodology): “The first contribution of this current work is adapting the ringSIS based scheme from [26] to one based on the hardness of the regular SIS problem which results in signatures of the same Õ(n) length(2).”
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.”
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].”
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (2011, methodology): “In 2009, Lyubashevsky [23] introduced an e cient digital signature provably as secure as Ideal-SIS (in the random oracle model).”