Dan Boneh
Amit Sahai
Brent Waters
Skip Abstract Section
Abstract
Decryption keys allow users to learn a specific function of the encrypted data and nothing else.
- Agrawal, S., Boneh, D., and Boyen, X. Efficient lattice (H)IBE in the standard model. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2010, 553--572. Google Scholar
Digital Library
- Agrawal, S., Freeman, D.M., and Vaikuntanathan, V. Functional encryption for inner product predicates from learning with errors. In Proceedings of ASIACRYPT, Lecture Notes in Computer Science, Springer, 2011, 21--40. Google ScholarDigital Library
- Bethencourt, J., Sahai, A., and Waters, B. Ciphertext-policy attribute-based encryption. In Proceedings of the IEEE Symposium on Security and Privacy, IEEE Computer Society, 2007, 321--334. Google ScholarDigital Library
- Boneh, D. and Boyen, X. Efficient selective-id secure identity-based encryption without random oracles. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2004, 223--238.Google Scholar
- Boneh, D., Crescenzo, G.D., Ostrovsky, R., and Persiano, G. Public-key encryption with keyword search. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2004, 506--522.Google Scholar
- Boneh, D. and Franklin, M.K. Identity-based encryption from the weil pairing. In Proceedings of Crypto, Lecture Notes in Computer Science, Springer, 2001, 213--229. Google ScholarDigital Library
- Boneh, D., Sahai, A., and Waters, B. Functional encryption: Definitions and challenges. In Proceedings of TCC, Lecture Notes in Computer Science, Springer, 2011, 253--273. Google ScholarDigital Library
- Boneh, D. and Waters, B. Conjunctive, subset, and range queries on encrypted data. In Proceedings of TCC, Lecture Notes in Computer Science, Springer, 2007, 535--554. Google ScholarDigital Library
- Chase, M. Multi-authority attribute-based encryption. In Proceedings of TCC, Lecture Notes in Computer Science, Springer, 2007, 515--534. Google ScholarDigital Library
- Cocks, C. An identity-based encryption scheme based on quadratic residues. In Proceedings of the Institute of Mathematics and Its Applications, Lecture Notes in Computer Science, Springer, 2001, 360--363. Google ScholarDigital Library
- Diffie, W. and Hellman, M.E. Multiuser cryptographic techniques. In Proceedings of AFIPS National Computer Conference, AFIPS Press, 1976, 109--112. Google ScholarDigital Library
- Diffie, W and Hellman, M.E. New directions in cryptography. IEEE Transactions on Information Theory 22 (1976), 644--654. Google ScholarDigital Library
- Gentry, C. Computing arbitrary functions of encrypted data. Commun. ACM 53, 3 (Mar. 2010), 97--105. Google ScholarDigital Library
- Gentry, C. Fully homomorphic encryption using ideal lattices. In Proceedings of STOC 2009, ACM Press, New York, 2009, 169--178. Google ScholarDigital Library
- Gentry, C. Practical identity-based encryption without random oracles. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2006, 445--464. Google ScholarDigital Library
- Gentry, C., Peikert, C., and Vaikuntanathan, V. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of STOC, ACM Press, New York, 2008, 197--206. Google ScholarDigital Library
- Gentry, C. and Silverberg, A. Hierarchical id-based cryptography. In Proceedings of ASIACRYPT 2002, Lecture Notes in Computer Science, Springer, 2002, 548--566. Google ScholarDigital Library
- Goldreich, O., Micali, S., and Wigderson, A. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of STOC, ACM Press, New York, 1987, 218--229. Google ScholarDigital Library
- Goyal, V., Pandey, O., Sahai, A., and Waters, B. Attribute-based encryption for fine-grained access control of encrypted data. In Proceedings of the ACM Conference on Computer and Communications Security, ACM Press, New York, 2006, 89--98. Google ScholarDigital Library
- Horwitz, J. and Lynn, B. Toward hierarchical identity-based encryption. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2002, 466--481. Google ScholarDigital Library
- Katz, J., Sahai, A., and Waters, B. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2008, 146--162. Google ScholarDigital Library
- Lewko, A.B., Okamoto, T., Sahai, A., Takashima, K., and Waters, B. Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2010, 62--91. Google ScholarDigital Library
- Lewko, A.B., Sahai, A., and Waters, B. Revocation systems with very small private keys. In Proceedings of the IEEE Symposium on Security, IEEE Computer Society, 2010, 273--285. Google ScholarDigital Library
- Lewko, A.B. and Waters, B. Decentralizing attribute-based encryption. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2011, 568--588. Google ScholarDigital Library
- Okamoto, T. and Takashima, K. Fully secure functional encryption with general relations from the decisional linear assumption. In Proceedings of CRYPTO, Lecture Notes in Computer Science, Springer, 2010, 191--208. Google ScholarDigital Library
- Ostrovsky, R., Sahai, A., and Waters, B. Attribute-based encryption with non-monotonic access structures. In Proceedings of the ACM Conference on Computer and Communications Security, ACM Press, New York, 2007, 195--203. Google ScholarDigital Library
- Sahai, A. and Seyalioglu, H. Worry-free encryption: Functional encryption with public keys. In Proceedings of the ACM Conference on Computer and Communications, ACM Press, New York, 2010, 463--472. Google ScholarDigital Library
- Sahai, A. and Waters, B. Fuzzy identity-based encryption. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2005, 457--473. Google ScholarDigital Library
- Shamir, A. Identity-based cryptosystems and signature schemes. In Proceedings of CRYPTO, Lecture Notes in Computer Science, Springer, 1984, 47--53. Google ScholarDigital Library
- Waters, B. Efficient identity-based encryption without random oracles. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2005, 114--127. Google ScholarDigital Library
- Waters, B. Dual-system encryption: Realizing fully secure ibe and hibe under simple assumptions. In Proceedings of CRYPTO, Lecture Notes in Computer Science, Springer, 2009, 619--636. Google ScholarDigital Library
- Waters, B. Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. In Proceedings of the Public Key Cryptography Conference, Lecture Notes in Computer Science, Springer, 2011, 53--70. Google ScholarDigital Library
- Yao, A.C.-C. Protocols for secure computations (extended abstract). In Proceedings of FOCS, IEEE Computer Society, 1982, 160--164. Google ScholarDigital Library
Index Terms
- Functional encryption: a new vision for public-key cryptography
Recommendations
Publicly Auditable Functional Encryption
Applied Cryptography and Network SecurityAbstractWe introduce the notion of publicly auditable functional encryption (PAFE). Compared to standard functional encryption, PAFE operates in an extended setting that includes an entity called auditor, besides key-generating authority, encryptor, and ...
Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation
PKC'10: Proceedings of the 13th international conference on Practice and Theory in Public Key CryptographyIn functional encryption (FE) schemes, ciphertexts and private keys are associated with attributes and decryption is possible whenever key and ciphertext attributes are suitably related. It is known that expressive realizations can be obtained from a ...
Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
EUROCRYPT'10: Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic TechniquesWe present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product predicates. In both cases, previous constructions ...
Comments