Threshold linear secret sharing to the rescue of MPC-in-the-head

DOI10.1007/978-981-99-8721-4_14zbMATH Open1546.94118MaRDI QIDQ6595690

Matthieu Rivain, Thibauld Feneuil

Publication date: 30 August 2024

zbMATH Keywords

secure multi-party computationZero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• BBQ: using AES in Picnic signatures
• Banquet: short and fast signatures from AES
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• Aurora: transparent succinct arguments for R1CS
• Scalable zero knowledge with no trusted setup
• How to share a secret
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
• LegRoast: Efficient Post-quantum Signatures from the Legendre PRF
• Secure Multiparty Computation and Secret Sharing
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• The return of the SDitH
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
• 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

Related Items (1)

More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings

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)