Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
From MaRDI portal
Publication:4412799
DOI10.1007/3-540-36178-2_13zbMath1065.94536OpenAlexW1794218264MaRDI QIDQ4412799
Serge Fehr, Ronald Cramer, Masayuki Abe
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36178-2_13
Related Items
Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Simplified Submission of Inputs to Protocols ⋮ Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform ⋮ Computationally secure pattern matching in the presence of malicious adversaries