IP, (NON)ISOGRAPH and Zero Knowledge Protocol COSC 6111 Advanced Algorithm Design and Analysis Daniel Stübig.

Slides:

Advertisements

Similar presentations

Zero Knowledge Proofs(2) Suzanne van Wijk & Maaike Zwart

Advertisements

Cryptography 2 / Cryptographic Protocols 1 Spring Semester 2014 Berry Schoenmakers Coding & Crypto group Department of Mathematics & Computer Science Where’s.

Efficient Zero-Knowledge Proof Systems Jens Groth University College London.

Lecture 15 Zero-Knowledge Techniques. Peggy: “I know the password to the Federal Reserve System computer, the ingredients in McDonald’s secret sauce,

Rennes, 24/10/2014 Cristina Onete CIDRE/ INRIA Sigma Protocols and (Non-Interactive) Zero Knowledge.

Computational Security. Overview Goal: Obtain computational security against an active adversary. Hope: under a reasonable cryptographic assumption, obtain.

Dana Moshkovitz. Back to NP L  NP iff members have short, efficiently checkable, certificates of membership. Is  satisfiable?  x 1 = truex 11 = true.

Optimistic Concurrent Zero-Knowledge Alon Rosen IDC Herzliya abhi shelat University of Virginia.

Protocols to do seemingly impossible 1 CHAPTER 10: Protocols to do seemingly impossible A protocol is an algorithm two (or more) parties have to follow.

Slide 1 Vitaly Shmatikov CS 380S Introduction to Zero-Knowledge.

Zero-Knowledge Proofs J.W. Pope M.S. – Mathematics May 2004.

Complexity 26-1 Complexity Andrei Bulatov Interactive Proofs.

Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.

CS426Fall 2010/Lecture 351 Computer Security CS 426 Lecture 35 Commitment & Zero Knowledge Proofs.

1 Slides by Roel Apfelbaum & Eti Ezra. Enhanced by Amit Kagan. Adapted from Oded Goldreich’s course lecture notes.

1 Adapted from Oded Goldreich’s course lecture notes.

Zero Knowledge Proofs By Subha Rajagopalan Jaisheela Kandagal.

Complexity and Cryptography

Zero-Knowledge Proofs And Their Applications in Cryptographic Systems Sultan Almuhammadi ICS 454.

Zero-Knowledge Proof System Slides by Ouzy Hadad, Yair Gazelle & Gil Ben-Artzi Adapted from Ely Porat course lecture notes.

Lecturer: Moni Naor Foundations of Cryptography Lecture 12: Commitment and Zero-Knowledge.

Introduction to Modern Cryptography, Lecture 7/6/07 Zero Knowledge and Applications.

CS151 Complexity Theory Lecture 13 May 11, CS151 Lecture 132 Outline Natural complete problems for PH and PSPACE proof systems interactive proofs.

Keeping Secrets with Zero Knowledge Proof Stephanie Lin 6.UAP Concept Talk 1.

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

Zero Knowledge Proofs. Interactive proof An Interactive Proof System for a language L is a two-party game between a verifier and a prover that interact.

Introduction to Modern Cryptography, Lecture 9 More about Digital Signatures and Identification.

ELI BEN-SASSON, ALESSANDRO CHIESA, ERAN TROMER AND MADARS VIRZA USENIX SECURITY SYMPOSIUM 2014 Succinct Non-Interactive Zero Knowledge for a von Neumann.

Zero-Knowledge Proofs And Their Applications in Cryptographic Systems ICS 555 Cryptography and Data Security Sultan Almuhammadi.

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

Efficient Zero-Knowledge Proofs Jens Groth University College London.

Fall 2004/Lecture 201 Cryptography CS 555 Lecture 20-b Zero-Knowledge Proof.

Introduction to Modern Cryptography Sharif University Spring 2015 Data and Network Security Lab Sharif University of Technology Department of Computer.

Based on Schneier Chapter 5: Advanced Protocols Dulal C. Kar.

CS151 Complexity Theory Lecture 13 May 11, Outline proof systems interactive proofs and their power Arthur-Merlin games.

Presented by: Suparita Parakarn Kinzang Wangdi Research Report Presentation Computer Network Security.

Zero-Knowledge Proofs And Their Applications in Cryptographic Systems ICS 555 Cryptography and Data Security Sultan Almuhammadi.

On the work of Shafi Goldwasser and Silvio Micali By Oded Goldreich WIS, Dec 2013.

