International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers

Authors:
Kang Yang , State Key Laboratory of Cryptology
Xiao Wang , Northwestern University
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: ASIACRYPT 2022
Abstract: In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to $n$ verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a subset of $t$ verifiers. We refer to such ZK proofs as multi-verifier zero-knowledge (MVZK) proofs and focus on the case that a majority of verifiers are honest (i.e., $t
Video from ASIACRYPT 2022
BibTeX
@inproceedings{asiacrypt-2022-32498,
  title={Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers},
  publisher={Springer-Verlag},
  author={Kang Yang and Xiao Wang},
  year=2022
}