Hybrid zero-knowledge from garbled circuits
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- A compressed \(\varSigma \)-protocol theory for lattices
- A generic transform from multi-round interactive proof to NIZK
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Acyclicity programming for sigma-protocols
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Efficient adaptively secure zero-knowledge from garbled circuits
- Efficient proofs of knowledge for threshold relations
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Generalized special-sound interactive proofs and their knowledge soundness
- scientific article; zbMATH DE number 4195166 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 1842485 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1440068 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved OR-composition of sigma-protocols
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Non-interactive zero-knowledge proofs for composite statements
- On the power of secure two-party computation
- Online/offline OR composition of sigma protocols
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Quadratic span programs and succinct NIZKs without PCPs
- Round optimal black-box ``commit-and-prove
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Succinct functional commitment for a large class of arithmetic circuits
- The gap between monotone and non-monotone circuit complexity is exponential
- The simplest protocol for oblivious transfer
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Vector and functional commitments from lattices
- Vector commitments over rings and compressed -protocols
This page was built for publication: Hybrid zero-knowledge from garbled circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915714)
