Advances in Cryptology – CRYPTO 2021
41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part III
Page
%P
-
Article
Algebraically Structured LWE, Revisited
In recent years, there has been a proliferation of algebraically structured Learning With Errors (LWE) variants, including Ring-LWE, Module-LWE, Polynomial-LWE, Order-LWE, and Middle-Product LWE, and a web of red...
-
Chapter and Conference Paper
Functional Commitments for All Functions, with Transparent Setup and from SIS
A functional commitment scheme enables a user to concisely commit to a function from a specified family, then later concisely and verifiably reveal values of the function at desired inputs. Useful special cases, ...
-
Chapter and Conference Paper
Classical and Quantum Security of Elliptic Curve VRF, via Relative Indifferentiability
Verifiable random functions ( VRFs ) are essentially pseudorandom functions for which selected outputs can be proved correct and unique, without compromising the security of other outputs. VRFs have numerous app...
-
Book and Conference Proceedings
-
Book and Conference Proceedings
Advances in Cryptology – CRYPTO 2021
41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part I
-
Book and Conference Proceedings
Advances in Cryptology – CRYPTO 2021
41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part II
-
Chapter and Conference Paper
Vector and Functional Commitments from Lattices
Vector commitment (VC) schemes allow one to commit concisely to an ordered sequence of values, so that the values at desired positions can later be proved concisely. In addition, a VC can be statelessly updata...
-
Book and Conference Proceedings
Advances in Cryptology – CRYPTO 2021
41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV
-
Chapter and Conference Paper
He Gives C-Sieves on the CSIDH
Recently, Castryck, Lange, Martindale, Panny, and Renes proposed CSIDH (pronounced “sea-side”) as a candidate post-quantum “commutative group action.” It has attracted much attention and interest, in part becaus...
-
Chapter and Conference Paper
Constraining and Watermarking PRFs from Milder Assumptions
Constrained pseudorandom functions (C-PRFs) let the possessor of a secret key delegate the ability to evaluate the function on certain authorized inputs, while kee** the remaining function values pseudorandom. ...
-
Chapter and Conference Paper
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful t...
-
Chapter and Conference Paper
Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors
We finally close the long-standing problem of constructing a noninte...
-
Chapter and Conference Paper
Outsourcing Computation: The Minimal Refereed Mechanism
We consider a setting where a verifier with limited computation power delegates a resource intensive computation task—which requires a \(T\times S\) computation tableau—to two provers where the provers are ratio...
-
Chapter and Conference Paper
Algebraically Structured LWE, Revisited
In recent years, there has been a proliferation of algebraically structured Learning With Errors (LWE) variants, including Ring-LWE, Module-LWE, Polynomial-LWE, Order-LWE, and Middle-Product LWE, and a web of red...
-
Chapter and Conference Paper
New (and Old) Proof Systems for Lattice Problems
We continue the study of statistical zero-knowledge (SZK) proofs, both interactive and noninteractive, for computational problems on point lattices. We are particularly interested in the problem ...
-
Chapter and Conference Paper
Privately Constraining and Programming PRFs, the LWE Way
Constrained pseudorandom functions allow for delegating “constrained” secret keys that let one compute the function at certain authorized inputs—as specified by a constraining predicate—while kee** the...
-
Chapter and Conference Paper
More Efficient Commitments from Structured Lattice Assumptions
We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge proof of opening knowledge. Our scheme is a design imp...
-
Article
List-Decoding Barnes–Wall Lattices
The question of list-decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete linear structure of linear codes and p...
-
Chapter and Conference Paper
Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
A public-key encryption scheme is k-circular secure if a cycle of k encrypted secret keys $$(\mathsf {Enc} _{pk_{1}}(sk_{2}), ...
-
Chapter and Conference Paper
How (Not) to Instantiate Ring-LWE
The learning with errors over rings (Ring-LWE) problem—or more accurately, family of problems—has emerged as a promising foundation for cryptography due to its practical efficiency, conjectured quantum resistance...
