IACR News item: 05 August 2012
Dario Fiore, Rosario Gennaro
ePrint Reportbe instantiated over RSA moduli, and proven secure under the DDH/RSA/Factoring Assumptions over such groups. Since all previous solutions are based on the use of bilinear maps, we demonstrate that publicly verifiable computation can be achieved even under different and standard assumptions.
Perhaps more interestingly, our solution can handle polynomials over finite fields of {\\em any} characteristic (starting from 2), and thus it can also support public verification of boolean formulas. This allows for a lot of flexibility, and it avoids the efficiency penalty of working bit by bit in fields larger than 2.
The core of our result is a new concept of Algebraic One-Way Functions which may be of independent interest.
Additional news items may be found on the IACR news page.