A Function Private Attribute-Based Encryption

Fei Han and Jing Qin

International Journal of Distributed Sensor Networks, 2014, vol. 10, issue 1, 749568

Abstract: The function privacy notion was proposed by Boneh, Raghunathan, and Segev in August 2013. It guarantees that the secret key reveals nothing to malicious adversary, beyond the unavoidable minimal information such as the length of ciphertext. They constructed a function private identity-based encryption that contains equality functionality. In this work we construct a new function private attribute-based encryption which supports more complex functionality. And we transform it to a searchable encryption. In searchable encryption, the trapdoor of searching keywords can be seen as the secret key. Hence, using this system can efficiently resist keyword guessing attack.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2014/749568 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:10:y:2014:i:1:p:749568

DOI: 10.1155/2014/749568

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().