Yanfeng Shi

TL;DR: A novel primitive named hidden policy ciphertext-policy attribute-based encryption with keyword search (HP-CPABKS) is proposed, which is unable to search on encrypted data and learn any information about the access structure if his/her attribute credentials cannot satisfy the access control policy specified by the data owner.

TL;DR: This paper proposes a novel ABE variant, dubbed directly revocable key-policyABE with verifiable ciphertext delegation (drvuKPABE), which supports direct revocation and verifiable Ciphertext delegation and attains the security properties under the ( d + 3 -Multilinear Decisional Diffie-Hellman assumption in the random oracle model.

TL;DR: This paper proposes a new framework for enforcing privacy in frequent itemset mining, where data are both collected and mined in an encrypted form in a public cloud service, and specifically design three secure frequent item set mining protocols on top of this framework.

TL;DR: An Identity-Based Private Matching scheme, which realizes fine-grained authorization that enables the privileged cloud server to perform private matching operations without leaking any private data, and the rigorous security proof under the Decisional Linear Assumption and Decisional Bilinear Diffie-Hellman Assumption is presented.

TL;DR: A novel notion called attribute-based proxy re-encryption with keyword search is introduced, which introduces a promising feature: in addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy.