Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

By Jonathan Katz, Amit Sahai, Brent Waters. Journal of Cryptology, 2008

1,258 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/1f532d6885c11af4b02995c8d6ba0d67a4574bae

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

1. Brent Waters
2. Dan Boneh
3. Allison Bishop
4. Amit Sahai
5. Kui Ren
6. Wenjing Lou
7. Vinod Vaikuntanathan
8. Craig Gentry

In Computer Vision and Pattern Recognition

1. Brent Waters
2. Allison Bishop
3. Dan Boneh
4. Amit Sahai
5. Vinod Vaikuntanathan
6. Craig Gentry
7. Shai Halevi
8. Kui Ren

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.”
• Structured Encryption and Controlled Disclosure (2010, background): “Functional encryption. Functional encryption [34] is a recent paradigm that generalizes work on a variety of problems including identity-based encryption [29,6], attribute-based encryption [28,22,4], and predicate encryption [ 25 ,30].”
• Outsourcing the Decryption of ABE Ciphertexts (2011, background): “1A more general concept of functional encryption [11] allows for more general functions to be computed on the encrypted data and encompasses work such as searching on encrypted data and predicate encryption [10, 2, 12, 39, 27].”
• Attribute-based encryption for circuits (2013, background): “2This primitive, where the attributes are hidden, is also known as predicate-encryption [Katz et al. 2008].”
• Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption (2010, background): “There are two types of secrecy in FE, attribute-hiding and payload-hiding [17].”
• Decentralizing Attribute-Based Encryption (2011, methodology): “We note that several systems such as BGN encryption [15], GrothOstrovsky-Sahai NIZK proofs [32], traitor tracing [16] , and predicate encryption [17, 36] were originally developed in the composite order setting, but later variants were developed in prime order groups [31, 48, 33, 35, 25, 26, 37].”
• Homomorphic Encryption (2017, background): “, [64, 84, 11, 75]), and some variants that support all functions but offer weaker security can be based on the hardness of LWE (e.”
• Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013, background): “Functional Encryption started with the notion of attributebased encryption (ABE) [4], [5] and evolved over time [6], [7].”
• Securing Fog Computing for Internet of Things Applications: Challenges and Solutions (2018, neutral): “In addition, predicate encryption [174] and hidden”
• Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control (2018, background): “A KP-ABE scheme with fully hidden policies can also be constructed from IPE, but it results in a superpoly-nomial blowup in size for arbitrary formulas [11].”
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption (2012, methodology): “Whereas our main construction requires only an ABE scheme, using an attribute-hiding ABE scheme (a notion often associated with predicate encryption schemes [8, 17]) would also give us input privacy, since we encode the function’s input in the attribute corresponding to a ciphertext.”
• The Algebraic Group Model and its Applications (2018, methodology): “Generalizing the GGM to pairing groups has been the subject, e.g., of the works of [Boy08, KSW08, RLB + 08].”
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “Shi and Waters [36] presented a delegation mechanism for a class of PE, but the admissible predicates of the system, which is a class of equality tests for HVE, are more limited than inner-product predicates in [27].”
• Multi-Input Functional Encryption (2014, background): “To address this issue, the notion of functional encryption (FE) was developed in a sequence of works [19, 13, 7, 14, 15, 6, 16, 18].”
• Reusable garbled circuits and succinct functional encryption (2013, background): “Second, Sahai and Seyalioglu [47] and Gorbunov, Vaikuntanathan and Wee [29] provide a construction for single-key functional encryption for one general function with a non-succinct ciphertext size (at least the size of a universal circuit computing the functions allowed by the scheme 3 ).”