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 "parametric timed model checking for guaranteeing timed opacity"):
  Abstract: Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage is the ability for an attacker to deduce internal information depending on the system execution time. We address the following problem: given a timed system, synthesize the execution times for which one cannot deduce whether the system performed some secret behavior. We solve this problem in the setting of timed automata (TAs). We first provide a general solution, and then extend the problem to parametric TAs, by synthesizing internal timings making the TA secure. We study decidability, devise algorithms, and show that our method can also apply to program analysis.

Includes members:
  Member "what s decidable about parametric timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consistency in parametric interval probabilistic timed automata")
  Member "eliminating timing side channel leaks using program repair":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a compiler assisted scheduler for detecting and mitigating cache based side channel attacks")
  Member "adversarial symbolic execution for detecting concurrency related cache timing leaks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "specusym speculative symbolic execution for cache timing leak detection")
  Member "canal a cache timing analysis framework via llvm transformation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "specusym speculative symbolic execution for cache timing leak detection")
  Member "better abstractions for timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "automated synthesis of local time requirement for service composition")
  Member "control and synthesis of non interferent timed systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of synchronous notions of information flow security")

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)