A Perfect Threshold Secret Sharing Scheme to Identify Cheaters

@article{Carpentieri1995APT,
  title={A Perfect Threshold Secret Sharing Scheme to Identify Cheaters},
  author={Marco Carpentieri},
  journal={Des. Codes Cryptography},
  year={1995},
  volume={5},
  pages={183-187}
}
In this paper we consider the problem of identifying cheaters in secret sharing schemes. Rabin and Ben-Or presented a perfect and unconditionally secure secret sharing scheme in which the honest participants are able to identify the cheaters. We present a similar scheme, but one in which the information distributed to each participant is smaller. 

From This Paper

Topics from this paper.
40 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

The detection of cheaters in threshold schemes , SIAMJ

  • A. De Santis Capocelli, L. Gargano
  • Disc . Math .
  • 1991

Cryptography andData Security, Addison-Wesley

  • D. Denning
  • 1983

Elements of Algebra and Algebraic Computing, Addison-Wesley

  • J. D. Lipson
  • 1981

Similar Papers

Loading similar papers…