Computing Blindfolded: New Developments in Fully Homomorphic Encryption

DOI10.1109/FOCS.2011.98MaRDI QIDQ5495003zbMATH OpenFDO

Authors Vinod Vaikuntanathan

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/FOCS.2011.98

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited in

(11)

• Multiplicative complexity of vector valued Boolean functions
• On the decision tree complexity of threshold functions
• EPiC: efficient privacy-preserving counting for MapReduce
• Some security bounds for the key sizes of DGHV scheme
• Enhancing data parallelism of fully homomorphic encryption
• Homomorphic encryption
• Outsourcing medical dataset analysis: a possible solution
• Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
• Homomorphic encryption: a mathematical survey
• On the security of domingo-Ferrer's homomorphic cryptosystem against ciphertext-only attack
• Key-dependent message security: generic amplification and completeness

This page was built for publication: Computing Blindfolded: New Developments in Fully Homomorphic Encryption

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