Predicate Encryption for Circuits from LWE
Sergey Gorbunov,Vinod Vaikuntanathan,Hoeteck Wee +2 more
- pp 503-523
Reads0
Chats0
TLDR
In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext, and a secret key associated with a predicate f as discussed by the authors, and decryption returns plaintext if and only if f(x) = 1.Abstract:
In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext \(\mu \), and a secret key is associated with a predicate f. Decryption returns plaintext \(\mu \) if and only if \(f(x) = 1\). Moreover, security of predicate encryption guarantees that an adversary learns nothing about the attribute x or the plaintext \(\mu \) from a ciphertext, given arbitrary many secret keys that are not authorized to decrypt the ciphertext individually.read more
Citations
More filters
Posted Content
A Decade of Lattice Cryptography.
TL;DR: Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems as mentioned in this paper, which is the main feature of lattice cryptography.
Book ChapterDOI
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
TL;DR: This paper provides constructions that provably achieve security against more realistic adaptive attacks where the messages M_0 and M_1 may be chosen in the challenge phase, based on the previously collected information for the same inner product functionality.
Book
A Decade of Lattice Cryptography
TL;DR: Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems as discussed by the authors, which is the main feature of lattice cryptography.
Proceedings ArticleDOI
Indistinguishability Obfuscation from Functional Encryption
TL;DR: This work presents a generic construction of indistinguishability obfuscation from public-key functional encryption with succinct cipher texts and sub-exponential security, and shows the equivalence of incoherent obfuscation and public- key functional encryption.
Book ChapterDOI
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
TL;DR: This work provides new tools enabling the design of anonymous authentication systems whereby new users can join the system at any time, and provides the first lattice-based group signature supporting dynamically growing populations of users.
References
More filters
Proceedings ArticleDOI
Fully homomorphic encryption using ideal lattices
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Proceedings ArticleDOI
Attribute-based encryption for fine-grained access control of encrypted data
TL;DR: This work develops a new cryptosystem for fine-grained sharing of encrypted data that is compatible with Hierarchical Identity-Based Encryption (HIBE), and demonstrates the applicability of the construction to sharing of audit-log information and broadcast encryption.
Book ChapterDOI
Fuzzy identity-based encryption
Amit Sahai,Brent Waters +1 more
TL;DR: In this article, a new type of identity-based encryption called Fuzzy Identity-Based Encryption (IBE) was introduced, where an identity is viewed as set of descriptive attributes, and a private key for an identity can decrypt a ciphertext encrypted with an identity if and only if the identities are close to each other as measured by the set overlap distance metric.
Proceedings ArticleDOI
Leveled) fully homomorphic encryption without bootstrapping
TL;DR: A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).
Book ChapterDOI
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Dan Boneh,Xavier Boyen +1 more
TL;DR: The first secure IBE scheme without random oracles was presented in this article, where the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively.