Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
From MaRDI portal
Publication:6550638
DOI10.1007/978-3-031-50594-2_22MaRDI QIDQ6550638
Publication date: 5 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?)
- Multi-party computation with conversion of secret sharing
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- PKP-based signature scheme
- Public-key generation with verifiable randomness
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
- Publicly Verifiable Secret Sharing
- Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Divisible E-Cash Systems Can Be Truly Anonymous
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
- Spartan and bulletproofs are simulation-extractable (for free!)
- The return of the SDitH
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
This page was built for publication: Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550638)
