Computing arbitrary functions of encrypted data

DOI10.1145/1666420.1666444zbMath1315.94074OpenAlexW1971286892WikidataQ123290539 ScholiaQ123290539MaRDI QIDQ3578184

Craig Gentry

Publication date: 14 July 2010

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1666420.1666444

zbMATH Keywords

fully homomorphic encryption scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Foundations of Functional Encryption ⋮ Encrypted SQL arithmetic functions processing for secure cloud database ⋮ Verifiable inner product computation on outsourced database for authenticated multi-user data sharing ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Homomorphic encryption: a mathematical survey ⋮ Balanced non-adjacent forms ⋮ A multi-valued quantum fully homomorphic encryption scheme ⋮ Oblivious Lookup-Tables ⋮ Effective error-tolerant keyword search for secure cloud computing ⋮ DNA-inspired information concealing: a survey ⋮ Symmetric quantum fully homomorphic encryption with perfect security ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Processing secure, verifiable and efficient SQL over outsourced database ⋮ Some security bounds for the key sizes of DGHV scheme ⋮ Encrypted data processing with homomorphic re-encryption

This page was built for publication: Computing arbitrary functions of encrypted data