Verifiably multiplicative secret sharing
From MaRDI portal
Recommendations
- On \(d\)-multiplicative secret sharing
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- General secure multi-party computation from any linear secret-sharing scheme
- On the complexity of verifiable secret sharing and multiparty computation
- Progress in Cryptology - INDOCRYPT 2003
Cited in
(13)- Information-theoretic secure verifiable secret sharing over RSA modulus
- On \(d\)-multiplicative secret sharing
- scientific article; zbMATH DE number 1822318 (Why is no real title available?)
- Verifiable multi-secret sharing based on LFSR sequences
- scientific article; zbMATH DE number 5811700 (Why is no real title available?)
- Scalable rational secret sharing
- d-Multiplicative Secret Sharing for Multipartite Adversary Structures
- scientific article; zbMATH DE number 1676642 (Why is no real title available?)
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- Lightweight, maliciously secure verifiable function secret sharing
- Perfect verification of modular scheme
- Verifiable partial escrow of integer factors.
- Efficient Multiplicative Sharing Schemes
This page was built for publication: Verifiably multiplicative secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705714)