|
Redundancy in Distributed Proofs| old_uid | 16891 |
|---|
| title | Redundancy in Distributed Proofs |
|---|
| start_date | 2018/12/04 |
|---|
| schedule | 14h30 |
|---|
| online | no |
|---|
| location_info | salle 465 |
|---|
| summary | Distributed proofs are mechanisms enabling the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g. having a specific diameter), or on data-structures distributed over the nodes (e.g. a spanning tree). We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs for establishing perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol.
Joint work with Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvone and Mor Perry. |
|---|
| responsibles | Clam |
|---|
| |
|