Verifiable secret sharing as secure computation
From MaRDI portal
Recommendations
Cited in
(21)- Fine-grained secure computation
- Secure computation with low communication from cross-checking
- An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme
- Lightweight, maliciously secure verifiable function secret sharing
- Secure computation with preprocessing via function secret sharing
- Efficient explicit constructions of compartmented secret sharing schemes
- Secret-sharing for NP
- The reactive simulatability (RSIM) framework for asynchronous systems
- Security of Hsu--Wu's authenticated encryption scheme with (\(t\), \(n\)) shared verification
- Efficient secret sharing without a mutually trusted authority
- Shared verification cryptography domains: Security in computers
- On the complexity of verifiable secret sharing and multiparty computation
- Information-theoretic secure verifiable secret sharing over RSA modulus
- On verification in secret sharing
- A practical and provable secure scheme for publicly verifiable secret sharing and its applications
- Efficient multiparty computations secure against an adaptive adversary
- scientific article; zbMATH DE number 2048538 (Why is no real title available?)
- scientific article; zbMATH DE number 6829278 (Why is no real title available?)
- Verifiably Secure Devices
- Secret sharing: a comprehensive survey, taxonomy and applications
- Efficient VSS free of computational assumption
This page was built for publication: Verifiable secret sharing as secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757241)
