A practical scheme for non-interactive verifiable secret sharing
By Paul Feldman. 1987
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
Citations in the corpus
- Byzantine-Resilient Secure Federated Learning (2020, methodology): “The correctness (validity) of the secret shares can be verified by testing (15), whenever the majority of the surviving users are honest, i.e., N > 2 A + D [16], [33].”
- Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts (2018, positive): “In future extensions, we are pursuing key management strategies under stronger threat models, using techniques such as secret sharing [36, 77].”
- URSA: ubiquitous and robust access control for mobile ad hoc networks (2004, background): “After broadcasting the witnesses of the secret sharing polynomial f(x) [10] and initializing the first k nodes with their polynomial shares, the trusted authority destroys f(x) and quits.”
- Proactive Secret Sharing Or: How to Cope With Perpetual Leakage (1995, methodology): “It assumes the existence of secure encryption and signature functions, as well as the security of the verifiable secret sharing scheme (VSS) based on homomorphic functions [ 11 ,17].”
- Multi-authority Attribute Based Encryption (2007, methodology): “Step One – Feldman VSS First, let’s consider a very simplified scheme based on the Feldman Verifiable Secret Sharing scheme [Fel87].”
- MPSS: Mobile Proactive Secret Sharing (2010, methodology): “Here we describe Feldman’s VSS scheme [Feldman 1987].”
- Handbook of Applied Cryptography (2018, background): “[259]; see also Benaloh [110] and Feldman [390], as well as Rabin and Ben-Or [1028].”
- Practical Threshold Signatures (2000, methodology): “This same idea was used by Feldman [8] in the context of the di erent but related problem of veri able secret sharing.”
- Secure and efficient key management in mobile ad hoc networks (2005, methodology): “Share verification algorithm: [5] 1) The trusted dealer broadcasts {gK ca mod p, g1 modp, g2 mod p, .”
- Security and Composition of Multiparty Cryptographic Protocols (2000, unknown): “, [21, 17, 25]) have security proofs that work only against non-adaptive adversaries.”
- Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding (2016, background): “Moreover, due to the quantum no-cloning theorem 13 , outsiders will be detected when eavesdropping over the quantum channels (see Figs 3 and 4).”