CryptoDB
ABE for DFA from LWE against Bounded Collusions, Revisited
Authors: | |
---|---|
Download: | |
Abstract: | We present a new public-key ABE for DFA based on the LWE assumption, achieving security against collusions of a-priori bounded size. Our scheme achieves ciphertext size O~(L + B) for attributes of length L and collusion size B. Prior LWE-based schemes has either larger ciphertext size O~(L B), or are limited to the secret-key setting. Along the way, we introduce a new technique for lattice trapdoor sampling, which we believe would be of independent interest. Finally, we present a simple candidate public-key ABE for DFA for the unbounded collusion setting. |
BibTeX
@article{tcc-2021-31537, title={ABE for DFA from LWE against Bounded Collusions, Revisited}, booktitle={Theory of Cryptography;19th International Conference}, publisher={Springer}, doi={10.1007/978-3-030-90453-1_10}, author={Hoeteck Wee}, year=2021 }