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 …

Indistinguishability obfuscation from well-founded assumptions

A Jain, H Lin, A Sahai - Proceedings of the 53rd Annual ACM SIGACT …, 2021 - dl.acm.org
Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

Survey on cyberspace security

H Zhang, W Han, X Lai, D Lin, J Ma, JH Li - Science China Information …, 2015 - Springer
Along with the rapid development and wide application of information technology, human
society has entered the information era. In this era, people live and work in cyberspace …

Fully secure functional encryption for inner products, from standard assumptions

S Agrawal, B Libert, D Stehlé - Annual International Cryptology …, 2016 - Springer
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 …

[图书][B] Protocols for authentication and key establishment

C Boyd, A Mathuria, D Stebila - 2003 - Springer
The first edition of this book was published in 2003. Inevitably, certain parts of the book
became outdated quickly. At the same time new developments have continued apace …

Candidate obfuscation via oblivious LWE sampling

H Wee, D Wichs - Annual International Conference on the Theory and …, 2021 - Springer
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 …

Predicate encryption for circuits from LWE

S Gorbunov, V Vaikuntanathan, H Wee - Annual Cryptology Conference, 2015 - Springer
In predicate encryption, a ciphertext is associated with descriptive attribute values x in
addition to a plaintext μ μ, and a secret key is associated with a predicate f. Decryption …

Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation

D Boneh, M Zhandry - Algorithmica, 2017 - Springer
In this work, we show how to use indistinguishability obfuscation to build multiparty key
exchange, efficient broadcast encryption, and efficient traitor tracing. Our schemes enjoy …

Indistinguishability obfuscation from compact functional encryption

P Ananth, A Jain - Annual Cryptology Conference, 2015 - Springer
The arrival of indistinguishability obfuscation (i O i O) has transformed the cryptographic
landscape by enabling several security goals that were previously beyond our reach …

Graph-induced multilinear maps from lattices

C Gentry, S Gorbunov, S Halevi - Theory of Cryptography: 12th Theory of …, 2015 - Springer
Graded multilinear encodings have found extensive applications in cryptography ranging
from non-interactive key exchange protocols, to broadcast and attribute-based encryption …