Name
Abstract | ||
|---|---|---|
We study the problem of constructing proof systems that achieve both soundness and zero knowledge unconditionally (without relying on intractability assumptions). Known techniques for this goal are primarily combinatorial, despite the fact that constructions of interactive proofs (IPs) and probabilistically checkable proofs (PCPs) heavily rely on algebraic techniques to achieve their properties. |
Year | Venue | Field |
|---|---|---|
2017 | TCC | Polynomial identity testing,Discrete mathematics,Algebraic number,Computer science,Theoretical computer science,Mathematical proof,Soundness,Zero-knowledge proof |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
45 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eli Ben-Sasson | 1 | 1641 | 86.98 |
| Alessandro Chiesa | 2 | 899 | 46.20 |
| Michael A. Forbes | 3 | 97 | 8.99 |
| Ariel Gabizon | 4 | 156 | 13.97 |
| Michael Riabzev | 5 | 19 | 3.28 |
| Nicholas Spooner | 6 | 23 | 4.44 |