Threshold linear secret sharing to the rescue of MPC-in-the-head
From MaRDI portal
Publication:6595690
Recommendations
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 2081057 (Why is no real title available?)
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Aurora: transparent succinct arguments for R1CS
- BBQ: using AES in Picnic signatures
- Banquet: short and fast signatures from AES
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- Scalable zero knowledge with no trusted setup
- Secure multiparty computation and secret sharing
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- The return of the SDitH
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
This page was built for publication: Threshold linear secret sharing to the rescue of MPC-in-the-head
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595690)