Journal ArticleDOI
On sharing secrets and Reed-Solomon codes
Reads0
Chats0
TLDR
Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method, which is closely related to Reed- Solomon coding schemes.Abstract:
Shamir's scheme for sharing secrets is closely related to Reed-Solomon coding schemes. Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method.read more
Citations
More filters
Proceedings ArticleDOI
Hybrid Multiplicative Non-perfect Secret Sharing
TL;DR: In particular, even for the extreme case that the i-th secret is known by all but the i -th player who has partial information on the secret (e.g., all but one bit), d-multiplication is impossible as mentioned in this paper .
Proceedings ArticleDOI
Shared Crowds: A Token-Ring Approach to Hide the Receiver
TL;DR: This paper shows how to build a protocol for anonymous data transmission, with the primary focus on hiding the identity of the receiver (receiver anonymity), using multi path transmission and secret sharing.
Journal ArticleDOI
Perfectly Secure Message Transmission Against Rational Adversaries
TL;DR: In this article , the authors introduce a game-theoretic security model for secure message transmission (SMT) in which adversaries have some preferences for protocol execution and define rational "timid" adversaries who prefer to violate security requirements but do not prefer the tampering to be detected.
Proceedings ArticleDOI
Hybrid Multiplicative Non-perfect Secret Sharing
TL;DR: In particular, even for the extreme case that the i-th secret is known by all but the i -th player who has partial information on the secret (e.g., all but one bit), d-multiplication is impossible as mentioned in this paper .
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Journal ArticleDOI
Polynomial Codes Over Certain Finite Fields
I. S. Reed,G. Solomon +1 more
TL;DR: A mapping of m symbols into 2 symbols will be shown to be (2 m)/2 or ( 2 m 1)/2 symbol correcting, depending on whether m is even or odd.
Book
Algebraic Coding Theory
TL;DR: This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field.
Book
The theory of information and coding
TL;DR: In this paper, the authors present a survey of advanced topics for part I and a survey for part II of a survey on the Gaussian channel and the source coding theorem, including linear codes, BCH Goppa codes, and variable-length source coding.