Skip to search formSkip to main contentSkip to account menu
Ciphertext-Policy Attribute-Based Encryption
TLDR
A system for realizing complex access control on encrypted data that is conceptually closer to traditional access control methods such as role-based access control (RBAC) and secure against collusion attacks is presented.
View on IEEE
Fuzzy Identity-Based Encryption
TLDR
Two constructions of Fuzzy IBE schemes can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity and are both error-tolerant and secure against collusion attacks.
View via Publisher
Attribute-based encryption for fine-grained access control of encrypted data
TLDR
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.
View on ACM
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
TLDR
A scheme for predicates corresponding to the evaluation of inner products over ℤN (for some large integer N) is constructed, which enables constructions in which predicates correspond to the Evaluation of disjunctions, polynomials, CNF/DNF formulas, thresholds, and more.
View on Springer
Efficient Non-interactive Proof Systems for Bilinear Groups
TLDR
The goal of this paper is to spread the use of non-interactive cryptographic proofs from mainly theoretical purposes to the large class of practical cryptographic protocols based on bilinear groups.
View via Publisher
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for…
View via Publisher
On the (im)possibility of obfuscating programs
TLDR
It is proved that obfuscation is impossible, by constructing a family of efficient programs that are unobfuscatable, in the sense that given any efficient program, the “source code” of that program can be efficiently reconstructed.
View on ACM
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
TLDR
In this work, a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem is described, with a new technique for building FHE schemes called the approximate eigenvector method.
View via Publisher
Private Circuits: Securing Hardware against Probing Attacks
TLDR
This paper proposes several efficient techniques for building private circuits resisting side channel attacks, and provides a formal threat model and proofs of security for their constructions.
View via Publisher
Attribute-based encryption with non-monotonic access structures
TLDR
An Attribute-Based Encryption scheme that allows a user's private key to be expressed in terms of any access formula over attributes based on the Decisional Bilinear Diffie-Hellman (BDH) assumption is constructed.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License