Lattice-Based Cryptography

By Oded Regev. Annual International Cryptology Conference, 2006

367 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/963d020411eea557c36be47f9002b887e6b3ed28

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 Computer Vision and Pattern Recognition

Citations in the corpus

Efficient Public Key Encryption Based on Ideal Lattices (2009, methodology): “, [23]), it is impractical to rely on the worst-case hardness of SVP.”
Compact Ring-LWE Cryptoprocessor (2014, background): “Lattice-based cryptography is considered a prime candidate for quantum-secure public key cryptography due to its wide applicability [27] and its security proofs that are based on worst-case hardness of well known lattice problems.”
An Efficient and Parallel Gaussian Sampler for Lattices (2010, background): “Based on current estimates of the concrete security for random cryptographic lattices [GN08, MR09 ], we believe that our new algorithm can offer a significant net gain in efficiency for comparable levels of security, especially when exploiting parallelism.”
Faster Fully Homomorphic Encryption (2010, neutral): “, [21] for a recent survey).”
Worst-case to average-case reductions for module lattices (2014, methodology): “One of the classical ways for solving LWE consists in solving an associated SIS instance [25].”
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme (2013, result): “The standard deviation of the error distribution is fixed at σerr = 8; this is consistent with [18].”
BKZ 2.0: Better Lattice Security Estimates (2011, background): “the Hermite factor dictates the performances at solving lattice problems relevant to cryptography: see [9] for approx-SVP and unique-SVP, and [28,39,23] for SIS and LWE.”
ALITHEIA: Towards Practical Verifiable Graph Processing (2014, background): “The second constraint guarantees a level of security that is at least 100 bits [26].”
New Algorithms for Learning in Presence of Errors (2011, background): “[4]; see Micciancio and Regev [15] for a survey).”
Simple Encrypted Arithmetic Library-SEAL (2017, background): “To label the other attacks we follow the notation of [7]: ‘bkw’ denotes a variant [23] of the BKW attack [10, 5], ‘sis’ denotes a distinguishing attack as described in [32]; ‘dec’ denotes a decoding attack as described in e.”
Charm: a framework for rapidly prototyping cryptosystems (2013, background): “mention lattices in this paper, but defer to Regev’s work [67] for an in-depth introduction.”