… To bridge this gap, recent work has proposed using zeroknowledge proofs (specifically a
form called ZK-SNARKs) for certifying computation with private models but has only been …

… zero-knowledge proofs but it remains an important challenge to make the prover efficient. We
construct the first zero-knowledge proof of knowledge … current state of the art proof systems. …

Suguru is a paper and pencil puzzle invented by Naoki Inaba. The goal of the game is to fulfil
a grid with numbers between 1 and 5 and to respect three simple constraints. In this paper …

… non-interactive zero-knowledge proofs and to universally … zero-knowledge proofs here, but
one could for instance also use it in a similar way to get interactive zero-knowledge proofs in …

… A zero-knowledge proof prevents the verifier from gaining any knowledge on the solution
other … When both randomization and interaction are allowed, the proofs that can be verified in …

… All the properties proved in this paper on quantum computational zeroknowledge proofs
hold unconditionally, meaning that they hold without any computational assumptions such as …

… We give physical algorithms to realize zero-knowledge proofs for these games which allow
a player to show that he knows a solution without revealing it. These interactive proofs can be …

… Remember, however, that this paper focuses not on conventional zero-knowledge proof
but on physical zero-knowledge proof for Sudoku. Hence, we introduce the existing physical …

… Zero-knowledge (ZK) proofs … ) zero-knowledge proofs of knowledge that often feature high
computational efficiency and scalability. ZKGC [24] is an early result of such-type ZK proofs, …

… Zero knowledge proofs are one of the most influential … , in a zero knowledge proof, we
protect the prover’s knowledge: … Zero knowledge proofs have found many applications within …