ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
On sharing secrets and Reed-Solomon codes
Full text PdfPdf (175 KB)
Source
Communications of the ACM archive
Volume 24 ,  Issue 9  (September 1981) table of contents
Pages: 583 - 584  
Year of Publication: 1981
ISSN:0001-0782
Authors
R. J. McEliece  Univ. of Illinois at Urbana—Champaign, Urbana
D. V. Sarwate  Univ. of Illinois at Urbana—Champaign, Urbana
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 145,   Citation Count: 16
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/358746.358762
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Berlekamp, E.R. Algebraic Coding Theory. McGraw-Hill, New York, 1968.
 
2
Robert J. McEliece, Theory of Information and Coding, Cambridge University Press, New York, NY, 2001
 
3
Reed, I.S. and Solomon, G. Polynomial codes over certain finite fields. J. SIAM 8, 2 (June 1960), 300-304.
 
4
Sarwate, D.V. On the complexity of decoding Goppa codes. IEEE Trans. Inform. Theory 23, 4 (July 1977), 515-516.
5
Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979  [doi>10.1145/359168.359176]
 
6
Sugiyama, Y., Kasahara, M., Hirasawa, S., and Namekawa, T. An erasures-and-errors decoding algorithm for Goppa codes. IEEE Trans. Inform. Theory 22, 2 (Mar. 1976), 238-241.

CITED BY  16
David Chaum , Claude Crépeau , Ivan Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.11-19, May 02-04, 1988, Chicago, Illinois, United States
Hugo Krawczyk, Distributed fingerprints and secure information dispersal, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.207-218, August 15-18, 1993, Ithaca, New York, United States
Tal Rabin, Robust sharing of secrets when the dealer is honest or cheating, Journal of the ACM (JACM), v.41 n.6, p.1089-1109, Nov. 1994
Rosario Gennaro , Michael O. Rabin , Tal Rabin, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, p.101-111, June 28-July 02, 1998, Puerto Vallarta, Mexico
Danny Dolev , Cynthia Dwork , Orli Waarts , Moti Yung, Perfectly secure message transmission, Journal of the ACM (JACM), v.40 n.1, p.17-47, Jan. 1993
Bogdan S. Chlebus , Leszek Gasieniec , Andrzej Pelc, Deterministic computations on a PRAM with static processor and memory faults, Fundamenta Informaticae, v.55 n.3-4, p.285-306, June 2003
Lihao Xu, Hydra: a platform for survivable and secure data storage systems, Proceedings of the 2005 ACM workshop on Storage security and survivability, November 11-11, 2005, Fairfax, VA, USA
Gopalan Sivathanu , Charles P. Wright , Erez Zadok, Ensuring data integrity in storage: techniques and applications, Proceedings of the 2005 ACM workshop on Storage security and survivability, November 11-11, 2005, Fairfax, VA, USA
Sheng Zhong , Yang Richard Yang, Verifiable distributed oblivious transfer and mobile agent security, Mobile Networks and Applications, v.11 n.2, p.201-210, April 2006
Arvind Narayanan , K. Srinathan , C. Pandu Rangan, Perfectly reliable message transmission, Information Processing Letters, v.100 n.1, p.23-28, 16 October 2006
Cheng Huang , Lihao Xu, STAR: an efficient coding scheme for correcting triple storage node failures, Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies, p.15-15, December 13-16, 2005, San Francisco, CA
Cunsheng Ding , Arto Salomaa, Secret Sharing Schemes with Nice Access Structures, Fundamenta Informaticae, v.73 n.1,2, p.51-63, April 2006
Ross Anderson , Cunsheng Ding , Tor Helleseth , Torleiv Klove, How to Build Robust Shared Control Systems, Designs, Codes and Cryptography, v.15 n.2, p.111-124, Nov. 1998
Ari Juels , Ravikanth Pappu , Bryan Parno, Unidirectional key distribution across time and space with applications to RFID security, Proceedings of the 17th conference on Security symposium, p.75-90, July 28-August 01, 2008, San Jose, CA
Phillip Rogaway , Mihir Bellare, Robust computational secret sharing and a unified account of classical secret-sharing goals, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA
Lein Harn , Changlu Lin, Detection and identification of cheaters in (t, n) secret sharing scheme, Designs, Codes and Cryptography, v.52 n.1, p.15-24, July 2009

INDEX TERMS

Primary Classification:
  E. Data
  E.3 DATA ENCRYPTION

Additional Classification:
  H. Information Systems
  H.1 MODELS AND PRINCIPLES


General Terms:
Algorithms, Documentation, Security


Keywords:
Reed-Solomon codes, cryptography, interpolation, key management, privacy, secret sharing systems

Collaborative Colleagues:
R. J. McEliece: colleagues
D. V. Sarwate: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player