Abstract
A k out of n p/s/r process [AS81] is a very efficient way to convey information (k words suffice to reclaim k words). But it provides virtually no cryptographic security for the information it deals with.
Chapter PDF
Similar content being viewed by others
References
C. A. Asmuth and G. R. Blakley, An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems, Computers and Mathematics with Applications, Vol. 7 (1981), pp. 447–450.
C. A. Asmuth and G. R. Blakley, Pooling, splitting and restituting information to overcome total failure of some channels of communication, Proceedings of the 1982 Symposium on Security and Privacy, IEEE Computer Society, Los Angeles, (1982), pp. 156–169.
C. Asmuth and J. Bloom, A modular approach to key safeguarding. IEEE Transactions on Information Theory, Vol. IT-30 (1983), pp. 208–210.
G. R. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies — Conference Proceedings, Vol. 48 (1979), AFIPS Press, Montvale, New Jersey (1979), pp. 313–317.
G. R. Blakley, One-time pads are key safeguarding schemes, not cryptosystems. Fast key safeguarding schemes (threshold schemes) exist, Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society, New York (1980), pp. 108–113.
G. R. Blakley and Laif Swanson, Security proofs for information protection systems, Proceedings of the 1981 Symposium on Security and Privacy, IEEE, Computer Society, New York (1981), pp. 75–88.
J. Bloom, A note on superfast threshold schemes, Preprint, Texas A&M University, Department of Mathematics (1981) and Threshold schemes and error correcting codes, Abstracts of Papers Presented to the American Mathematical Society, Vol. 2 (1981), p. 230.
G. R. Blakley, Protecting information against both destruction and unauthorized disclosure, Proceedings of the 1982 Carnahan Conference on Security Technology, University of Kentucky Press, (1982), pp. 123–133.
G. R. Blakley and L. Swanson, Infinite structures in information theory, in D. Chaum, R. L. Rivest and A. T. Sherman, Advances in Cryptology, Proceeding of Crypto’ 82, Plenum Press, New York (1983), pp. 39–50.
D. Chaum, Computer systems established, maintained, and trusted by mutually suspicious groups, Memorandum No. UCB/ERL/M79/10, UC Berkeley ERL (1979).
D. Chaum, Computer systems established, maintained and trusted by mutually suspicious groups, Ph.D. dissertation in Computer Science, UC Berkeley (1982).
G. I. Davida, R. A. DeMillo and R. J. Lipton, Protecting shared cryptographic keys, Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society, New York (1980), pp. 100–102.
D. E. R. Denning, Cryptography and Data Security, Addison-Wesley, Reading, Massachusetts (1980).
S. Harari, Secret sharing systems, in Secure Digital Communications, Edited by G. Longo, Springer-Verlag, Wien (1983), pp. 105–110.
K. Hoffman and R. Kunze, Linear Algebra, Second Edition, Prentice Hall, Englewood Cliffs, New Jersey (1971).
E. D. Karnin, J. W. Greene and M. E. Hellman, On secret sharing systems, Verbal presentation, Session 83 (Cryptography), 1981 IEEE International Symposium on Information Theory, Santa Monica, California, February 9–12 (1981), and On secret sharing systems, IEEE Transactions on Information Theory. Vol. IT-29 (1983), pp. 35–41.
A. G. Konheim, Cryptography: A Primer, Wiley-Interscience, New York (1981).
S. Kothari, On a Generalized Threshold Scheme, Proceedings of Crypto’ 84, Springer-Verlag, New York (1985).
R. Lidl and H. Niederreiter, Finite Fields, Vol. 20 of the Encyclopedia of Mathematics and its Applications, Addison-Wesley, Reading, Massachusetts (1983).
S. MacLane and G. Birkhoff, Algebra, MacMillan, New York, (1967).
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1978).
R. J. McEliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes, communications of the ACM, Vol. 24 (1981), pp. 583–584.
M. Mignotte, How to share a secret, in Cryptography, Edited by T. Beth, Springer-Verlag, Berlin (1983), pp. 371–375.
L. H. Ozarow and A. D. Wyner, Wire-tap channel, II, AT&T Bell Labs Technical Journal, vol. 63 (1984), to appear.
A. Shamir, How to share a secret, communications of the ACM, Vol. 22 (1979), pp. 612–613.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blakley, G.R., Meadows, C. (1985). Security of Ramp Schemes. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive