Paper 2021/709
Bounded Collusion ABE for TMs from IBE
Rishab Goyal, Ridwan Syed, and Brent Waters
Abstract
We give an attribute-based encryption system for Turing Machines that is provably secure assuming only the existence of identity-based encryption (IBE) for large identity spaces. Currently, IBE is known to be realizable from most mainstream number theoretic assumptions that imply public key cryptography including factoring, the search Diffie-Hellman assumption, and the Learning with Errors assumption.
Our core construction provides security against an attacker that makes a single key query for a machine
Note: Full version of the Asiacrypt 2021 paper.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published by the IACR in ASIACRYPT 2021
- Keywords
- ABETMsUniform ModelIBERAM
- Contact author(s)
-
goyal @ utexas edu
bwaters @ cs utexas edu - History
- 2021-09-14: revised
- 2021-05-28: received
- See all versions
- Short URL
- https://ia.cr/2021/709
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/709, author = {Rishab Goyal and Ridwan Syed and Brent Waters}, title = {Bounded Collusion {ABE} for {TMs} from {IBE}}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/709}, year = {2021}, url = {https://eprint.iacr.org/2021/709} }