Barriers for Succinct Arguments in the Random Oracle Model

Alessandro Chiesa,Eylon Yogev

doi:10.1007/978-3-030-64378-2_3

Barriers for Succinct Arguments in the Random Oracle Model

Alessandro Chiesa, Eylon Yogev

https://doi.org/10.1007/978-3-030-64378-2_3

Copy DOI

Publication Date: Jan 1, 2020

Citations: 6

Affiliation: University of California, Berkeley, Berkeley College, Tel Aviv University

#Succinct Arguments #Random Oracle + Show 5 more

Abstract
Full-Text
Similar Papers

Abstract

We establish barriers on the efficiency of succinct arguments in the random oracle model. We give evidence that, under standard complexity assumptions, there do not exist succinct arguments where the argument verifier makes a small number of queries to the random oracle. The new barriers follow from new insights into how probabilistic proofs play a fundamental role in constructing succinct arguments in the random oracle model.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.