Name
Title | ||
|---|---|---|
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. |
Abstract | ||
|---|---|---|
We define and study zero-testable homomorphic encryption (ZTHE) – a semantically secure, somewhat homomorphic encryption scheme equipped with a weak zero test that can identify trivial zeros. These are ciphertexts that result from homomorphically evaluating an arithmetic circuit computing the zero polynomial over the integers. This is a relaxation of the (strong) zero test provided by the notion of graded encodings, which identifies all encodings of zero. |
Year | Venue | DocType |
|---|---|---|
2017 | TCC | Journal |
Volume | Citations | PageRank |
2017 | 1 | 0.35 |
References | Authors | |
38 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Omer Paneth | 1 | 535 | 22.42 |
| Guy N. Rothblum | 2 | 1383 | 74.86 |