Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
From MaRDI portal
Publication:6660381
DOI10.1007/978-3-031-71070-4_4MaRDI QIDQ6660381
Miguel Ambrona, Miyako Ohkubo, Masayuki Abe
Publication date: 10 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-interactive zero-knowledge proofs for composite statements
- Round optimal black-box ``commit-and-prove
- Efficient adaptively secure zero-knowledge from garbled circuits
- More efficient commitments from structured lattice assumptions
- The gap between monotone and non-monotone circuit complexity is exponential
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Efficient pseudorandom correlation generators: silent OT extension and more
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Acyclicity programming for sigma-protocols
- Improved OR-Composition of Sigma-Protocols
- On the Power of Secure Two-Party Computation
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- Improved Garbled Circuit: Free XOR Gates and Applications
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Quadratic Span Programs and Succinct NIZKs without PCPs
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Online/Offline OR Composition of Sigma Protocols
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- A generic transform from multi-round interactive proof to NIZK
- Efficient proofs of knowledge for threshold relations
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Generalized special-sound interactive proofs and their knowledge soundness
This page was built for publication: Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660381)
