Non-interactive distributed-verifier proofs and proving relations among commitments

DOI10.1007/3-540-36178-2_13MaRDI QIDQ4412799zbMATH OpenOpenAlexFDO

Authors Masayuki Abe, Ronald Cramer, Serge Fehr

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

zbMATH Keywords

commitment multiplication proofthreshold cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Non-interactive Proofs for Integer Multiplication
• On the amortized complexity of zero knowledge protocols for multiplicative relations
• Compact VSS and efficient homomorphic UC commitments
• Theory of Cryptography
• A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor

Cited in

(11)

• Redundancy in distributed proofs
• Efficient and secure generalized pattern matching via Fast Fourier Transform
• Simplified Submission of Inputs to Protocols
• Distributed provers with applications to undeniable signatures
• Non-interactive Proofs for Integer Multiplication
• On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
• 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
• Ramp hyper-invertible matrices and their applications to MPC protocols
• Single-input functionality against a dishonest majority: practical and round-optimal
• Computationally secure pattern matching in the presence of malicious adversaries

This page was built for publication: Non-interactive distributed-verifier proofs and proving relations among commitments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412799)