### Abstract

Consider encrypting n inputs under n independent public keys. Given the ciphertexts {ci = Enc_{pki} (xi)}i, Alice outputs ciphertexts c’_{1},…, c‘_{n} that decrypt to y1,…, y_{n} respectively. What relationships between the x_{i}’s and y_{i}’s can Alice induce? Motivated by applications to delegating computations, Dwork et al. [11] showed that a semantically secure scheme disallows signaling in this setting, meaning that y_{i} cannot depend on x_{j} for j ≠ i. On the other hand if the scheme is homomorphic then any local (component-wise) relationship is achievable, meaning that each y_{i} can be an arbitrary function of xi. However, there are also relationships which are neither signaling nor local. Dwork et al. asked if it is possible to have encryption schemes that support such “spooky” relationships. Answering this question is the focus of our work. Our first result shows that, under the LWE assumption, there exist encryption schemes supporting a large class of “spooky” relationships, which we call additive function sharing (AFS) spooky. In particular, for any polynomial-time function f, Alice can ensure that y_{1},…, y_{n} are random subject to ∑^{n} _{i=1} y_{i} = f(x_{1},…, x_{n}). For this result, the public keys all depend on common public randomness. Our second result shows that, assuming sub-exponentially hard indistinguishability obfuscation (iO) (and additional more standard assumptions), we can remove the common randomness and choose the public keys completely independently. Furthermore, in the case of n = 2 inputs, we get a scheme that supports an even larger class of spooky relationships. We discuss several implications of AFS-spooky encryption. Firstly, it gives a strong counter-example to a method proposed by Aiello et al. [1] for building arguments for NP from homomorphic encryption. Secondly, it gives a simple 2-round multi-party computation protocol where, at the end of the first round, the parties can locally compute an additive secret sharing of the output. Lastly, it immediately yields a function secret sharing (FSS) scheme for all functions. We also define a notion of spooky-free encryption, which ensures that no spooky relationship is achievable. We show that any nonmalleable encryption scheme is spooky-free. Furthermore, we can construct spooky-free homomorphic encryption schemes from SNARKs, and it remains an open problem whether it is possible to do so from falsifiable assumptions.

Original language | English (US) |
---|---|

Title of host publication | Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings |

Publisher | Springer Verlag |

Pages | 93-122 |

Number of pages | 30 |

Volume | 9816 |

ISBN (Print) | 9783662530146 |

DOIs | |

State | Published - 2016 |

Event | 36th Annual International Cryptology Conference, CRYPTO 2016 - Santa Barbara, United States Duration: Aug 14 2016 → Aug 18 2016 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 9816 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 36th Annual International Cryptology Conference, CRYPTO 2016 |
---|---|

Country | United States |

City | Santa Barbara |

Period | 8/14/16 → 8/18/16 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings*(Vol. 9816, pp. 93-122). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9816). Springer Verlag. https://doi.org/10.1007/978-3-662-53015-3_4

**Spooky encryption and its applications.** / Dodis, Yevgeniy; Halevi, Shai; Rothblum, Ron D.; Wichs, Daniel.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings.*vol. 9816, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9816, Springer Verlag, pp. 93-122, 36th Annual International Cryptology Conference, CRYPTO 2016, Santa Barbara, United States, 8/14/16. https://doi.org/10.1007/978-3-662-53015-3_4

}

TY - GEN

T1 - Spooky encryption and its applications

AU - Dodis, Yevgeniy

AU - Halevi, Shai

AU - Rothblum, Ron D.

AU - Wichs, Daniel

PY - 2016

Y1 - 2016

