20 citations · 97 across the 14 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2016★ 4 cited
How to verify computation with a rational network
Sanjay Jain, Prateek Saxena, Frank Stephan +1
The present paper introduces a practical protocol for provably secure, outsourced computation. Our protocol minimizes overhead for verification by requiring solutions to withstand…
cs.GT2010★ 5 cited
How powerful are integer-valued martingales?
Laurent Bienvenu, Frank Stephan, Jason Teutsch
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale…