Cryptology ePrint Archive: Report 2019/629

Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE

Shweta Agrawal and Monosij Maitra and Shota Yamada

Abstract: Constructing Attribute Based Encryption (ABE) [SW05] for uniform models of computation from standard assumptions, is an important problem, about which very little is known. The only known ABE schemes in this setting that i) avoid reliance on multilinear maps or indistinguishability obfuscation, ii) support unbounded length inputs and iii) permit unbounded key requests to the adversary in the security game, are by Waters from Crypto, 2012 [Wat12] and its variants. Waters provided the first ABE for Deterministic Finite Automata (DFA) satisfying the above properties, from a parametrized or ``q-type'' assumption over bilinear maps. Generalizing this construction to Nondeterministic Finite Automata (NFA) was left as an explicit open problem in the same work, and has seen no progress to date. Constructions from other assumptions such as more standard pairing based assumptions, or lattice based assumptions has also proved elusive.

In this work, we construct the first symmetric key attribute based encryption scheme for nondeterministic finite automata (NFA) from the learning with errors (LWE) assumption. Our scheme supports unbounded length inputs as well as unbounded length machines. In more detail, secret keys in our construction are associated with an NFA M of unbounded length, ciphertexts are associated with a tuple (x;m) where x is a public attribute of unbounded length and m is a secret message bit, and decryption recovers m if and only if M(x) = 1.

Further, we leverage our ABE to achieve (restricted notions of) attribute hiding analogous to the circuit setting, obtaining the first predicate encryption and bounded key functional encryption schemes for NFA from LWE. We achieve machine hiding in the single/bounded key setting to obtain the first reusable garbled NFA from standard assumptions. In terms of lower bounds, we show that secret key functional encryption even for DFAs, with security against unbounded key requests implies indistinguishability obfuscation (iO) for circuits; this suggests a barrier in achieving full fledged functional encryption for NFA.

Category / Keywords: Non-determinisitic Finite Automata, Attribute based Encrytion, Predicate Encryption, Functional Encryption, LWE

Original Publication (in the same form): IACR-CRYPTO-2019

Date: received 2 Jun 2019

Contact author: shweta a at gmail com, monosij maitra@gmail com, shota yamada enc@gmail com, yamada-shota@aist go jp

Available format(s): PDF | BibTeX Citation

Version: 20190603:072418 (All versions of this report)

Short URL: ia.cr/2019/629


[ Cryptology ePrint archive ]