nach oben

Erschienen in:

2020 | OriginalPaper | Buchkapitel

11. Cryptographic Games

verfasst von : Stefan Rass, Stefan Schauer, Sandra König, Quanyan Zhu

Erschienen in: Cyber-Security in Critical Infrastructures

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The term “game” has substantially different meanings within the security area, depending on whether we speak about cryptographic security in particular, or system security in a more general setting that includes quantitative security with help of game theory. Game theory and cryptography are, however, of mutual value for each other, since game theory can help designing self-enforcing security of cryptographic protocols, and cryptography contributes invaluable mechanisms to implement games for security. This chapter introduces both ideas, being rational cryptography for the design of protocols that use rationality to incentivize players to follow faithfully, but also addresses the classical security goals like confidentiality, integrity, availability and authenticity by describing security games with quantitative and unconditional security guarantees. The chapter closes with a connection between network design for security and the P/NP question whose discovery is made with help from game theory.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Defense-in-Depth-Games

Nächstes Kapitel Practicalities

Alwen J, Cachin C, Nielsen JB, Pereira O, Sadeghi AR, Schomakers B, Shelat A, Visconti I (2007) D.PROVI.7 summary report on rational cryptographic protocols (01 Jan 2007), Mar

Ashwin Kumar M, Goundan PR, Srinathan K, Pandu Rangan C (2002) On perfectly secure communication over arbitrary networks. In: PODC ’02: proceedings of the twenty-first annual symposium on principles of distributed computing. ACM, New York, pp 193–202. https://doi.org/10.1145/571825.571858 MATHCrossRef

Buchmann J, Ding J (eds) (2008) Post-quantum cryptography. Lecture notes in computer science 5299. Springer, Cham

Campanelli M, Gennaro R (2017) Efficient rational proofs for space bounded computations. In: Rass S, An B, Kiekintveld C, Fang F, Schauer S (eds) Decision and game theory for security, pp 53–73. Springer International Publishing, ChamMATHCrossRef

Carter JL, Wegman MN (1981) Universal classes of hashing functions. J Comput Syst Sci 22:265–279MATHCrossRef

Chunduri U, Clemm A, Li R (2018) Preferred path routing – a next-generation routing framework beyond segment routing. In: 2018 IEEE global communications conference (GLOBECOM), pp 1–7. IEEE, Abu Dhabi. https://doi.org/10.1109/GLOCOM.2018.8647410. https://ieeexplore.ieee.org/document/8647410/

Dijk M, Juels A, Oprea A, Rivest RL (2013) FlipIt: the game of stealthy takeover. J Cryptol 26(4):655–713. https://doi.org/10.1007/s00145-012-9134-5 MathSciNetMATHCrossRef

Elliott C, Colvin A, Pearson D, Pikalo O, Schlafer J, Yeh H (2005) Current status of the DARPA quantum network. ArXiv:quant-ph/0503058v2

Fitzi M, Franklin MK, Garay J, Vardhan SH (2007) Towards optimal and efficient perfectly secure message transmission. In: TCC, LNCS, vol 4392. Springer, pp 311–322

10.

Fortnow L (2009) The status of the P versus NP problem. Commun ACM 52(9):78. https://doi.org/10.1145/1562164.1562186. http://portal.acm.org/citation.cfm?doid=1562164.1562186

11.

Garay J, Katz J, Maurer U, Tackmann B, Zikas V (2013) Rational protocol design: cryptography against incentive-driven adversaries. In: 2013 IEEE 54th annual symposium on foundations of computer science. IEEE, Piscataway, pp 648–657. https://doi.org/10.1109/FOCS.2013.75 CrossRef

12.

Gennaro R, Rabin MO, Rabin T (1998) Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the seventeenth annual ACM symposium on principles of distributed computing. ACM, New York, pp 101–111. https://doi.org/10.1145/277697.277716 CrossRef

13.

Ghazvini M, Movahedinia N, Jamshidi K, Szolnoki A (2013) GTXOP: a game theoretic approach for QoS provisioning using transmission opportunity tuning. PLoS ONE 8(5):e62925. https://doi.org/10.1371/journal.pone.0062925 CrossRef

14.

Giry D (2018) BlueCrypt – cryptographic key length recommendation. http://www.keylength.com/. Retrieved 29 May 2018

15.

Goldreich O (2003) Foundations of cryptography 1, 2. Cambridge University Press, Cambridge

16.

Goldreich O, Goldwasser S (1998) On the possibility of basing cryptography on the assumption that P=NP (01 Jan 1998)

17.

Gordon SD, Katz J (2006) Rational secret sharing, revisited. In: de Prisco R, Yung M (eds) Security and cryptography for networks. Lecture notes in computer science, vol 4116, pp 229–241. Springer-Verlag GmbH, Berlin/Heidelberg. https://doi.org/10.1007/11832072_16 CrossRef

18.

Helleseth T, Johansson T (1996) Universal hash functions from exponential sums over finite fields and Galois rings. In: Advances in cryptology CRYPTO ’96. Springer, Berlin, pp 31–44CrossRef

