Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption

By Tatsuaki Okamoto, Katsuyuki Takashima. IACR Cryptology ePrint Archive, 2010

520 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/9bdc0448502749fb5e6ab20c08089bc0bba5d890

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

In Computer Networks and Communications

Citations in the corpus

Practical constructions and new proof methods for large universe attribute-based encryption (2013, background): “In a recent result [22] building on [30, 32, 23, 17], one can actually “em-ulate” the eﬀects of the composite order groups by creating special subspaces of vectors, called dual vector spaces introduced by Okamoto and Takashima, and construct a large universe KP-ABE system on prime order groups.”
Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control (2018, background): “[49] presented a fully secure functional encryption scheme, which covers KP-ABE and CP-ABE schemes with non-monotone access policies.”
A Survey of Provably Secure Searchable Encryption (2014, unknown): “Tang [2011, 2012a, 2012b] and Yang et al. [2010] proposed the concept of public key encryption, which supports equality tests between ciphertexts (PKEET).”
Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption (2012, background): “Originally proposed by Sahai and Waters [23], attribute-based encryption [11, 21, 24, 13, 20] has been an active research area in cryptography in part since it is a primitive with interesting functional applications [10, 5] and can be implemented eﬃciently [4].”
Reusable garbled circuits and succinct functional encryption (2013, background): “A promising approach to this problem is functional encryption [9, 33–35, 41, 42, 48].”
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, methodology): “The dual system encryption methodology has previously been implemented both in prime order bilinear groups (e.g. in [35] [29]) and in composite order bilinear groups (e.g. in [24] [23]).”
An Algebraic Framework for Diffie–Hellman Assumptions (2013, background): “Recently, a number of works have illustrated the usefulness of a more algebraic point of view on decisional assumptions in bilinear groups, like the Dual Pairing Vector Spaces of Okamoto and Takashima [28] or the Subspace Assumption of Lewko [24].”
Unbounded HIBE and Attribute-Based Encryption (2011, methodology): “The methodology of dual system encryption was introduced by Waters [45] and later used in [34, 31, 37, 22, 32] to obtain adaptive security (and also leakage resilience in [22, 32]) for IBE, HIBE, and ABE systems.”
Attribute-based encryption for circuits (2013, background): “The state of the art is Boolean formulas [27, 29, 35], which is a subclass of log-space computations.”
Functional Encryption: Definitions and Challenges (2011, methodology): “Examples of these include combinations of: Attribute-Based Encryption and Broadcast Encryption [AI09], Identity-Based Broadcast Encryption [Del07, DPP07, SF07, GW09], broadcast HIBE [BH08], and Inner-Product Encryption and ABE [ OT10 ].”
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (2011, methodology): “We remark that the functionality of KP-ABE in [31] is slightly different from the original one [20].”
Outsourcing the Decryption of ABE Ciphertexts (2011, background): “Since the introduction of ABE there have been several other works proposing different variants [24, 7, 14, 36, 23, 42, 15, 28, 35] extending both functionality and reﬁning security proof techniques.”
Attribute-Based Encryption With Verifiable Outsourced Decryption (2013, background): “There are two kinds of ABE schemes: key-policy ABE (KP-ABE) [2]–[7] and ciphertext-policy ABE (CP-ABE) [8], [9], [5], [6].”
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage (2017, unknown): “Two types of ABE schemes, namely key-policy ABE (KPABE) [3], [4], [5], [6], [7], [8] and ciphertext-policy ABE (CP-ABE) [9], [10], [11], [12], [13], [14], [15] are proposed.”
Attribute-Based Encryption for Circuits from Multilinear Maps (2012, methodology): “These include new proof techniques to achieve adaptive security [LOS + 10, OT10, LW12], decentralizing trust among multiple authorities [Cha07, CC09, LW11], and applications to outsourcing computation [PRV12].”