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 "dfssd deep faults and shallow state duality a provably strong obfuscation solution for circuits with restricted access to scan chain"):
  Abstract: In this paper, we introduce DFSSD, a novel logic locking solution for sequential and FSM circuits with a restricted (locked) access to the scan chain. DFSSD combines two techniques for obfuscation: (1) Deep Faults, and (2) Shallow State Duality. Both techniques are specifically designed to resist against sequential SAT attacks based on bounded model checking. The shallow state duality prevents a sequential SAT attack from taking a shortcut for early termination without running an exhaustive unbounded model checker to assess if the attack could be terminated. The deep fault, on the other hand, provides a designer with a technique for building deep, yet key recoverable faults that could not be discovered by sequential SAT (and bounded model checker based) attacks in a reasonable time.

Includes members:
  Member "sat hard cyclic logic obfuscation for protecting the ip in the manufacturing supply chain":
    also connected through other hyperedges:
      (none)
  Member "functional analysis attacks on logic locking":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sat hard cyclic logic obfuscation for protecting the ip in the manufacturing supply chain")
  Member "is robust design for security robust enough attack on locked circuits with restricted scan chain access":
    also connected through other hyperedges:
      (none)
  Member "coma communication and obfuscation management architecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sat hard cyclic logic obfuscation for protecting the ip in the manufacturing supply chain")
  Member "threats on logic locking a decade later":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sat hard cyclic logic obfuscation for protecting the ip in the manufacturing supply chain")
  Member "benchmarking the capabilities and limitations of sat solvers in defeating obfuscation schemes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sat hard cyclic logic obfuscation for protecting the ip in the manufacturing supply chain")
  Member "lut lock a novel lut based logic obfuscation for fpga bitstream and asic hardware protection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sat hard cyclic logic obfuscation for protecting the ip in the manufacturing supply chain")
  Member "encrypt flip flop a novel logic encryption technique for sequential circuits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "is robust design for security robust enough attack on locked circuits with restricted scan chain access")

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)