Sigma protocols from verifiable secret sharing and their applications
From MaRDI portal
Publication:6562568
DOI10.1007/978-981-99-8724-5_7zbMATH Open1543.94796MaRDI QIDQ6562568
Yu Chen, Zhichao Wang, Chuanzhou Yao, Min Zhang
Publication date: 26 June 2024
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
- Zero-knowledge proofs of knowledge for group homomorphisms
- Efficient signature generation by smart cards
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- A compressed \(\varSigma \)-protocol theory for lattices
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
- Aurora: transparent succinct arguments for R1CS
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Acyclicity programming for sigma-protocols
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- How to share a secret
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Interactive Oracle Proofs
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the Evaluation of Powers and Monomials
- Quadratic Span Programs and Succinct NIZKs without PCPs
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
- Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Related Items (1)
This page was built for publication: Sigma protocols from verifiable secret sharing and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562568)
