Predicate Encryption with Partial Public Keys [PDF]
Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release partial keys, called tokens, that can decrypt only a specific subset of ciphertexts.
BLUNDO, Carlo +2 more
openaire +3 more sources
Related searches:
Enabled/disabled predicate encryption in clouds
Future Generation Computer Systems, 2016Predicate encryption is a cryptographic primitive that provides fine-grained control over access to encrypted data. It is often used for encrypted data search in a cloud storage environment. In this paper, we propose an enabled/disabled predicate encryption scheme, which is the first work that provides timed-release services and data self-destruction ...
Chun-I Fan, Yi-Fan Tseng
exaly +3 more sources
Efficient Subset Predicate Encryption for Internet of Things
2021 IEEE Conference on Dependable and Secure Computing (DSC), 2021With the rapid development of Internet technologies, emerging network environments have been discussed, such as Internet of Things. In this manuscript, we proposed a novel subset predicate encryption for the access control in Internet of Things. Compared with the existing subset predicate encryption schemes, the proposed scheme enjoy the better ...
Yi-Fan Tseng
exaly +2 more sources
Efficient Predicate Encryption Supporting Construction of Fine-Grained Searchable Encryption
2013 5th International Conference on Intelligent Networking and Collaborative Systems, 2013Predicate Encryption (PE) is a new encryption paradigm which provides more sophisticated and flexible functionality. PE is sufficient for some new applications, such as fine-grained control over access to encrypted data or search on encrypted data. We present an efficient construction of predicate encryption which is IND-AH-CPA secure by employing the ...
Minqing Zhang, Xu An Wang
exaly +2 more sources
Function Private Predicate Encryption for Low Min-Entropy Predicates [PDF]
In this work, we propose new constructions for zero inner-product encryption (ZIPE) and non-zero inner-product encryption (NIPE) from prime-order bilinear pairings, which are both attribute and function private in the public-key setting.
Sikhar Patranabis +2 more
openaire +3 more sources
Simplifying Design and Analysis of Complex Predicate Encryption Schemes [PDF]
Wee (TCC’14) and Attrapadung (Eurocrypt’14) introduced predicate and pair encodings, respectively, as a simple way to construct and analyze attribute-based encryption schemes, or more generally predicate encryption. However, many schemes do not satisfy the simple information theoretic property proposed in those works, and thus require much more ...
Shashank Agrawal, Melissa Chase
openaire +3 more sources
Subtleties in Security Definitions for Predicate Encryption with Public Index [PDF]
We take a critical look at established security definitions for predicate encryption (PE) with public index under chosen-plaintext attack (CPA) and under chosen-ciphertext attack (CCA). We identify three different formalizations of key handling in the literature, implicitly assumed to lead to the same security notion.
Johannes Blömer, Gennadij Liske
openaire +3 more sources
Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption [PDF]
We provide generic and black box transformations from any chosen plaintext secure Attribute-Based Encryption (ABE) or One-sided Predicate Encryption system into a chosen ciphertext secure system. Our transformation requires only the IND-CPA security of the original ABE scheme coupled with a pseudorandom generator (PRG) with a special security property.
Venkata Koppula, Brent Waters
openaire +3 more sources
Efficient privacy preserving predicate encryption with fine-grained searchable capability for Cloud storage [PDF]
With the fast development in Cloud storage technologies and ever increasing use of Cloud data centres, data privacy and confidentiality has become a must.
Xu An Wang, Fatos Xhafa, Jianfeng Ma
exaly +2 more sources
Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank [PDF]
In predicate encryption for a function $f$, an authority can create ciphertexts and secret keys which are associated with `attributes\u27. A user with decryption key $K_y$ corresponding to attribute $y$ can decrypt a ciphertext $CT_x$ corresponding to a ...
Josh Alman
exaly +2 more sources

