Publications

  • Doubly-efficient zkSNARKs without trusted setup [pdf]
    Riad S. Wahby, Ioanna Tzialla, abhi shelat, Justin Thaler, and Michael Walfish
    IEEE Symposium on Security and Privacy, Oakland 2018, San Francisco, CA, May 2018.
    An extended version is available as Cryptology ePrint 2017/1132.
  • Full accounting for verifiable outsourcing [pdf]
    Riad S. Wahby, Ye Ji, Andrew J. Blumberg, abhi shelat, Justin Thaler, Michael Walfish, and Thomas Wies
    ACM Conference on Computer and Communications Security, CCS 2017, Dallas, TX, October 2017.
    An extended version is available as Cryptology ePrint 2017/242.
  • Verifiable ASICs [pdf] (Distinguished student paper award.)
    Riad S. Wahby, Max Howald, Siddharth Garg, abhi shelat, and Michael Walfish
    IEEE Symposium on Security and Privacy, Oakland 2016, San Jose, CA, May 2016.
    An extended version is available as Cryptology ePrint 2015/1243.
  • Efficient RAM and control flow in verifiable outsourced computation [pdf]
    Riad S. Wahby, Srinath Setty, Zuocheng Ren, Andrew J. Blumberg, and Michael Walfish
    Network & Distributed System Security Symposium, NDSS 2015, San Diego, CA, February 2015.
    A slightly longer version is available as Cryptology ePrint 2014/674.
  • Verifying computations without reexecuting them: from theoretical possibility to near practicality [link]
    Michael Walfish and Andrew J. Blumberg
    (This survey is written for a general CS audience and is probably a good first paper to read for those curious about the area.)
    Communications of the ACM (CACM), Volume 58, Number 2, pages 74–84, February 2015.
    Prior versions: November 2013, July 2014. (ECCC TR13-165).
  • Verifying computations with state [pdf, extended version]
    Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, and Michael Walfish
    ACM Symposium on Operating Systems Principles, SOSP 2013, Farmington, PA, November 2013
  • A hybrid architecture for interactive verifiable computation [pdf]
    Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish
    IEEE Symposium on Security and Privacy, Oakland 2013, San Francisco, CA, May 2013
  • Resolving the conflict between generality and plausibility in verified computation [pdf, extended version]
    Srinath Setty, Benjamin Braun, Victor Vu, Andrew J. Blumberg, Bryan Parno, and Michael Walfish
    ACM European Conference on Computer Systems, EuroSys 2013, Prague, Czech Republic, April 2013
  • Taking proof-based verified computation a few steps closer to practicality [pdf (corrected), extended version]
    Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish
    USENIX Security Symposium, Security 2012, Bellevue, WA, August 2012
  • Making argument systems for outsourced computation practical (sometimes) [pdf]
    Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish
    Network & Distributed System Security Symposium, NDSS 2012, San Diego, CA, February 2012
  • Toward practical and unconditional verification of remote computations [pdf]
    Srinath Setty, Andrew J. Blumberg, and Michael Walfish
    Workshop on Hot Topics in Operating Systems, HotOS 2011, Napa Valley, CA, May 2011