Attribute Based Encryption for Deterministic Finite Automata from $$\mathsf{DLIN}$$

Agrawal, Shweta; Maitra, Monosij; Yamada, Shota

doi:10.1007/978-3-030-36033-7_4

Cited by 14 publications

(2 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As noted earlier in the introduction, our unbounded-slot notion is closely related to uniform models of computation with unbounded input lengths, such as ABE and FE for DFA and NFA [41,24,9,10]. At a very high level, our construction may be viewed as following the paradigm in [9,10] for building ABE/FE for uniform models of computation by "stitching" together ABE/FE for the smaller step functions; in our setting, the linear relation between the step functions and the overall computation makes "stitching" much simpler. The way we use two copies of the one-slot scheme is also analogous to the "two-slot, interweaving dual system encryption" argument used in the previous ABE for DFA from k-Lin in [24], except our implementation is simpler and more modular.…”

Section: Discussionmentioning

confidence: 99%

Functional Encryption for Attribute-Weighted Sums from k-Lin

Abdalla¹,

Gong

Wee

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present functional encryption schemes for attribute-weighted sums, where encryption takes as input N attribute-value pairs (x i , z i ) where x i is public and z i is private; secret keys are associated with arithmetic branching programs f , and decryption returns the weighted sum N i =1 f (x i )z i while leaking no additional information about the z i 's. Our main construction achieves (1) compact public parameters and key sizes that are independent of N and the secret key can decrypt a ciphertext for any a-priori unbounded N ;(2) short ciphertexts that grow with N and the size of z i but not x i ;(3) simulation-based security against unbounded collusions; (4) relies on the standard k-linear assumption in prime-order bilinear groups.

show abstract

Section: Discussionmentioning

confidence: 99%

Functional Encryption for Attribute-Weighted Sums from k-Lin

Abdalla¹,

Gong

Wee

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…One limitation is that the scheme does not consider that different attributes in the access policy are at different levels of importance, i.e., the attributes do not carry reasonable weights. Waters [19] and Agrawal et al [20] proposed ABE schemes that support arbitrary length input and provide a general ABE structure. In these schemes, the management of attribute universe and key generation are only implemented by a single attribute authority.…”

Section: Related Workmentioning

confidence: 99%

Multi-Authority Criteria-Based Encryption Scheme for IoT

Sun

Yang

Liu

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

Currently, the Internet of Things (IoT) provides individuals with real-time data processing and efficient data transmission services, relying on extensive edge infrastructures. However, those infrastructures may disclose sensitive information of consumers without authorization, which makes data access control to be widely researched. Ciphertext-policy attribute-based encryption (CP-ABE) is regarded as an effective cryptography tool for providing users with a fine-grained access policy. In prior ABE schemes, the attribute universe is only managed by a single trusted central authority (CA), which leads to a reduction in security and efficiency. In addition, all attributes are considered equally important in the access policy. Consequently, the access policy cannot be expressed flexibly. In this paper, we propose two schemes with a new form of encryption named multi-authority criteria-based encryption (CE) scheme. In this context, the schemes express each criterion as a polynomial and have a weight on it. Unlike ABE schemes, the decryption will succeed if and only if a user satisfies the access policy and the weight exceeds the threshold. The proposed schemes are proved to be secure under the decisional bilinear Diffie–Hellman exponent assumption (q-BDHE) in the standard model. Finally, we provide an implementation of our works, and the simulation results indicate that our schemes are highly efficient.

show abstract

Adaptively Secure ABE for DFA from k-Lin and More

Gong

Wee²

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Attribute Based Encryption for Deterministic Finite Automata from $$\mathsf{DLIN}$$

Cited by 14 publications

References 52 publications

Functional Encryption for Attribute-Weighted Sums from k-Lin

Functional Encryption for Attribute-Weighted Sums from k-Lin

Multi-Authority Criteria-Based Encryption Scheme for IoT

Adaptively Secure ABE for DFA from k-Lin and More

Contact Info

Product

Resources

About