N2 - Consider encrypting n inputs under n independent public keys. Given the ciphertexts {ci = Encpki (xi)}i, Alice outputs ciphertexts c’1,…, c‘n that decrypt to y1,…, yn respectively. What relationships between the xi’s and yi’s can Alice induce? Motivated by applications to delegating computations, Dwork et al. [11] showed that a semantically secure scheme disallows signaling in this setting, meaning that yi cannot depend on xj for j ≠ i. On the other hand if the scheme is homomorphic then any local (component-wise) relationship is achievable, meaning that each yi can be an arbitrary function of xi. However, there are also relationships which are neither signaling nor local. Dwork et al. asked if it is possible to have encryption schemes that support such “spooky” relationships. Answering this question is the focus of our work. Our first result shows that, under the LWE assumption, there exist encryption schemes supporting a large class of “spooky” relationships, which we call additive function sharing (AFS) spooky. In particular, for any polynomial-time function f, Alice can ensure that y1,…, yn are random subject to ∑n i=1 yi = f(x1,…, xn). For this result, the public keys all depend on common public randomness. Our second result shows that, assuming sub-exponentially hard indistinguishability obfuscation (iO) (and additional more standard assumptions), we can remove the common randomness and choose the public keys completely independently. Furthermore, in the case of n = 2 inputs, we get a scheme that supports an even larger class of spooky relationships. We discuss several implications of AFS-spooky encryption. Firstly, it gives a strong counter-example to a method proposed by Aiello et al. [1] for building arguments for NP from homomorphic encryption. Secondly, it gives a simple 2-round multi-party computation protocol where, at the end of the first round, the parties can locally compute an additive secret sharing of the output. Lastly, it immediately yields a function secret sharing (FSS) scheme for all functions. We also define a notion of spooky-free encryption, which ensures that no spooky relationship is achievable. We show that any nonmalleable encryption scheme is spooky-free. Furthermore, we can construct spooky-free homomorphic encryption schemes from SNARKs, and it remains an open problem whether it is possible to do so from falsifiable assumptions.

AB - Consider encrypting n inputs under n independent public keys. Given the ciphertexts {ci = Encpki (xi)}i, Alice outputs ciphertexts c’1,…, c‘n that decrypt to y1,…, yn respectively. What relationships between the xi’s and yi’s can Alice induce? Motivated by applications to delegating computations, Dwork et al. [11] showed that a semantically secure scheme disallows signaling in this setting, meaning that yi cannot depend on xj for j ≠ i. On the other hand if the scheme is homomorphic then any local (component-wise) relationship is achievable, meaning that each yi can be an arbitrary function of xi. However, there are also relationships which are neither signaling nor local. Dwork et al. asked if it is possible to have encryption schemes that support such “spooky” relationships. Answering this question is the focus of our work. Our first result shows that, under the LWE assumption, there exist encryption schemes supporting a large class of “spooky” relationships, which we call additive function sharing (AFS) spooky. In particular, for any polynomial-time function f, Alice can ensure that y1,…, yn are random subject to ∑n i=1 yi = f(x1,…, xn). For this result, the public keys all depend on common public randomness. Our second result shows that, assuming sub-exponentially hard indistinguishability obfuscation (iO) (and additional more standard assumptions), we can remove the common randomness and choose the public keys completely independently. Furthermore, in the case of n = 2 inputs, we get a scheme that supports an even larger class of spooky relationships. We discuss several implications of AFS-spooky encryption. Firstly, it gives a strong counter-example to a method proposed by Aiello et al. [1] for building arguments for NP from homomorphic encryption. Secondly, it gives a simple 2-round multi-party computation protocol where, at the end of the first round, the parties can locally compute an additive secret sharing of the output. Lastly, it immediately yields a function secret sharing (FSS) scheme for all functions. We also define a notion of spooky-free encryption, which ensures that no spooky relationship is achievable. We show that any nonmalleable encryption scheme is spooky-free. Furthermore, we can construct spooky-free homomorphic encryption schemes from SNARKs, and it remains an open problem whether it is possible to do so from falsifiable assumptions.

UR - http://www.scopus.com/inward/record.url?scp=84979519913&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84979519913&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-53015-3_4

DO - 10.1007/978-3-662-53015-3_4

M3 - Conference contribution

SN - 9783662530146

VL - 9816

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 93

EP - 122

BT - Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings

PB - Springer Verlag

ER -