Attribute-Based Encryption for Boolean Formulas

Attribute-Based Encryption for Boolean Formulas

by Lucas Kowalczyk

Join Readfeed freeFind clubs reading this bookBrowse readable books
About
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.

Discuss Attribute-Based Encryption for Boolean Formulas with other readers

Join or start a book club for Attribute-Based Encryption for Boolean Formulas on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Attribute-Based Encryption for Boolean Formulas?

Sign up free on Readfeed, then browse public clubs or start your own club with Attribute-Based Encryption for Boolean Formulas as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Attribute-Based Encryption for Boolean Formulas with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Attribute-Based Encryption for Boolean Formulas with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.