AI Chat AI Image Generator AI Video Text to Speech

Time Transitive Functions for Zero Knowledge Proofs

08/13/2021

∙

by Ekleen Kaur, et al.

∙

∙

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.

Ekleen Kaur
1 publication
Gokul Alex
1 publication

page 1

page 2

page 3

page 4

research

∙ 09/02/2021

A logic of interactive proofs

We introduce the probabilistic two-agent justification logic IPJ, a logi...

0 David Lehnherr, et al. ∙

research

∙ 07/06/2019

Oracle Separations Between Quantum and Non-interactive Zero-Knowledge Classes

We study the relationship between problems solvable by quantum algorithm...

0 Benjamin Morrison, et al. ∙

research

∙ 08/03/2020

Demystifying the Role of zk-SNARKs in Zcash

Zero-knowledge proofs have always provided a clear solution when it come...

0 Aritra Banerjee, et al. ∙

research

∙ 08/06/2019

Proof of All: Verifiable Computation in a Nutshell

Recent advances in the cryptographic field of "Zero-Knowledge Proofs" ha...

0 Mario Alessandro Barbara, et al. ∙

research

∙ 06/08/2022

Intractable Group-theoretic Problems Around Zero-knowledge Proofs

This paper gives a brief overview of zero-knowledge proof systems and en...

0 Cansu Betin Onur, et al. ∙

research

∙ 07/15/2019

A Survey on Zero Knowledge Range Proofs and Applications

In last years, there has been an increasing effort to leverage Distribut...

0 Eduardo Morais, et al. ∙

research

∙ 05/17/2019

Isabelle technology for the Archive of Formal Proofs with application to MMT

This is an overview of the Isabelle technology behind the Archive of For...

0 Makarius Wenzel, et al. ∙