Please use this identifier to cite or link to this item:
|Title:||Pervasive random beacon in the internet for covert coordination|
|Citation:||Lee, H.H.,Chang, E.-C.,Chan, M.C. (2006). Pervasive random beacon in the internet for covert coordination. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3727 LNCS : 53-61. ScholarBank@NUS Repository.|
|Abstract:||A random beacon periodically outputs a random number and was introduced by Rabin to secure remote transaction. We consider a random beacon that is pervasive in the sense that, it is available everywhere, and accesses to the beacon blends with normal activities. With a pervasive beacon, it is difficult to disrupt the beacon and detect accesses to it. As a result, the pervasiveness of the beacon can facilitate covert coordination, whereby a large collection of agents covertly decide on a common action. In this paper, we discuss the desirable properties of a pervasive random beacon which can be used for covert coordination, and describe how such a beacon can be found in the Internet based on major stock market indices closing values. We also investigate how such a covert coordination can be used, in particular, in coordinating distributed denial of service (DDoS) attacks. Finally, we explore ways to, in a limited manner, disrupt the beacon. © Springer-Verlag Berlin Heidelberg 2005.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.