Name
Abstract | ||
|---|---|---|
Topology-Hiding Computation (THC) allows a set of parties to securely compute a function over an incomplete network without revealing information on the network topology. Since its introduction in TCC’15 by Moran et al., the research on THC has focused on reducing the communication complexity, allowing larger graph classes, and tolerating stronger corruption types. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-45388-6_8 | IACR Cryptology ePrint Archive |
DocType | Volume | Citations |
Journal | 2019 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rio LaVigne | 1 | 0 | 0.34 |
| Chen-Da Liu Zhang | 2 | 0 | 1.35 |
| Ueli Maurer | 3 | 4526 | 505.09 |
| Tal Moran | 4 | 439 | 25.36 |
| Marta Mularczyk | 5 | 0 | 0.34 |
| Daniel Tschudi | 6 | 28 | 4.32 |