Abstract
There are two principal notions of security for cryptographic systems. For a few systems, they can be proven to have perfect secrecy against an opponent with unlimited computational power, in terms of information theory. However, the security of most systems, including public key cryptosystems, is based on complexity theoretic assumptions.
In both cases there is an implicit notion of average-case analysis. In the case of conditional security, the underlying assumption is usually average-case, not worst case hardness. And for unconditional security, entropy itself is an average case notion of encoding length.
Kolmogorov complexity (the size of the smallest program that generates a string) is a rigorous measure of the amount of information, or randomness, in an individual string x. By considering the time-bounded Kolmogorov complexity (program limited to run in time t(|x|)) we can take into account the computational difficulty of extracting information. We present a new notion of security based on Kolmogorov complexity. The first goal is to provide a formal definition of what it means for an individual instance to be secure. The second goal is to bridge the gap between information theoretic security, and computational security, by using time-bounded Kolmogorov complexity.
In this paper, we lay the groundwork of the study of cryptosystems from the point of view of security of individual instances by considering three types of information-theoretically secure cryptographic systems: cipher systems (such as the one-time pad), threshold secret sharing, and authentication schemes.
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
Blakley, G.R.: Safeguarding cryptographic keys. National Computer Conference Proceedings 48, 313–317 (1979)
Brickell, E.F.: A few results in message authentication. Congressus Numerantium 43, 141–154 (1984)
Chaitin, G.J.: On the length of programs for computing finite binary sequences. Journal of the ACM 13(4), 145–149 (1966)
Chaitin, G.J.: A theory of program size formally identical to Information theory. Journal of the ACM 22, 329–340 (1975)
Gács, P.: Lecture Notes on Descriptional Complexity and Randomness (1988), http://www.cs.bu.edu/faculty/gacs/papers/ait-notes.pdf
Grunwald, P., Vitányi, P.: Shannon Information and Kolmogorov Complexity (2004), http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0410002
Hartmanis, J.: Generalized kolmogorov complexity and the structure of feasible computations. In: Proceedings of the 24th IEEE Symposium on Foundations of Computing, pp. 439–445 (1983)
Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1(1), 1–7 (1965)
Lee, T., Romashchenko, A.E.: Resource bounded symmetry of information revisited. Theoretical Computer Science 345(2-3), 386–405 (2005)
Li, M., Vitányi, P.M.B.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Heidelberg (1997)
Orponen, P., Ko, K.-I., Schöning, U., Watanabe, O.: Instance Complexity. Journal of the ACM 41(1), 96–121 (1994)
Simmons, G.J.: Message authentication: a game on hypergraphs. Congressus Numerantium 45, 161–192 (1984)
Simmons, G.J.: Authentication theory/coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 411–431. Springer, Heidelberg (1985)
Shamir, A.: How to share a secret. Communications of the ACM 22(1), 612–613 (1979)
Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27, 379–423, 623–656 (1948)
Solomonoff, R.: A formal theory of inductive inference, part i. Information and Control 7(1), 1–22 (1964)
Stinson, D.R.: Combinatorial characterization of authentication codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 62–73. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antunes, L., Laplante, S., Pinto, A., Salvador, L. (2009). Cryptographic Security of Individual Instances. In: Desmedt, Y. (eds) Information Theoretic Security. ICITS 2007. Lecture Notes in Computer Science, vol 4883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10230-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-10230-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10229-5
Online ISBN: 978-3-642-10230-1
eBook Packages: Computer ScienceComputer Science (R0)