ALITHEIA: Towards Practical Verifiable Graph Processing

By Yupeng Zhang, Charalampos Papamanthou, Jonathan Katz. 2014

31 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Dan Boneh
2. Eli Ben-Sasson
3. Eran Tromer
4. Madars Virza
5. Alessandro Chiesa
6. Srinath T. V. Setty
7. Michael Riabzev
8. Florian Tramèr

In Computational Theory and Mathematics

1. Eli Ben-Sasson
2. Madars Virza
3. Dan Boneh
4. Eran Tromer
5. Alessandro Chiesa
6. Florian Tramèr
7. Srinath T. V. Setty
8. Michael Riabzev

In Computer Networks and Communications

1. Eli Ben-Sasson
2. Dan Boneh
3. Eran Tromer
4. Florian Tramèr
5. Madars Virza
6. Alessandro Chiesa
7. Srini Devadas

Citations in the corpus

• Slalom: Fast, Verifiable and Private Execution of Neural Networks in Trusted Hardware (2018, positive): “Finally, our general approach of outsourcing work from a TEE to a faster co-processor could be applied to other problems which have fast verification algorithms, e.g., those considered in (McConnell et al., 2011; Zhang et al., 2014).”
• Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014, background): “Most zk-SNARK constructions [6,9,14,17,43,52,55,64,67–69,82,113,114], including published implementations [6,9,17,64,82,113,114], require expensive preprocessing during key generation.”