Cryptology ePrint Archive: Report 2012/071
Available versions in chronological order
20120223:133040 (posted 23-Feb-2012 13:30:40 UTC)
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems
Eli Ben-Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer
20120818:081427 (posted 18-Aug-2012 08:14:27 UTC)
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems
Eli Ben-Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer
[
Cryptology ePrint archive
]