Zero-knowledge proof protocols 1 CHAPTER 12: Zero-knowledge proof protocols One of the most important, and at the same time very counterintuitive, primitives.

CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Interaction,

Zero Knowledge Proofs Matthew Pouliotte Anthony Pringle Cryptography November 22, 2005 “A proof is whatever convinces me.” -~ Shimon Even.

Probabilistic verification Mario Szegedy, Rutgers www/cs.rutgers.edu/~szegedy/07540 Lecture 1.

Cryptography CS Lecture 19 Prof. Amit Sahai.

Complexity 24-1 Complexity Andrei Bulatov Interactive Proofs.

July 8, 2004 IEEE - CEC '041 Better Privacy and Security in E-Commerce: Using Elliptic Curve-Based Zero-Knowledge Proofs Sultan Almuhammadi Nien Sui Dennis.

NP ⊆ PCP(n 3, 1) Theory of Computation. NP ⊆ PCP(n 3,1) What is that? NP ⊆ PCP(n 3,1) What is that?

Dominique Unruh Quantum Proofs of Knowledge Dominique Unruh University of Tartu Tartu, April 12, 2012.

 5.1 Zero-Knowledge Proofs  5.2 Zero-Knowledge Proofs of Identity  5.3 Identity-Based Public-Key Cryptography  5.4 Oblivious Transfer  5.5 Oblivious.

Zero-Knowledge Proofs Ben Hosp. Classical Proofs A proof is an argument for the truth or correctness of an assertion. A classical proof is an unambiguous.

David Evans CS588: Security and Privacy University of Virginia Computer Science Lecture 15: From Here to Oblivion.

Zero Knowledge r Two parties:  All powerful prover P  Polynomially bounded verifier V r P wants to prove a statement to V with the following properties:

Feige-Fiat-Shamir Zero Knowledge Proof Based on difficulty of computing square roots mod a composite n Given two large primes p, q and n=p * q, computing.

CRYPTOGRAPHY COT 6410 AWRAD MOHAMMED ALI NESLISAH TOROSDAGLI JOSIAH WONG.

Topic 36: Zero-Knowledge Proofs

Thinking the Impossible “Modern Cryptography”

Probabilistic Algorithms

On the Size of Pairing-based Non-interactive Arguments

Zero Knowledge Anupam Datta CMU Fall 2017

Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.

Zero-Knowledge Proofs

Fiat-Shamir for Highly Sound Protocols is Instantiable

Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.

Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.

Post-Quantum Security of Fiat-Shamir

09 Zero Knowledge Proof Hi All, One more topic to go!

Zero-Knowledge Proofs

ITIS 6200/8200 Chap 5 Dr. Weichao Wang.

Jens Groth and Mary Maller University College London

Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.

Presentation transcript:

IP, (NON)ISOGRAPH and Zero Knowledge Protocol COSC 6111 Advanced Algorithm Design and Analysis Daniel Stübig

Presentation IP: What is it? Example of IP: ISOGRAPH & NONISOGRAPH Zero Knowledge Protocol: What is it and how does it work (Example)

Interactive proof system Prover Generates certificate unlimited computational resources Verifier Verify certificate bounded computation power Interaction.....

NP ProverVerifier Interaction Computates a wittness Validates the wittness witness

Definition (Graphisomorphism) G and H are isomorph if there exists a permutation π so that H = π(G)

ISOGRAPH ProverVerifier Interaction Computates a wittness Validates the wittness witness

Example of IP - NONISOGRAPH Graph VerifierProver permutation b‘ = b

Probability

Zero Knowledge A zero-knowledge proof must satisfy three properties: Completeness: if the statement is true, the honest verifier will be convinced of this fact by an honest prover. Soundness: if the statement is false, no cheating prover can convince the honest verifier that it is true (except with some small probability) Zero-knowledge: if the statement is true, no cheating verifier learns anything other than this fact. Important to cryptography application

Zero-knowledge protocol - Example … T he cave is shaped like a circle, with the entrance in one side and the magic door blocking the opposite side. Victor says he'll pay her for the secret, but not until he's sure that she really knows it. Peggy says she'll tell him the secret, but not until she receives the money. They devise a scheme by which Peggy can prove that she knows the word without telling it to Victor….

Example of Zero Knowlegde - ISOGRAPH Graph VerifierProver Π is the secret, b = a, a = 1 and b = 0, a = 0 and b = 1 G 0, G 1 are public We are done!

Questions