Hierarchical Predicate Encryption for Inner-Products
By Tatsuaki Okamoto, Katsuyuki Takashima. International Conference on the Theory and Application of Cryptology and Information Security, 2009
297 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/73c0381463f29acfbba1750a935559640d27303a
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
- Brent Waters
- Allison Bishop
- Amit Sahai
- Wenjing Lou
- Dan Boneh
- Vinod Vaikuntanathan
- Katsuyuki Takashima
- Tatsuaki Okamoto
In Computational Theory and Mathematics
- Brent Waters
- Allison Bishop
- Amit Sahai
- Vinod Vaikuntanathan
- Katsuyuki Takashima
- Tatsuaki Okamoto
- Dan Boneh
- Shafi Goldwasser
Citations in the corpus
- VABKS: Verifiable attribute-based keyword search over outsourced encrypted data (2014, methodology): “This is true even for the powerful technique called predicate encryption [28], [29], which does not offer the desired verifiability.”
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “In this paper, we concentrate on the symmetric version of dual pairing vector spaces [30, 31] constructed by using symmetric bilinear pairing groups given in Definition 5.”
- Reusable garbled circuits and succinct functional encryption (2013, background): “We remark that functional encryption (FE) arises from, and generalizes, a beautiful sequence of papers on attribute-based encryption (including [7, 32, 33, 35, 36, 48, 54, 55]), and more generally predicate encryption (including [10, 34, 40]).”
- Unbounded HIBE and Attribute-Based Encryption (2011, unknown): “Waters [30] and further studied in [31,36,37,42].”
- Authorized Private Keyword Search over Encrypted Data in Cloud Computing (2011, background): “Unfortunately, the ciphertext length grows linearly with the number of authorized users.”
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption (2010, methodology): “To prove the security, this paper elaborately combines the dual system encryption methodology proposed by Waters [28] and the concept of dual pairing vector spaces (DPVS) proposed by Okamoto and Takashima [20] [21], in a manner similar to that in [18].”
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008, background): “Okamoto and Takashima have investigated hierarchical inner-product encryption [28] as well as a combination of inner-product encryption and attribute-based encryption [29].”