Theory of cryptography

Non-interactive zero-knowledge proof

Non-interactive zero-knowledge proofs are zero-knowledge proofs where information between a prover and a verifier can be authenticated by the prover, without revealing any of the specific information beyond the validity of the transaction itself. This function of encryption makes direct communication between the prover and verifier unnecessary, effectively removing any intermediaries. The core trustless cryptography "proofing" involves a hash function generation of a random number, constrained within mathematical parameters (primarily to modulate hashing difficulties) determined by the prover and verifier. With this cryptographic engine, the prover must demonstrate the validity of the transaction, by solving the hash of a random number. Finally, proof of the answer is returned to the verifier, without revealing its value. There are many different methods for establishing a cryptographic proof of hash validity. Perhaps the most notable method, proof of work, involves computing the proper hash value by means of brute force guessing using computational power. A far more scalable approach involves the more modern proof of stake, which leverages the pooled public-key authenticity of blockchain validator networks. (Wikipedia).

Video thumbnail

Existence Proofs

Ben discusses constructive and non-constructive proofs with examples.

From playlist Basics: Proofs

Video thumbnail

Zero Knowledge Proofs - Seminar 4 - Non-interactive Zero Knowledge

This seminar series is about the mathematical foundations of cryptography. In this series Eleanor McMurtry is explaining Zero Knowledge Proofs (ZKPs). This seminar continues the development of non-interactive Zero Knowledge protocols, closing in on systems that can be used in practice. Yo

From playlist Metauni

Video thumbnail

Zero Knowledge Proofs - Seminar 4 - From interactive to non-interactive

This seminar series is about the mathematical foundations of cryptography. In this series Eleanor McMurtry is explaining Zero Knowledge Proofs (ZKPs). This seminar explains how to construct *non-interactive* ZKPs which are much more practical than the schemes discussed so far in the semina

From playlist Metauni

Video thumbnail

Hope for a Type-Theoretic Understanding of Zero-Knowledge - Noam Zeilberger

Noam Zeilberger IMDEA Software Institute; Member, School of Mathematics October 4, 2012 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

But Why Does 0! = 1

►WEBSITE https://www.brithemathguy.com ►MY COURSE Prove It Like A Mathematician! (Intro To Math Proofs) https://www.udemy.com/course/prove-it-like-a-mathematician/?referralCode=D4A14680C629BCC9D84C ►BECOME A CHANNEL MEMBER https://www.youtube.com/channel/UChVUSXFzV8QCOKNWGfE56YQ/join #

From playlist Shorts

Video thumbnail

Sum of nonnegative powers of 2 = -1 [Bogus Proofs]

In this video we prove that the sum of the nonnegative powers of 2 is equal to -1. Can you find the error? For a typed transcript of this proof check out our blog: https://centerofmathematics.blogspot.com/2018/12/bogus-proofs.html

From playlist Bogus Proofs

Video thumbnail

IntroToNPTests.1.Definitions

This video is brought to you by the Quantitative Analysis Institute at Wellesley College. The material is best viewed as part of the online resources that organize the content and include questions for checking understanding: https://www.wellesley.edu/qai/onlineresources

From playlist Intro To Non-Parametric Tests (updated)

Video thumbnail

Zero Knowledge Proofs - Seminar 2 - Defining zero knowledge proofs

This seminar series is about the mathematical foundations of cryptography. In this series Eleanor McMurtry is explaining Zero Knowledge Proofs (ZKPs), a fascinating set of techniques that allow one participant to prove they know something *without revealing the thing*. In this seminar Elea

From playlist Metauni

Video thumbnail

Efficient Zero Knowledge Proofs - A Modular Approach (Lecture 1) by Yuval Ishai

