Time Transitive Functions for Zero Knowledge Proofs
Ekleen Kaur, Gokul Alex
TL;DR
This paper explores the use of verifiable delay functions to enhance the efficiency of provers and simulators in iterative non-interactive zero-knowledge proofs, with potential benefits for blockchain applications.
Contribution
It introduces a novel application of verifiable delay functions to improve space-time efficiency in zero-knowledge proof systems.
Findings
VDFs enable more space-time-efficient provers.
VDFs improve the efficiency of simulators in ZK systems.
Potential applications in blockchain technology.
Abstract
Verifiable delay functions have found a lot of applications in blockchain technology in recent times. Continuous verifiable delay functions are an improvement over the basic notion of VDFs with recursive capabilities. We are proposing the application of VDF for constructing more space time-efficient provers and simulators required for the iterative non-interactive zero-knowledge systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Security and Verification in Computing · Computability, Logic, AI Algorithms