Results 1 - 10 of 134

Searching Keywords with Wildcards on Encrypted Data

by Saeed Sedghi, Peter Van Liesdonk, Svetla Nikova, Pieter Hartel, Willem Jonker
"... Abstract. A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption key is also derived from such a vector, but this one is also allowed to have “⋆ ” (or wildcard) entries. Decryption is pos ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
is possible as long as these tuples agree on every position except where a “⋆ ” occurs. These schemes are useful for a variety of applications: they can be used as building block to construct attribute-based encryption schemes and sophisticated predicate encryption schemes (for e.g. range or subset queries

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

by Jonathan Katz, Amit Sahai, Brent Waters
"... Abstract. Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used to decryp ..."
Abstract - Cited by 173 (23 self) - Add to MetaCart
Abstract. Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used

Hidden vector encryption with groups of prime order

by Vincenzo Iovino , 2008
"... Abstract. Predicate encryption schemes are encryption schemes in which each ciphertext Ct is associated with a binary attribute vector x = (x1,..., xn) and keys K are associated with predicates. A key K can decrypt a ciphertext Ct if and only if the attribute vector of the cipher-text satisfies the ..."
Abstract - Cited by 19 (1 self) - Add to MetaCart
encryption schemes as they can be used to construct more sophisticated predicate encryption schemes (supporting for example range and subset queries). We give a construction for hidden-vector encryption from standard com-plexity assumptions on bilinear groups of prime order. Previous con-structions were

Predicate Privacy in Encryption Systems

by Emily Shen, Elaine Shi, Brent Waters , 2008
"... Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data x can be evaluated using a secret token correspond ..."
Abstract - Cited by 66 (8 self) - Add to MetaCart
and has therefore received little attention in prior work. In this work, we consider predicate encryption in the symmetric-key setting and present a symmetrickey predicate encryption scheme which supports inner product queries. We prove that our scheme achieves both plaintext privacy and predicate privacy

Efficient Predicate Encryption Supporting Construction of Fine-Grained Searchable Encryption

by Weiyi Cai, Xiaoyuan Yang, Xu An Wang
"... Predicate Encryption (PE) is a new encryption paradigm which provides more sophisticated and flexible functionality. PE is sufficient for some new applications, such as fine-grained control over access to encrypted data or search on encrypted data. We present an efficient construction of Predicate E ..."
Abstract - Add to MetaCart
Predicate Encryption (PE) is a new encryption paradigm which provides more sophisticated and flexible functionality. PE is sufficient for some new applications, such as fine-grained control over access to encrypted data or search on encrypted data. We present an efficient construction of Predicate

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption

by Allison Lewko, Amit Sahai, Tatsuaki Okamoto, Katsuyuki Takashima, Brent Waters
"... In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of ABE were only proven to be selectively secure. We achieve full security by adapting the dual system encryption methodology r ..."
Abstract - Cited by 145 (21 self) - Add to MetaCart
system in composite order bilinear groups, where the order is a product of three primes. We prove the security of our system from three static assumptions. Our ABE scheme supports arbitrary monotone access formulas. Our second result is a fully secure (attribute-hiding) predicate encryption (PE) scheme

On black-box reductions between predicate encryption schemes

by Vipul Goyal, Virendra Kumar, Satya Lokam, Mohammad Mahmoody - of Lecture Notes in Computer Science , 2012
"... We prove that there is no black-box construction of a threshold predicate encryption system from identity-based encryption. Our result signifies nontrivial progress in a line of research suggested by Boneh, Sahai and Waters (TCC ’11), where they proposed a study of the relative power of predicate en ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
We prove that there is no black-box construction of a threshold predicate encryption system from identity-based encryption. Our result signifies nontrivial progress in a line of research suggested by Boneh, Sahai and Waters (TCC ’11), where they proposed a study of the relative power of predicate

Tracing Insider Attacks in the Context of Predicate Encryption Schemes

by Jonathan Katz, Dominique Schröder
"... Abstract—In a predicate encryption scheme an authority generates master public and secret keys, and uses the master secret key to derive personal secret keys for authorized users. Each user’s personal secret key SKf corresponds to a predicate f defining the access rights of that user, and each ciphe ..."
Abstract - Add to MetaCart
Abstract—In a predicate encryption scheme an authority generates master public and secret keys, and uses the master secret key to derive personal secret keys for authorized users. Each user’s personal secret key SKf corresponds to a predicate f defining the access rights of that user, and each

Evaluating Predicates over Encrypted Data

by Elaine Shi , 2008
"... CMU Collaborative Research Laboratory, and by a gift from Bosch. The views and conclusions contained here are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either express or implied, of ARO, Bosch, CMU, GM, NSF, or the Predicate ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
, or the Predicate encryption is a new encryption paradigm where the secret key owner can perform fine-grained access control over the encrypted data. In particular, the secret key owner can generate a capability corresponding to a query predicate (e.g., whether an encrypted email contains the keyword MEDICAL

Predicate encryption for circuits from LWE

by Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee , 2015
"... 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 returns plaintext µ if and only if f(x) = 1. Moreover, security of predicate encryption guarantees that an adversary le ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
learns nothing about the attribute x or the plaintext µ from a ciphertext, given arbitrary many secret keys that are not authorized to decrypt the ciphertext individually. We construct a leveled predicate encryption scheme for all circuits, assuming the hardness of the subexponential learning with errors
Results 1 - 10 of 134