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 …

[PDF][PDF] Chainlink 2.0: Next steps in the evolution of decentralized oracle networks

L Breidenbach, C Cachin, B Chan, A Coventry, S Ellis… - Chainlink Labs, 2021‏ - naorib.ir
In this whitepaper, we articulate a vision for the evolution of Chainlink beyond its initial
conception in the original Chainlink whitepaper. We foresee an increasingly expansive role …

Forward and backward private searchable encryption from constrained cryptographic primitives

R Bost, B Minaud, O Ohrimenko - … of the 2017 ACM SIGSAC Conference …, 2017‏ - dl.acm.org
Using dynamic Searchable Symmetric Encryption, a user with limited storage resources can
securely outsource a database to an untrusted server, in such a way that the database can …

Wolverine: Fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits

C Weng, K Yang, J Katz, X Wang - 2021 IEEE Symposium on …, 2021‏ - ieeexplore.ieee.org
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

New constructions for forward and backward private symmetric searchable encryption

J Ghareh Chamani, D Papadopoulos… - Proceedings of the …, 2018‏ - dl.acm.org
We study the problem of dynamic symmetric searchable encryption. In that setting, it is
crucial to minimize the information revealed to the server as a result of update operations …

Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes

G Couteau, P Rindal, S Raghuraman - Annual International Cryptology …, 2021‏ - Springer
We put forth new protocols for oblivious transfer extension and vector OLE, called Silver, for
SILent Vole and oblivious transfER. Silver offers extremely high performances: generating …

Efficient two-round OT extension and silent non-interactive secure computation

E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl… - Proceedings of the …, 2019‏ - dl.acm.org
We consider the problem of securely generating useful instances of two-party correlations,
such as many independent copies of a random oblivious transfer (OT) correlation, using a …

How to use indistinguishability obfuscation: deniable encryption, and more

A Sahai, B Waters - Proceedings of the forty-sixth annual ACM …, 2014‏ - dl.acm.org
We introduce a new technique, that we call punctured programs, to apply indistinguishability
obfuscation towards cryptographic problems. We use this technique to carry out a systematic …

Correlated pseudorandomness from expand-accumulate codes

E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl… - Annual International …, 2022‏ - Springer
A pseudorandom correlation generator (PCG) is a recent tool for securely generating useful
sources of correlated randomness, such as random oblivious transfers (OT) and vector …

Multi-input functional encryption

S Goldwasser, SD Gordon, V Goyal, A Jain… - Advances in Cryptology …, 2014‏ - Springer
We introduce the problem of Multi-Input Functional Encryption, where a secret key sk f can
correspond to an n-ary function f that takes multiple ciphertexts as input. We formulate both …