Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs
Name
2020-772.pdf
Description
Accepted version
Size
676.11 KB
Format
Adobe PDF
Checksum (MD5)
f852639e05c366354a20100e835a244a
Author(s)
Lombardi, Alex
Vaikuntanathan, Vinod
Date Issued
2020
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher
Springer International Publishing
Citation
Lombardi, Alex and Vaikuntanathan, Vinod. 2020. "Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs." Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12172 LNCS.
Version
Author's final manuscript
Abstract
© International Association for Cryptologic Research 2020. The Fiat-Shamir transform is a methodology for compiling a (public-coin) interactive proof system for a language L into a non-interactive argument system for L. Proving security of the Fiat-Shamir transform in the standard model, especially in the context of succinct arguments, is largely an unsolved problem. The work of Canetti et al. (STOC 2019) proved the security of the Fiat-Shamir transform applied to the Goldwasser-Kalai-Rothblum (STOC 2008) succinct interactive proof system under a very strong “optimal learning with errors” assumption. Achieving a similar result under standard assumptions remains an important open question. In this work, we consider the problem of compiling a different succinct interactive proof system: Pietrzak’s proof system (ITCS 2019) for the iterated squaring problem. We construct a hash function family (with evaluation time roughly (Formula Presented)) that guarantees the soundness of Fiat-Shamir for this protocol assuming the sub-exponential (Formula Presented)-hardness of the n-dimensional learning with errors problem. (The latter follows from the worst-case (Formula Presented) hardness of lattice problems.) More generally, we extend the “bad-challenge function” methodology of Canetti et al. for proving the soundness of Fiat-Shamir to a class of protocols whose bad-challenge functions are not efficiently computable. As a corollary (following Choudhuri et al., ePrint 2019 and Ephraim et al., EUROCRYPT 2020), we construct hard-on-average problems in the complexity class (Formula Presented) under the (Formula Presented)-hardness of the repeated squaring problem and the (Formula Presented)-hardness of the learning with errors problem. Under the additional assumption that the repeated squaring problem is “inherently sequential”, we also obtain a Verifiable Delay Function (Boneh et al., EUROCRYPT 2018) in the standard model. Finally, we give additional PPAD-hardness and VDF instantiations demonstrating a broader tradeoff between the strength of the repeated squaring assumption and the strength of the lattice assumption.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-030-56877-1_22
