Theses Doctoral

Attribute-Based Encryption for Boolean Formulas

Kowalczyk, Lucas

We present attribute-based encryption (ABE) schemes for Boolean formulas that are adaptively secure under simple assumptions. Notably, our KP-ABE scheme enjoys a ciphertext size that is linear in the attribute vector length and independent of the formula size (even when attributes can be used multiple times), and we achieve an analogous result for CP-ABE. This resolves the central open problem in attribute-based encryption posed by Lewko and Waters. Along the way, we develop a theory of modular design for unbounded ABE schemes and answer an open question regarding the adaptive security of Yao’s Secret Sharing scheme for NC1 circuits.


  • thumnail for Kowalczyk_columbia_0054D_15037.pdf Kowalczyk_columbia_0054D_15037.pdf application/pdf 910 KB Download File

More About This Work

Academic Units
Computer Science
Thesis Advisors
Bishop, Allison
Ph.D., Columbia University
Published Here
January 9, 2019