On Sharing Secrets and Reed-Solomon Codes

Communications of the ACM

Volumn 24, Issue 9, 1981, Pages 583-584

  McEliece, R J ^a   Sarwate, D V ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

cryptography; interpolation; key management; privacy; Reed Solomon codes; secret sharing systems

Indexed keywords

DATA PROCESSING;

EID: 0019608784     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/358746.358762     Document Type: Article

References (11)

1. Knott, G.D. Hashing functions. The Computer Journal 18, 3 (1973) 265-278.
2. Knuth, D.E. The Art of Computer Programming. Addison- Wesley, Reading, Mass. 1973.
3. Lum, V. Y. General performance analysis of key-to-address transformation methods using an abstract file concept. Comm. ACM 16, 10 (Oct. 1973), 603.
4. Lum, V.Y., Yuen, P.S.T. and Dodd, M. Key-to-address transformation techniques. Comm. ACM 14, 4 (Apr. 1971) 228-239.
5. Martin, J. Data Base Organization. Prentice Hall, Englewood Cliffs, NJ, 1973.
6. Peterson, W.W. Addressing for random-access storage. IBM J. Res. Develop. 1, 2 (Apr. 1957), 130-146.
7. Quittner, P. and Kotsis, D. Comparison of different disk searching methods. Software Practice and Experience 8, 6 (Nov.-Dec. 1978) 673-679.
8. Quittner, P. Problems, Programs, Processing Results. Akademiai Kiado, Budapest, A. Hilger, Bristol, England 1977.
9. Quittner, P. and Kotsis, D. Vergleich von Datenzugriffsarten. Rechnentechnik und Datenverarbeitung 14, 31 (1977) 35.
10. Quittner, P. and Kotsis, D. Computing Science for Systems Analysis. Oour Institut za Organizaciju Poslavanja, Subotica, Pokrajinski Savot za Informatiku Novi Sad, 1976, and Akademiai Kiado, Budapest (to be published).
11. Renyi, A. Probability Theory, North Holland, Amsterdam, The Netherlands 1970.