605 research outputs found
Uncertainty Quantification of Collaborative Detection for Self-Driving
Sharing information between connected and autonomous vehicles (CAVs)
fundamentally improves the performance of collaborative object detection for
self-driving. However, CAVs still have uncertainties on object detection due to
practical challenges, which will affect the later modules in self-driving such
as planning and control. Hence, uncertainty quantification is crucial for
safety-critical systems such as CAVs. Our work is the first to estimate the
uncertainty of collaborative object detection. We propose a novel uncertainty
quantification method, called Double-M Quantification, which tailors a moving
block bootstrap (MBB) algorithm with direct modeling of the multivariant
Gaussian distribution of each corner of the bounding box. Our method captures
both the epistemic uncertainty and aleatoric uncertainty with one inference
pass based on the offline Double-M training process. And it can be used with
different collaborative object detectors. Through experiments on the
comprehensive collaborative perception dataset, we show that our Double-M
method achieves more than 4X improvement on uncertainty score and more than 3%
accuracy improvement, compared with the state-of-the-art uncertainty
quantification methods. Our code is public on
https://coperception.github.io/double-m-quantification.Comment: 6 pages, 3 figure
Entropy-based collaborative detection of DDOS attacks on community networks
A community network often operates with the same Internet service provider domain or the virtual network of different entities who are cooperating with each other. In such a federated network environment, routers can work closely to raise early warning of DDoS attacks to void catastrophic damages. However, the attackers simulate the normal network behaviors, e.g. pumping the attack packages as poisson distribution, to disable detection algorithms. It is an open question: how to discriminate DDoS attacks from surge legitimate accessing. We noticed that the attackers use the same mathematical functions to control the speed of attack package pumping to the victim. Based on this observation, the different attack flows of a DDoS attack share the same regularities, which is different from the real surging accessing in a short time period. We apply information theory parameter, entropy rate, to discriminate the DDoS attack from the surge legitimate accessing. We proved the effectiveness of our method in theory, and the simulations are the work in the near future. We also point out the future directions that worth to explore in the future.<br /
Building Regular Registers with Rational Malicious Servers and Anonymous Clients
The paper addresses the problem of emulating a regular register in a synchronous distributed system where clients invoking and operations are anonymous while server processes maintaining the state of the register may be compromised by rational adversaries (i.e., a server might behave as rational malicious Byzantine process). We first model our problem as a Bayesian game between a client and a rational malicious server where the equilibrium depends on the decisions of the malicious server (behave correctly and not be detected by clients vs returning a wrong register value to clients with the risk of being detected and then excluded by the computation). We prove such equilibrium exists and finally we design a protocol implementing the regular register that forces the rational malicious server to behave correctly
Poseidon: Mitigating Interest Flooding DDoS Attacks in Named Data Networking
Content-Centric Networking (CCN) is an emerging networking paradigm being
considered as a possible replacement for the current IP-based host-centric
Internet infrastructure. In CCN, named content becomes a first-class entity.
CCN focuses on content distribution, which dominates current Internet traffic
and is arguably not well served by IP. Named-Data Networking (NDN) is an
example of CCN. NDN is also an active research project under the NSF Future
Internet Architectures (FIA) program. FIA emphasizes security and privacy from
the outset and by design. To be a viable Internet architecture, NDN must be
resilient against current and emerging threats. This paper focuses on
distributed denial-of-service (DDoS) attacks; in particular we address interest
flooding, an attack that exploits key architectural features of NDN. We show
that an adversary with limited resources can implement such attack, having a
significant impact on network performance. We then introduce Poseidon: a
framework for detecting and mitigating interest flooding attacks. Finally, we
report on results of extensive simulations assessing proposed countermeasure.Comment: The IEEE Conference on Local Computer Networks (LCN 2013
- …