Cs 294-121 – Secure Computation Lecture 7: Zero Knowledge Ii
نویسنده
چکیده
Suppose we have some undirected graph G = (GV , GE) represented as an adjacency matrix with |GV | rows and |GV | columns. G is said to be Hamiltonian if there exists a cycle CH that passes through each vertex in GV exactly once. This cycle is called a Hamiltonian cycle. Finding a Hamiltonian cycle in a graph if one exists is an NP-complete problem. We would like to use a zeroknowledge protocol to demonstrate that a graph is Hamiltonian without revealing the Hamiltonian cycle contained within it.
منابع مشابه
CS 276 – Cryptography March 8 , 2016 Lecture 15 : MPC in the head
Zero knowledge proofs are one of the most used fundamental building blocks in Cryptography. Recall that zero knowledge proofs allow a prover to prove to a verifier about the veracity of a statement without revealing anything beyond the assertion. Zero knowledge proofs have notably found several applications in the area of secure multiparty computation. Secure multiparty computation allows a set...
متن کاملLecture 24 : Zero Knowledge
Last lecture, we discussed cryptographic protocols. In particular, we gave a quantum protocol for secret key exchange that is secure in an information theoretical sense provided there is a secure public classical channel. We also discussed bit commitment and showed that no quantum protocol has information theoretic security. Today we will discuss zero knowledge systems and give an example of a ...
متن کاملThreshold Fully Homomorphic Encryption and Secure Computation
Cramer, Damgård, and Nielsen [CDN01] show how to construct an efficient secure multiparty computation scheme using a threshold homomorphic encryption scheme that has four properties i) a honest-verifier zero-knowledge proof of knowledge of encrypted values, ii) proving multiplications correct iii) threshold decryption and iv) trusted shared key setup. Naor and Nissim [NN01a] show how to constru...
متن کاملCs 388h Introduction to Cryptography Lecture 1: Class Introduction 2 Foundations of Cryptography
1 Class Overview This course reviews the foundations of Cryptography and will cover topics such as formal notions of security, encryption, signatures, complexity assumptions, zero knowledge, and multi-party computation. Most of the material will be based on " Introduction to Modern Cryptography " by Katz and Lindell. " Foundations of Cryptography: Volume I " is optional and more theoretical. Se...
متن کاملZero-Knowledge Using Garbled Circuits or How To Prove Non-Algebraic Statements Efficiently
Zero-knowledge protocols are one of the fundamental concepts in modern cryptography and have countless applications. However, after more than 30 years from their introduction, there are only very few languages (essentially those with a group structure) for which we can construct zero-knowledge protocols that are efficient enough to be used in practice. In this paper we address the problem of ho...
متن کامل