Cryptology ePrint Archive: Report 2012/622
Available versions in chronological order
20121105:134831 (posted 05-Nov-2012 13:48:31 UTC)
Resolving the conflict between generality and plausibility in verified computation
Srinath Setty and Benjamin Braun and Victor Vu and Andrew J. Blumberg and Bryan Parno and Michael Walfish
20130312:051837 (posted 12-Mar-2013 05:18:37 UTC)
Resolving the conflict between generality and plausibility in verified computation
Srinath Setty and Benjamin Braun and Victor Vu and Andrew J. Blumberg and Bryan Parno and Michael Walfish
Publication Info: This is the full version of a paper at Eurosys 2013.
[
Cryptology ePrint archive
]