Computing Blindfolded: New Developments in Fully Homomorphic Encryption

DOI10.1109/FOCS.2011.98zbMath1292.94145MaRDI QIDQ5495003

Vinod Vaikuntanathan

Publication date: 30 July 2014

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

Mathematics Subject Classification ID

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

Related Items (11)

Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Homomorphic encryption: a mathematical survey ⋮ Multiplicative complexity of vector valued Boolean functions ⋮ EPiC: efficient privacy-preserving counting for MapReduce ⋮ Enhancing Data Parallelism of Fully Homomorphic Encryption ⋮ Some security bounds for the key sizes of DGHV scheme ⋮ Key-dependent message security: generic amplification and completeness ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Outsourcing Medical Dataset Analysis: A Possible Solution ⋮ On the decision tree complexity of threshold functions ⋮ Homomorphic Encryption

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