Predicate Privacy in Encryption Systems

By Emily Shen, Elaine Shi, Brent Waters. IACR Cryptology ePrint Archive, 2009

483 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/17e20f8493523809f0189476d52d3b2ed13e0e3f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data (2014, background): “As a more general search approach, predicate encryption schemes [21], [22], [23] are recently proposed to support both conjunctive and disjunctive search.”
Functional Encryption: Definitions and Challenges (2011, background): “A natural reason for this is that in a public key system, he can distinguish whether he has the capability for k0 ,k 1 by simply encrypting an x ∈ X such that F(k0 ,x ) � F(k1 ,x ). However, one might try to consider such a problem when encryption is not public key [ SSW09 , BIP10].”
Reusable garbled circuits and succinct functional encryption (2013, methodology): “First, the works of Boneh and Waters [10], Katz, Sahai and Waters [34], Agrawal, Freeman and Vaikuntanathan [1], and Shen, Shi and Waters [50] show functional encryption schemes (based on different assumptions) for a very simple function: the inner product function f y (or a variant of it), that on…”
A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data (2016, methodology): “Due to the special structure of our tree-based index, the proposed search scheme can flexibly achieve sublinear search time and deal with the deletion and insertion of documents.”
Generic Attacks on Secure Outsourced Databases (2016, methodology): “Broadly, the techniques include multi-party computation [47, 24], oblivious RAM [25, 25], searchable symmetric and structural encryp-1330 tion [45, 22, 13, 15, 14, 12, 40, 19, 33], functional encryption [9, 43], property-preserving encryption [5, 1, 7, 39] and homomorphic encryption [10, 21].”
Privacy-preserving multi-keyword ranked search over encrypted cloud data (2011, methodology): “Although some recent designs have been proposed to support Boolean keyword search [14]–[21] as an attempt to enrich”
Multi-Input Functional Encryption (2014, background): “In this setting, we can hope to achieve a notion of security which is the natural counterpart of what can be achieved in the unary case [32]: possession of tokens TKf1 , .”
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008, background): “Shi, Shen, and Waters [33] explored a symmetric-key variant of innerproduct encryption in relation to a new definition of security (that cannot be achieved in the public-key setting) where secret keys should not leak information about the predicates to which they correspond.”
Authorized Private Keyword Search over Encrypted Data in Cloud Computing (2011, methodology): “Later, several multi-keyword search schemes were proposed [19], [5], [11], [33], [21], [32], [22], [34], [13] that enable conjunctive or disjunctive search formulas.”
Verifiable Privacy-Preserving Multi-Keyword Text Search in the Cloud Supporting Similarity-Based Ranking (2013, methodology): “Predicate encryption is another promising technique to fulfill the search over encrypted data [22].”
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data (2014, background): “predicate privacy [36]) against the keyword guessing attack.”
Practical Dynamic Searchable Encryption with Small Leakage (2014, background): “Related to searchable encryption is also functional encryption [4], [11], [28], where one encrypts the documents in a way that one can issue tokens that would allow testing whether a specific keyword is contained in the document, without decrypting the document.”
Controlling data in the cloud: outsourcing computation without outsourcing control (2009, background): “For example, searchable encryption (also referred to as predicate encryption; see [43], [9], [42], [41], and [10]) allows the data owner to compute a capability from his secret key.”
A Survey of Provably Secure Searchable Encryption (2014, unknown): “more sophisticated f could determine whether the inner product of keywords in the index and a target keyword set is 0 [Shen et al. 2009].”