Skip to content

References and Background

Jump to bottom
David Osipov edited this page Mar 18, 2025 · 7 revisions

These sources inspired creation of the script

  1. Feldman, P. (1987). A Practical Scheme for Non-interactive Verifiable Secret Sharing. In 28th Annual Symposium on Foundations of Computer Science (FOCS), pp. 427-437. IEEE.

    • Description: This is the original paper introducing Feldman's VSS scheme. It's fundamental to understanding the basic concept of verifiable secret sharing.

  2. Shamir, A. (1979). How to Share a Secret. Communications of the ACM, 22(11), 612-613.

    • Description: This is the seminal paper on Shamir's Secret Sharing, which is the foundation upon which Feldman's VSS is built.

  3. Chen, X., & Lindell, Y. (2024). Fast Actively Secure Multi-Party Computation with Dishonest Majority.

    • Description: The Feldman's VSS was improved using this paper.

  4. Baghery, K., Khazaei, S., & Sadeghi, A. R. (2025). A Unified Framework for Verifiable Secret Sharing. * Description: This paper describes a unified framework of VSS schemes, which was used to improve the basic Feldman's VSS.

  5. Gennaro, R., Ishai, Y., Kushilevitz, E., & Rabin, T. (2007). The round complexity of verifiable secret sharing and secure multicast. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 580-589.

    • Description: This paper explores the round complexity of VSS, which is relevant to the efficiency of the share refreshing and other protocols.

  6. Cramer, R., Damgård, I., & Nielsen, J. B. (2015). Secure Multiparty Computation and Secret Sharing. Cambridge University Press.

    • Description: This book provides a comprehensive treatment of secure multiparty computation and secret sharing, including VSS.

  7. National Institute of Standards and Technology (NIST). (2013). Recommendation for Applications Using Approved Hash Algorithms. NIST Special Publication 800-107 Revision 1.

    • Description: This NIST publication provides guidance on using approved hash algorithms, relevant to the script's use of BLAKE3 and SHA3-256.

  8. National Institute of Standards and Technology (NIST). (2020). Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography NIST Special Publication 800-56A, Revision 3.

    • Description: This relates to the cyclic group.

  9. Kivinen, T. & Kojo, M. (2003). More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE). RFC 3526. Link.

    • Description: This RFC provides the safe prime values used in the library's default configuration for 3072, 4096, 6144, and 8192-bit groups.

Clone this wiki locally