A fully homomorphic cryptosystem with approximate perfect secrecy

DOI10.1007/978-3-642-36095-4_24MaRDI QIDQ4910252zbMATH OpenOpenAlexFDO

Authors Michal Hojsík, Veronika Půlpánová

Publication date 18 March 2013

Published in Topics in Cryptology – CT-RSA 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36095-4_24

zbMATH Keywords

fully homomorphic encryptionGröbner basespolly cracker

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fully homomorphic encryption from approximate ideal lattices
• Polly cracker, revisited
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption over the integers
• Polly cracker, revisited

Cited in

(2)

• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Polly cracker, revisited

This page was built for publication: A fully homomorphic cryptosystem with approximate perfect secrecy

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