Denial-of-service (DoS) attacks pose an increasing threat to today’s Internet. One major difficulty to defend against Distributed Denial-of-service attack is that attackers often use fake, or spoofed IP addresses as the IP source address. Probabilistic packet marking algorithm (PPM), allows the victim to trace back the appropriate origin of spoofed IP source address to disguise the true origin....

Socialnet becomes an important component in real life, drawing a lot of study issues security and safety. Recently, for the features graph structure socialnet, adversarial attacks on node classification are exposed, automatic attack methods such as fast gradient (FGA) NETTACK developed per-node attacks, which can be utilized multinode sequential way. However, due to overlook perturbation influe...

The growing complexity of modern Cyber–Physical Systems (CPS) and the frequent communication between their components make them vulnerable to malicious attacks. As a result, secure state estimation is critical requirement for control these systems. Many existing methods suffer from combinatorial which grows with number states sensors in system. This can be mitigated using optimization-based tha...

This paper addresses how to perform cost-sensitive responses to routing attacks on (Mobile Ad Hoc Networks) MANET. There have been numerous research efforts on securing MANET protocols using cryptography or intrusion detection technique. However, little literature on MANET intrusion response is addressed. Most research on automated response for wired networks focuses on how to select the best r...

In [6], a new approach for certifying the correctness of program executions in hostile environments has been proposed. The authors presented probabilistic certification by massive attack detection through two algorithmsMCT and EMCT . The execution to certify is represented by a macro-dataflow graph which is used to randomly extract some tasks to be re-executed on safe resources in order to dete...

At Crypto-87 conference, we proposed identity-based key distribution systems for generating a common secret conference key for two or more users. Protocols were shown for three configurations: a ring, a complete graph, and a star. Yacobi has made an impersonation attack on the protocols for the complete graph and star networks. This paper proposes improved identity-based key distribution protoc...