Predicate fully homomorphic encryption: achieving fine-grained access control over manipulable ciphertext

DOI10.1007/978-3-319-75160-3_18MaRDI QIDQ1745037zbMATH OpenOpenAlexFDO

Authors Hanwen Feng, Qianhong Wu, Weiran Liu, Jianwei Liu

Publication date 20 April 2018

Full work available at URL https://doi.org/10.1007/978-3-319-75160-3_18

zbMATH Keywords

cloud computing securityfine-grained access controlfully homomorphic encryptionpredicate encryption

Mathematics Subject Classification ID

Internet topics (68M11) Cryptography (94A60)

Recommendations

• Paillier type outsourcing the decryption ciphertexts via predicate encryption
• scientific article; zbMATH DE number 6874618
• Computing on Encrypted Data
• CCA-secure keyed-fully homomorphic encryption
• Computing arbitrary functions of encrypted data

Cited in

(2)

• Paillier type outsourcing the decryption ciphertexts via predicate encryption
• scientific article; zbMATH DE number 6874618 (Why is no real title available?)

This page was built for publication: Predicate fully homomorphic encryption: achieving fine-grained access control over manipulable ciphertext

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1745037)