How to Run Turing Machines on Encrypted Data
Cryptographic schemes for computing on encrypted data promise to be a fundamental building block of cryptography. The way one models such algorithms has a crucial effect on the efficiency and usefulness of the resulting cryptographic schemes. As of today, almost all known schemes for fully homomorph...
Main Authors: | Goldwasser, Shafi (Contributor), Kalai, Yael Tauman (Author), Popa, Raluca Ada (Contributor), Vaikuntanathan, Vinod (Author), Zeldovich, Nickolai (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag Berlin Heidelberg,
2014-11-05T21:26:01Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Reusable garbled circuits and succinct functional encryption
by: Goldwasser, Shafi, et al.
Published: (2014) -
Black-box circular-secure encryption beyond affine functions
by: Brakerski, Zvika, et al.
Published: (2012) -
Robustness of the Learning with Errors Assumption
by: Goldwasser, Shafi, et al.
Published: (2012) -
CryptDB: Protecting confidentiality with encrypted query processing
by: Popa, Raluca Ada, et al.
Published: (2012) -
Building practical systems that compute on encrypted data
by: Popa, Raluca Ada
Published: (2015)