VSS from distributed ZK proofs and applications
From MaRDI portal
Recommendations
Cites work
- \textsf{CSI-RAShi}: distributed key generation for CSIDH
- An isogeny-based ID protocol using structured public keys
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- Computationally binding quantum commitments
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSI-SharK: CSI-FiSh with sharing-friendly keys
- CSIDH: an efficient post-quantum commutative group action
- FROST: Flexible round-optimized Schnorr threshold signatures
- He gives C-sieves on the CSIDH
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 1418293 (Why is no real title available?)
- On actively secure fine-grained access structures from isogeny assumptions
- On the (in)security of ROS
- On zeros of a polynomial in a finite grid
- Post-quantum security of Fiat-Shamir
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Practical robust DKG protocols for CSIDH
- Quantum security analysis of CSIDH
- SCALLOP: scaling the CSI-FiSh
- Secure distributed key generation for discrete-log based cryptosystems
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- The Arithmetic of Elliptic Curves
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
Cited in
(8)- Identity-based threshold signatures from isogenies
- \textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- More efficient isogeny proofs of knowledge via canonical modular polynomials
- : a unified framework for computational verifiable secret sharing
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- Faster proofs and VRFs from isogenies
- On round-optimal computational VSS
This page was built for publication: VSS from distributed ZK proofs and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595689)
