pith. sign in

arxiv: 1709.08501 · v2 · pith:CNMRIZ3Hnew · submitted 2017-09-25 · 💻 cs.CR · cs.DC

The Efficient Server Audit Problem, Deduplicated Re-execution, and the Web

classification 💻 cs.CR cs.DC
keywords serverefficientapplicationsauditconcurrentincludinglogsproblem
0
0 comments X
read the original abstract

You put a program on a concurrent server, but you don't trust the server; later, you get a trace of the actual requests that the server received from its clients and the responses that it delivered. You separately get logs from the server; these are untrusted. How can you use the logs to efficiently _verify_ that the responses were derived from running the program on the requests? This is the _Efficient Server Audit Problem_, and it abstracts real-world scenarios, including running a web application on an untrusted provider. We give a solution based on several new techniques, including simultaneous replay and efficient verification of concurrent executions. We implement the solution for PHP web applications. For several applications, our verifier achieves 5.6--10.9x speedup versus simply re-executing, with less than 10 percent overhead for the server.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.