CDS composition of multi-round protocols
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176869 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (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?)
- 1-out-of-n Signatures from a Variety of Keys
- A compressed \(\varSigma \)-protocol theory for lattices
- A generic transform from multi-round interactive proof to NIZK
- A new approach to efficient non-malleable zero-knowledge
- Acyclicity programming for sigma-protocols
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- Efficient proofs of knowledge for threshold relations
- Fast Reed-Solomon interactive oracle proofs of proximity
- General secure multi-party computation from any linear secret-sharing scheme
- Generalized special-sound interactive proofs and their knowledge soundness
- How to share a secret
- Improved OR-composition of sigma-protocols
- Non-interactive composition of sigma-protocols via Share-then-Hash
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Online-extractability in the quantum random-oracle model
- Online/offline OR composition of sigma protocols
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Short accountable ring signatures based on DDH
- Short monotone formulae for the majority function
- Signatures from sequential-OR proofs
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Stacked garbling for disjunctive zero-knowledge proofs
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Traceable ring signatures with post-quantum security
- Transparent SNARKs from DARK compilers
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
This page was built for publication: CDS composition of multi-round protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653053)
