Mitigating the One-Use Restriction in Attribute-Based Encryption.
Lucas Kowalczyk, Jiahui Liu, Tal Malkin, Kailash Meiyappan
Abstract
Lucas Kowalczyk, Jiahui Liu, Tal Malkin, Kailash Meiyappan
Abstract
We present a key-policy attribute-based encryption scheme that is adaptively secure under a static assumption and is not directly affected by an attribute “one-use restriction”. Our construction improves upon the only other such scheme (Takashima ’17) by mitigating its downside of a ciphertext size that is dependent on the maximum size of any supported attribute set.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We present a key-policy attribute-based encryption scheme that is adaptively secure under a static assumption and is not directly affected by an attribute “one-use restriction”. Our construction improves upon the only other such scheme (Takashima ’17) by mitigating its downside of a ciphertext size that is dependent on the maximum size of any supported attribute set.
Key concepts: Ciphertext, Encryption, Attribute-based encryption, Computer science, Key (lock), Scheme (mathematics), Set (abstract data type), Theoretical computer science