Theory of cryptography

Witness-indistinguishable proof

A witness-indistinguishable proof (WIP) is a variant of a zero-knowledge proof for languages in NP. In a typical zero-knowledge proof of a statement, the prover will use a witness for the statement as input to the protocol, and the verifier will learn nothing other than the truth of the statement. In a WIP, this zero-knowledge condition is weakened, and the only guarantee is that the verifier will not be able to distinguish between provers that use different witnesses. In particular, the protocol may leak information about the set of all witnesses, or even leak the witness that was used when there is only one possible witness. Witness-indistinguishable proof systems were first introduced by Feige and Shamir. Unlike zero-knowledge proofs, they remain secure when multiple proofs are being performed concurrently. (Wikipedia).

Video thumbnail

Introduction to Indirect Proof

This video introduces indirect proof and proves one basic algebraic and one basic geometric indirect proof. Complete Video List: http://mathispower4u.yolasite.com/

From playlist Relationships with Triangles

Video thumbnail

How to Prove a Function is Injective(one-to-one) Using the Definition

Please Subscribe here, thank you!!! https://goo.gl/JQ8Nys How to prove a function is injective. Injective functions are also called one-to-one functions. This is a short video focusing on the proof.

From playlist Proofs

Video thumbnail

Nexus Trimester - Huijia Lin (University of California, Santa Barbara)

Zero Knowledge Huijia Lin (University of California, Santa Barbara) March 28, 2016 Abstract: Zero-knowledge protocols, introduced by Goldwasser, Micali, and Rackoff [STOC 1985], are fascinating constructs in cryptography: They provide the paradoxical guarantee that a player, the prover,

From playlist Nexus Trimester - 2016 - Secrecy and Privacy Theme

Video thumbnail

1=2 Proof

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

From playlist Shorts

Video thumbnail

Jonathan Katz - Introduction to Cryptography Part 3 of 3 - IPAM at UCLA

Recorded 25 July 2022. Jonathan Katz of the University of Maryland presents "Introduction to Cryptography III" at IPAM's Graduate Summer School Post-quantum and Quantum Cryptography. Abstract: This lecture will introduce the notions of zero-knowledge proofs, proofs of knowledge, and secure

From playlist 2022 Graduate Summer School on Post-quantum and Quantum Cryptography

Video thumbnail

Learning models: connections between boosting...and regularity II - Russell Impagliazzo

Computer Science/Discrete Mathematics Seminar II Topic: Learning models: connections between boosting...regularity II Speaker: Russell Impagliazzo Affiliation: University of California, San Diego Date: November 14, 2017 For more videos, please visit http://video.ias.edu

From playlist Mathematics

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

Percolation on Nonamenable Groups, Old and New (Lecture-1) by Tom Hutchcroft

PROGRAM: PROBABILISTIC METHODS IN NEGATIVE CURVATURE (ONLINE) ORGANIZERS: Riddhipratim Basu (ICTS - TIFR, Bengaluru), Anish Ghosh (TIFR, Mumbai) and Mahan M J (TIFR, Mumbai) DATE & TIME: 01 March 2021 to 12 March 2021 VENUE: Online Due to the ongoing COVID pandemic, the meeting will

From playlist Probabilistic Methods in Negative Curvature (Online)

Video thumbnail

Fermi Ma - Post-Quantum Proof Techniques, Part 1: Introduction to Quantum Rewinding - IPAM at UCLA

Recorded 28 July 2022. Fermi Ma of the University of California, Berkeley, presents "Post-Quantum Proof Techniques, Part 1: Introduction to Quantum Rewinding" at IPAM's Graduate Summer School Post-quantum and Quantum Cryptography. Abstract: Will cryptography survive quantum adversaries? Ba

From playlist 2022 Graduate Summer School on Post-quantum and Quantum Cryptography

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

Recursively Applying Constructive Dense Model Theorems and Weak Regularity - Russell Impagliazzo

Russell Impagliazzo University of California, San Diego; Member, School of Mathematics February 7, 2011 For more videos, visit http://video.ias.edu

From playlist Mathematics

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

Pseudorandomness - When do sparse sets have dense models? - Impagliazzo

Russell Impagliazzo Institute for Advanced Study December 3, 2008 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Proof: a³ - a is always divisible by 6 (2 of 2: Proof by exhaustion)

More resources available at www.misterwootube.com

From playlist The Nature of Proof

Video thumbnail

Proving Algebraic Inequalities (1 of 3: Introductory principles)

More resources available at www.misterwootube.com

From playlist The Nature of Proof

Video thumbnail

Cryptography - Seminar 6 - Universal composability

This seminar series is about the mathematical foundations of cryptography. In this seminar Eleanor McMurtry concludes the first seminar season on the topic of universal composability. The webpage for this seminar is https://lnor.net/uc-seminar.html. You can join this seminar from anywher

From playlist Metauni

Related pages

Zero-knowledge proof | NP (complexity)