How to share a secret

By Johannes Blömer. 1979

Subfields: Privacy & Security, Information Theory

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Privacy & Security

In Information Theory

Citations in the corpus

Byzantine-Resilient Secure Federated Learning (2020, methodology): “Our framework leverages Feldman’s verifiable secret sharing protocol from [17], which combines Shamir’s secret sharing [18] with homomorphic encryption.”
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning (2020, methodology): “For secret sharing, we utilize Shamir’s Nl 2 -out-of-Nl secret sharing protocol [18].”
Honeycrisp: large-scale differentially private aggregation without a trusted core (2019, methodology): “Shamir secret sharing: We use the error-correction properties of Shamir sharing [69] to tolerate the possibility that after key generation, some committee members’ devices go offline before the second MPC protocol.”
Data Encoding for Byzantine-Resilient Distributed Optimization (2019, methodology): “This is a standard method in Shamir secret sharing scheme [49] that is widely used in information-theoretically secure MPC protocols [50] to provide privacy of users’ data.”
On the Capacity of Secure Distributed Matrix Multiplication (2018, methodology): “We devise a capacity achieving scheme based on Shamir’s secret sharing scheme [15].”
Prochlo: Strong Privacy for Analytics in the Crowd (2017, background): “First, recall the basic idea behind Shamir secret sharing [68]: t-secret sharing splits a secret s in a field F into arbitrary shares s1, s2, .”
Practical Secure Aggregation for Federated Learning on User-Held Data (2016, methodology): “In this round, each user computes n shares of each perturbation pu,v using a (t, n)-threshold scheme 4, such as Shamir’s Secret Sharing [16], for some t > n2 .”
A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy (2015, methodology): “As an example of secret sharing schemes, we describe the Shamir scheme [49].”
Biscotti: A Ledger for Private and Secure Peer-to-Peer Machine Learning (2018, background): “Biscotti achieves the above guarantees using polynomial commitments (see Appendix C) combined with verifiable secret sharing [47] of individual updates.”
The Capacity of Private Information Retrieval (2016, background): “arities to Blind Interference Alignment [13]. PIR protocols are the essential ingredients of oblivious transfer [14], instance hiding [15, 16, 17], multiparty computation [18], secret sharing schemes [19, 20] and locally decodable codes [21]. Throughthe connection between locally decodable and local”
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage (1995, methodology): “Our secret sharing scheme is based on Shamir's scheme [19].”
Efficient privacy preserving video surveillance (2009, methodology): “Secret sharing (SS) methods [4, 9, 11] try to split any data into multiple shares such that no share by itself has any useful information, but together, they retain all the information of the original data.”
Fuzzy Identity-Based Encryption (2005, methodology): “We share use Shamir’s method of secret sharing [14] to distribute shares of a master secret in the exponents of the user’s private key components.”
The security of vehicular ad hoc networks (2005, background): “Secret sharing [26] can be used to technically reinforce the distribution of authorizing material among authorities, whereby authorities share the secret needed to access the database that matches true vehicle identities (ELPs) with the set of their anonymous public keys.”