19.

Kawachi A, Okamoto Y, Tanaka K, Yasunaga K (2013) General constructions of rational secret sharing with expected constant-round reconstruction. Cryptology ePrint Archive, Report 2013/874. https://eprint.iacr.org/2013/874

20.

Kim S (2014) Game theory applications in network design. Premier reference source. Information Science Reference/IGI Global, Hershey. http://dx.doi.org/10.4018/978-1-4666-6050-2

21.

Koblitz N (2007) The uneasy relationship between mathematics and cryptography. Not AMS 54(8):972–979. Paper and follow-ups available at http://cacr.uwaterloo.ca/~ajmeneze/anotherlook/ams.shtml. Retrieved on 29 May 2018

22.

Kodialam M, Lakshman TV (2003) Detecting network intrusions via sampling: a game theoretic approach. In: IEEE INFOCOM, vol 3. San Francisco, pp 1880–1889

23.

McElice RJ, Sarwate DV (1981) On sharing secrets and reed-solomon codes. Commun ACM 24(9):583–584MathSciNetCrossRef

24.

Menezes A, van Oorschot PC, Vanstone SA (1997) Handbook of applied cryptography. CRC Press LLC, Boca RatonMATH

25.

Michiardi P, Molva R Game theoretic analysis of security in mobile ad hoc networks (01 Jan 2002)

26.

Nevelsteen W, Preneel B (1999) Software performance of universal hash functions. In: EUROCRYPT’99, LNCS 1592. Springer, pp 24–41

27.

Patra A, Choudhury A, Rangan CP, Srinathan K (2010) Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. Int J Appl Cryptol 2(2):159–197. https://doi.org/10.1504/IJACT.2010.038309 MathSciNetMATHCrossRef

28.

Previdi S, Horneffer M, Litkowski S, Filsfils C, Decraene B, Shakir R (2016) Source packet routing in networking (SPRING) problem statement and requirements. https://tools.ietf.org/html/rfc7855

29.

Rabin T, Ben-Or M (1989) Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the twenty-first annual ACM symposium on theory of computing, STOC ’89. ACM, New York, pp 73–85

30.

Rass S (2013) On game-theoretic network security provisioning. Springer J Netw Syst Manag 21(1):47–64. https://doi.org/10.1007/s10922-012-9229-1. http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s10922-012-9229-1

31.

Rass S (2014) Complexity of network design for private communication and the P-vs-NP question. Int J Adv Comput Sci Appl 5(2):148–157

32.

Rass S, König S (2012) Turning quantum cryptography against itself: how to avoid indirect eavesdropping in quantum networks by passive and active adversaries. Int J Adv Syst Meas 5(1 & 2):22–33

33.

Rass S, Rainer B, Vavti M, Göllner J, Peer A, Schauer S (2015) Secure communication over software-defined networks. Mob Netw Appl 20(1):105–110. https://doi.org/10.1007/s11036-015-0582-7 CrossRef

34.

Rass S, Schartner P (2010) Multipath authentication without shared secrets and with applications in quantum networks. In: Proceedings of the international conference on security and management (SAM), vol 1. CSREA Press, pp 111–115

35.

Rass S, Schartner P (2011) Information-leakage in hybrid randomized protocols. In: Lopez J, Samarati P (eds) Proceedings of the international conference on security and cryptography (SECRYPT). SciTePress – Science and Technology Publications, pp 134–143

36.

Rass S, Schartner P (2011) A unified framework for the analysis of availability, reliability and security, with applications to quantum networks. IEEE Trans Syst Man Cybern Part C Appl Rev 41(1):107–119. https://doi.org/10.1109/TSMCC.2010.2050686 CrossRef

37.

Rass S, Schartner P (2016) On the security of a universal cryptocomputer the chosen instruction attack. IEEE Access 1. https://doi.org/10.1109/ACCESS.2016.2622724

38.

Rass S, Slamanig D (2013) Cryptography for security and privacy in cloud computing. Artech House, Boston

39.

Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613MathSciNetMATHCrossRef

40.

Shor PW, Preskill J (2000) Simple proof of security of the BB84 quantum key distribution protocol. Phys Rev Lett 85:441–444CrossRef

41.

Shoup V (2004) Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332. http://eprint.iacr.org/

42.

Tompa M, Woll H (1988) How to share a secret with cheaters. J Cryptol 1(2):133–138MathSciNetMATH

43.

Wang Y, Desmedt Y (2008) Perfectly secure message transmission revisited. IEEE Trans Inf Theory 54(6):2582–2595MathSciNetMATHCrossRef

Titel: Cryptographic Games
verfasst von: Stefan Rass
Stefan Schauer
Sandra König
Quanyan Zhu
Verlag: Springer International Publishing
Buch: Cyber-Security in Critical Infrastructures
Print ISBN: 978-3-030-46907-8

Electronic ISBN: 978-3-030-46908-5

Copyright-Jahr: 2020
DOI: https://doi.org/10.1007/978-3-030-46908-5_11

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner