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 "methodologies for quantifying re randomization security and timing under jit rop"):
  Abstract: Just-in-time return-oriented programming (JIT-ROP) technique allows one to dynamically discover instruction pages and launch code reuse attacks, effectively bypassing most fine-grained address space layout randomization (ASLR) protection. However, in-depth questions regarding the impact of code (re-)randomization on code reuse attacks have not been studied. For example, how would one compute the re-randomization interval effectively by considering the speed of gadget convergence to defeat JIT-ROP attacks?; how do starting pointers in JIT-ROP impact gadget availability and time of gadget convergence?; what impact do fine-grained code randomizations have on the Turing-complete expressive power of JIT-ROP payloads? We conduct a comprehensive measurement study on the effectiveness of fine-grained code randomization schemes, with 5 tools, 20 applications including 6 browsers, 1 browser engine, and 25 dynamic libraries. We provide methodologies to measure JIT-ROP gadget availability, quality, and their Turing-complete expressiveness, as well as to empirically determine the upper bound of re-randomization intervals in re-randomization schemes. Experiments show that the locations of leaked pointers used in JIT-ROP attacks have no impacts on gadget availability, but have an impact on the time for accumulating the Turing-complete gadget set. The time ranges from around 0.89 to 5 seconds in our tested applications. Our results also show that instruction-level single-round code randomization thwarts current gadget finding techniques under the JIT-ROP threat model.

Includes members:
  Member "is less really more towards better metrics for measuring security improvements realized through software debloating":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "carve practical security focused software debloating using simple feature set mappings")
  Member "on the effectiveness of type based control flow integrity":
    also connected through other hyperedges:
      (none)
  Member "automatic heap layout manipulation for exploitation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a review of machine learning applications in fuzzing")
  Member "block oriented programming automating data only attacks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using name confusion to enhance security")
  Member "control flow integrity precision security and performance":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using name confusion to enhance 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)