Add to Calendar
2020-08-13 14:00:00
2020-08-13 15:00:00
America/New_York
Scaling Verifiable Computation Using Efficient Set Accumulators
Verifiable outsourcing systems offload a large computation to a remote server,but require that the remote server provide a succinct proof, called a SNARK,that proves that the server carried out the computation correctly. Real-worldapplications of this approach can be found in several blockchain systems thatemploy verifiable outsourcing to process a large number of transactionsoff-chain. This reduces the on-chain work to simply verifying a succinct proofthat transaction processing was done correctly. In practice, verifiableoutsourcing of state updates is done by updating the leaves of a Merkle tree,recomputing the resulting Merkle root, and proving using a SNARK that thestate update was done correctly.In this work, we use a combination of existing and novel techniques toimplement an RSA accumulator inside of a SNARK, and use it as a replacementfor a Merkle tree. We specifically optimize the accumulator for compatibilitywith SNARKs. Our experiments show that the resulting system can dramaticallyreduce costs compared to existing approaches that use Merkle trees forcommitting to the current state. These results apply broadly to any systemthat needs to offload batches of state updates to a remote untrusted server.Topic: CSAIL Security SeminarTime: This is a recurring meeting Meet anytimeJoin Zoom Meetinghttps://mit.zoom.us/j/93005778614One tap mobile+16465588656,,93005778614# US (New York)+16699006833,,93005778614# US (San Jose)Meeting ID: 930 0577 8614US : +1 646 558 8656 or +1 669 900 6833International Numbers: https://mit.zoom.us/u/abt2humbfAJoin by SIP93005778614@zoomcrc.comJoin by Skype for Businesshttps://mit.zoom.us/skype/93005778614
Zoom: https://mit.zoom.us/j/93005778614