How to share an NP statement or combiners for zero-knowledge proofs
From MaRDI portal
Cites work
- Amplification of non-interactive zero knowledge, revisited
- Approximation by DNF: Examples and Counterexamples
- Broadcast Interactive Proofs
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Cryptographic hashing from strong one-way functions (or: one-way product functions and their applications)
- Cryptography in the multi-string model
- Definitions and properties of zero-knowledge proof systems
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- FHE-based bootstrapping of designated-prover NIZK
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- From obfuscation to the security of Fiat-Shamir for proofs
- How to share a secret
- How to share an NP statement or combiners for zero-knowledge proofs
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- scientific article; zbMATH DE number 708807 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1559565 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- Improved sorting networks with O(log N) depth
- Multiparty computation with low communication, computation and interaction via threshold FHE
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- New techniques for noninteractive zero-knowledge
- NIZK amplification via leakage-resilient secure computation
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Parity, circuits, and the polynomial-time hierarchy
- Player simulation and general adversary structures in perfect multiparty computation
- Practical and provably-secure commitment schemes from collision-free hashing
- Relating monotone formula size and monotone depth of Boolean functions
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Round-optimal secure multiparty computation with honest majority
- Secret-sharing for \(\mathbf {NP}\)
- Secret-Sharing Schemes: A Survey
- Secure MPC: laziness leads to GOD
- Simultaneous amplification: the case of non-interactive zero-knowledge
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Sorting networks of logarithmic depth, further simplified
- Square span programs with applications to succinct NIZK arguments
- Statistical secrecy and multibit commitments
- The Knowledge Complexity of Interactive Proof Systems
- The random oracle methodology, revisited.
- Theory of Cryptography
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Zaps and Their Applications
- Zero-knowledge proofs from secure multiparty computation
Cited in
(3)
This page was built for publication: How to share an NP statement or combiners for zero-knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862525)
