human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "information leakage games"):
  Abstract: We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a mixed strategy is a convex function of the distribution on the defender's pure actions, rather than the expected value of their utilities. Nevertheless, the important properties of game theory, notably the existence of a Nash equilibrium, still hold for our (zero-sum) leakage games, and we provide algorithms to compute the corresponding optimal strategies. As typical in (simultaneous) game theory, the optimal strategy is usually mixed, i.e., probabilistic, for both the attacker and the defender. From the point of view of information flow, this was to be expected in the case of the defender, since it is well known that randomization at the level of the system design may help to reduce information leaks. Regarding the attacker, however, this seems the first work (w.r.t. the literature in information flow) proving formally that in certain cases the optimal attack strategy is necessarily probabilistic.

Includes members:
  Member "quantitative information flow under generic leakage functions and adaptive adversaries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantifying information flow in interactive systems")
  Member "type based self stabilisation for computational fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "leakage and protocol composition in a game theoretic perspective")
  Member "security games with information leakage modeling and computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "leakage and protocol composition in a game theoretic perspective")
  Member "projection onto the probability simplex an efficient algorithm with a simple proof and an application":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a workload adaptive mechanism for linear queries under local differential privacy")
  Member "calibrating data to sensitivity in private data analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "locally private hypothesis selection")
  Member "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatial temporal moving target defense a markov stackelberg game model")
  Member "compositional closure for bayes risk in probabilistic noninterference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generating optimal privacy protection mechanisms via machine learning")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CR(Cryptography and Security)