Verifiably Multiplicative Secret Sharing
From MaRDI portal
Cited in
(13)- Lightweight, maliciously secure verifiable function secret sharing
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- scientific article; zbMATH DE number 1676642 (Why is no real title available?)
- Efficient Multiplicative Sharing Schemes
- Scalable rational secret sharing
- scientific article; zbMATH DE number 5811700 (Why is no real title available?)
- Information-theoretic secure verifiable secret sharing over RSA modulus
- Secure Multi-party Shuffling
- Verifiable multi-secret sharing based on LFSR sequences
- scientific article; zbMATH DE number 1822318 (Why is no real title available?)
- Verifiable partial escrow of integer factors.
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Homomorphic secret sharing with verifiable evaluation
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 Q5223996)