Paper 2023/941
Constant Input Attribute Based (and Predicate) Encryption from Evasive and Tensor LWE
Abstract
Constructing advanced cryptographic primitives such as obfuscation or broadcast encryption from standard hardness assumptions in the post quantum regime is an important area of research, which has met with limited success despite significant effort. It is therefore extremely important to find new, simple to state assumptions in this regime which can be used to fill this gap. An important step was taken recently by Wee (Eurocrypt '22) who identified two new assumptions from lattices, namely evasive
Note: 2024/05/15 Changed the statement of Lemma 3.4 and fixed the bug in the proof.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in CRYPTO 2023
- Keywords
- multi-input attribute based encryptionmulti-input predicate encryptionevasive LWEtensor LWE
- Contact author(s)
-
shweta @ cse iitm ac in
melissa rossi @ ssi gouv fr
anshu yadav06 @ gmail com
yamada-shota @ aist go jp - History
- 2024-05-15: revised
- 2023-06-16: received
- See all versions
- Short URL
- https://ia.cr/2023/941
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/941, author = {Shweta Agrawal and Melissa Rossi and Anshu Yadav and Shota Yamada}, title = {Constant Input Attribute Based (and Predicate) Encryption from Evasive and Tensor {LWE}}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/941}, year = {2023}, url = {https://eprint.iacr.org/2023/941} }