DISCUSSION MEETING : FOUNDATIONAL ASPECTS OF BLOCKCHAIN TECHNOLOGY ORGANIZERS : Pandu Rangan Chandrasekaran DATE : 15 to 17 January 2020 VENUE : Madhava Lecture Hall, ICTS, Bangalore Blockchain technology is among one of the most influential disruptive technologies of the current decade.

From playlist Foundational Aspects of Blockchain Technology 2020

Video thumbnail

Zero Knowledge Proofs - Seminar 8 - Completing the story of ZKSNARKS

This seminar series is about the mathematical foundations of cryptography. In this series Eleanor McMurtry is explaining Zero Knowledge Proofs (ZKPs). Last time Eleanor covered SNARKS, Succinct Non-interactive ARgument of Knowledge. Today this is extended to include: - Zero-knowledge - Ho

From playlist Metauni

Video thumbnail

zkSNARKs -- Recent progress and applications to blockchain protocols by Chaya Ganesh

DISCUSSION MEETING : FOUNDATIONAL ASPECTS OF BLOCKCHAIN TECHNOLOGY ORGANIZERS : Pandu Rangan Chandrasekaran DATE : 15 to 17 January 2020 VENUE : Madhava Lecture Hall, ICTS, Bangalore Blockchain technology is among one of the most influential disruptive technologies of the current decade.

From playlist Foundational Aspects of Blockchain Technology 2020

Video thumbnail

Introduction to Proof by Counter Example

This video provides an introduction to the proof method of proof by counter example. mathispower4u.com

From playlist Symbolic Logic and Proofs (Discrete Math)

Video thumbnail

PCP and Delegating Computation: A Love Story - Yael Tauman Kalai

Computer Science/Discrete Mathematics Seminar I Topic: PCP and Delegating Computation: A Love Story Speaker: Yael Tauman Kalai Affiliation: Microsoft Research Date: January 28, 2019 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Stanford Seminar - Doubly-efficient zkSNARKs Without Trusted Setup

zkSNARKs: what are they? How do their principles apply to security? And more importantly, what is their relationship to cryptocurrency? Join Riad Wahby as he presents his team’s work on Zero-Knowledge Succinct Non-Interactive Argument of Knowledge, also known as zkSNARKs. This presentat

From playlist Stanford Seminars

Video thumbnail

Zero Knowledge Proofs - Seminar 1 - Introduction

This seminar series is about the mathematical foundations of cryptography. In this series Eleanor McMurtry is explaining Zero Knowledge Proofs (ZKPs), a fascinating set of techniques that allow one participant to prove they know something *without revealing the thing*. You can join this s

From playlist Metauni

Video thumbnail

Efficient Zero Knowledge Proofs - A Modular Approach (Lecture 2) by Yuval Ishai

DISCUSSION MEETING : FOUNDATIONAL ASPECTS OF BLOCKCHAIN TECHNOLOGY ORGANIZERS : Pandu Rangan Chandrasekaran DATE : 15 to 17 January 2020 VENUE : Madhava Lecture Hall, ICTS, Bangalore Blockchain technology is among one of the most influential disruptive technologies of the current decade.

From playlist Foundational Aspects of Blockchain Technology 2020

Video thumbnail

Luca De Feo, Proving knowledge of isogenies, quaternions and signatures

VaNTAGe Seminar, November 15, 2022 License: CC-BY-NC-SA Links to some of the papers and cites mentioned in the talk: Couveignes (2006): https://eprint.iacr.org/2006/291 Fiat-Shamir (1986): https://doi.org/10.1007/3-540-47721-7_12 De Feo-Jao-Plût (2011): https://eprint.iacr.org/2011/506 B

From playlist New developments in isogeny-based cryptography

Related pages

Zcash | Commitment scheme | Common reference string model | Standard model (cryptography) | Proof of work | Fiat–Shamir heuristic | Hash function | Zero-knowledge proof | Proof of stake | Pairing-based cryptography | Sub-group hiding | XDH assumption | Cook–Levin theorem | Circuit satisfiability problem | Blockchain