Gambling, Computational Information and Encryption Security

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9063)

Abstract

We revisit the question, originally posed by Yao (1982), of whether encryption security may be characterized using computational information. Yao provided an affirmative answer, using a compression-based notion of computational information to give a characterization equivalent to the standard computational notion of semantic security. We give two other equivalent characterizations. The first uses a computational formulation of Kelly’s (1957) model for “gambling with inside information”, leading to an encryption notion which is similar to Yao’s but where encrypted data is used by an adversary to place bets maximizing the rate of growth of total wealth over a sequence of independent, identically distributed events. The difficulty of this gambling task is closely related to Vadhan and Zheng’s (2011) notion of KL-hardness, which in certain cases is equivalent to a conditional form of the pseudoentropy introduced by Hastad et. al. (1999). Using techniques introduced to prove this equivalence, we are also able to give a characterization of encryption security in terms of conditional pseudoentropy. Finally, we will reconsider the gambling model with respect to “risk-neutral” adversaries in an attempt to understand whether assumptions about the rationality of adversaries may impact the level of security achieved by an encryption scheme.

Keywords

Kelly criterion KL-hardness computational entropy semantic security rational adversaries 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bellare, M., Tessaro, S., Vardy, A.: Semantic security for the wiretap channel. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 294–311. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  2. 2.
    Cesa-Bianchi, N., Lugosi, G.: Prediction, learning, and games. Cambridge University Press (2006)Google Scholar
  3. 3.
    Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley (2006)Google Scholar
  4. 4.
    Dodis, Y.: Shannon impossibility, revisited. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 100–110. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Freund, Y., Schapire, R.E.: Adaptive game playing using multiplicative weights. Games and Economic Behavior 29(1-2), 79–103 (1999)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Garay, J.A., Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Rational protocol design: Cryptography against incentive-driven adversaries. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, pp. 648–657 (2013)Google Scholar
  7. 7.
    Goldreich, O.: The Foundations of Cryptography. Basic Techniques, vol. 1. Cambridge University Press, Cambridge (2001)CrossRefGoogle Scholar
  8. 8.
    Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364–1396 (1999)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 169–186. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Kelly Jr., J.L.: A new interpretation of information rate. Bell System Technical Journal 35(4), 917–926 (1956)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Micali, S., Rackoff, C., Sloan, B.: The notion of security for probabilistic cryptosystems. SIAM J. Comput. 17(2), 412–426 (1988)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Pinto, A.: Comparing notions of computational entropy. Theory Comput. Syst. 45(4), 944–962 (2009)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28(4), 656–715 (1949)CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. Electronic Colloquium on Computational Complexity (ECCC) 18, 141 (2011)Google Scholar
  16. 16.
    Yao, A.C.-C.: Theory and applications of trapdoor functions (Extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 1982, November 3-5, pp. 80–91 (1982)Google Scholar
  17. 17.
    Yao, A.C.-C.: Computational information theory. In: Abu-Mostafa, Y.B. (eds.) Complexity in Information Theory, pp. 1–15. Springer (1988)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of VictoriaVictoriaCanada

Personalised recommendations