Author of the publication

Non-interactive delegation and batch NP verification from standard computational assumptions.

, , and . STOC, page 474-482. ACM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Delegation with Updatable Unambiguous Proofs and PPAD-Hardness., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 652-673. Springer, (2020)Fully Homomorphic NIZK and NIWI Proofs., , , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 356-385. Springer, (2019)On the (In)security of the Fiat-Shamir Paradigm., and . FOCS, page 102-113. IEEE Computer Society, (2003)On Obfuscation with Random Oracles., , and . TCC (2), volume 9015 of Lecture Notes in Computer Science, page 456-467. Springer, (2015)Probabilistically Checkable Arguments., and . CRYPTO, volume 5677 of Lecture Notes in Computer Science, page 143-159. Springer, (2009)Delegating RAM Computations., and . TCC (B2), volume 9986 of Lecture Notes in Computer Science, page 91-118. (2016)Delegating computation: interactive proofs for muggles., , and . STOC, page 113-122. ACM, (2008)Black-Box Circular-Secure Encryption beyond Affine Functions., , and . TCC, volume 6597 of Lecture Notes in Computer Science, page 201-218. Springer, (2011)Cryptographic Assumptions: A Position Paper., and . TCC (A1), volume 9562 of Lecture Notes in Computer Science, page 505-522. Springer, (2016)Low Error Efficient Computational Extractors in the CRS Model., , and . EUROCRYPT (1), volume 12105 of Lecture Notes in Computer Science, page 373-402. Springer, (2020)