Abstract
The idea of infinite structures, even of continua, in information theory is not a new one [K056]. This note is devoted to infinite one-time pads [BL81] and an infinite projective geometric [BL79] threshold scheme. Perhaps an infinite structure can be better understood than its finite analog if it is amenable to investigation by methods from calculus or harmonic analysis. It is conceivable that an existing error control code, pool/split/restitute process [AS82], or cryptosystem can be better understood by examining an infinite version.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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, California (1982), pp. 156–169.
H. Bauer, Probability Theory and Elements of Measure Theory, Holt, Rinehart and Winston, New York (1969).
G. R. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies-Conference Proceedings, Vol. 48 (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, Long Beach, California (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 (1981), Los Angeles, California, pp. 75–82.
J. Bloom, A note on superfast threshold schemes, Preprint, Texas AM University, Department of Mathematics (1981), and Threshold schemes and error correcting codes, Astracts of Papers Presented to the American Mathematical Society, Vol. 2 (1981), p. 230.
D. E. R. Denning, Cryptography and Data Security, Addison Wesley, Reading, Massachusetts (1982).
P. Griffiths and J. Harris, Principles of Algebraic Geometry, Wiley-Interscience, New York (1978).
A. N. Kolmogorov, On the Shannon theory of information in the case of continuous signals, IEEE Transactions on Information Theory, Vol. IT-2 (1956), pp. 102–108, Reprinted as pages 238–244 in D. Slepian (editor), Key Papers in the Development of Information Theory, IEEE Press, New York (1974).
G. McCarty, Topology: An Introduction with Application to Topological Groups, McGraw-Hill, New York (1967).
C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28 (1949), pp. 656–715.
A. Shamir, How to share a secret, Communications of the ACM, vol. 22 (1979), pp. 612–613.
F. W. Warner, Foundations of Differentiable Manifolds and Lie Groups, Springer-Verlag, New York (1971).
P. B. Yale, Geometry and Symmetry, Holden-Day, San Francisco (1968).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this paper
Cite this paper
Blakley, G.R., Swanson, L. (1983). Infinite Structures in Information Theory. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0602-4_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0604-8
Online ISBN: 978-1-4757-0602-4
eBook Packages: Springer Book Archive