A decade of lattice cryptography
C Peikert - Foundations and trends® in theoretical computer …, 2016 - nowpublishers.com
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …
Indistinguishability obfuscation from well-founded assumptions
Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …
programs into unintelligible ones while preserving functionality. It is a fascinating and …
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable
A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a
short proof that certifies the veracity of a certain NP-statement. In the last decade, a large …
short proof that certifies the veracity of a certain NP-statement. In the last decade, a large …
Fully secure functional encryption for inner products, from standard assumptions
Functional encryption is a modern public-key paradigm where a master secret key can be
used to derive sub-keys SK_F associated with certain functions F in such a way that the …
used to derive sub-keys SK_F associated with certain functions F in such a way that the …
Candidate obfuscation via oblivious LWE sampling
We present a new, simple candidate construction of indistinguishability obfuscation (iO). Our
scheme is inspired by lattices and learning-with-errors (LWE) techniques, but we are unable …
scheme is inspired by lattices and learning-with-errors (LWE) techniques, but we are unable …
Indistinguishability obfuscation from functional encryption
N Bitansky, V Vaikuntanathan - Journal of the ACM (JACM), 2018 - dl.acm.org
Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to
almost any known cryptographic object. Prior candidate IO constructions were based on …
almost any known cryptographic object. Prior candidate IO constructions were based on …
Function-hiding inner product encryption is practical
In a functional encryption scheme, secret keys are associated with functions and ciphertexts
are associated with messages. Given a secret key for a function f, and a ciphertext for a …
are associated with messages. Given a secret key for a function f, and a ciphertext for a …
Obfuscating compute-and-compare programs under LWE
D Wichs, G Zirdelis - 2017 IEEE 58th Annual Symposium on …, 2017 - ieeexplore.ieee.org
We show how to obfuscate a large and expressive class of programs, which we call compute-
and-compare programs, under the learning-with-errors (LWE) assumption. Each such …
and-compare programs, under the learning-with-errors (LWE) assumption. Each such …
Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions
A recent line of works–initiated by Gordon, Katz and Vaikuntanathan (Asiacrypt 2010)–gave
lattice-based constructions allowing users to authenticate while remaining hidden in a …
lattice-based constructions allowing users to authenticate while remaining hidden in a …
Functional commitments for all functions, with transparent setup and from SIS
L de Castro, C Peikert - Annual International Conference on the Theory …, 2023 - Springer
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 …
specified family, then later concisely and verifiably reveal values of the function at desired …