z-logo
open-access-imgOpen Access
Pervasive Random Beacon in the Internet for Covert Coordination
Author(s) -
Hui Huang Lee,
EeChien Chang,
Mun Choon Chan
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-29039-7
DOI - 10.1007/11558859_5
Subject(s) - computer science , covert , computer security , denial of service attack , the internet , computer network , database transaction , distributed computing , world wide web , database , philosophy , linguistics
A random beacon periodically outputs a random number and was introduced by Rabin [12] 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom