Show simple item record

dc.contributor.authorTaher, Peyman
dc.date.accessioned2014-04-15T18:33:17Z
dc.date.available2014-04-15T18:33:17Z
dc.date.issued2010-07-01
dc.identifier.urihttps://hdl.handle.net/11244/8253
dc.description.abstractProviding anonymous communication on networks of interconnected computers is an active area of research which aims to enhance the privacy of the users of such networks. Communication unobservability is a stronger property compared to anonymity that attempts to guarantee that the adversaries will not even notice that a communication between a sender and a receiver is happening. In networks where an active global adversary may be present, it is assumed that at all times, all nodes in the network are potentially being monitored and also that at any time, any node should be treated as a possible adversary. This thesis work introduces a set of requirements which, if followed in any system, provides enhanced anonymous communication. Furthermore, following these requirements, a new anonymous networking system was designed. This system provides communication unobservability in the presence of active global adversaries through randomized routing and unpredictable aging. Randomized routing is used to obfuscate the message routing pattern and the communication path, and unpredictable aging is used to prevent indefinite postponement of messages when routing randomly.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titleApproaching Communication Unobservability Through Randomized Routing and Unpredictable Aging
dc.typetext
osu.filenameTaher_okstate_0664M_10983.pdf
osu.collegeArts and Sciences
osu.accesstypeOpen Access
dc.description.departmentComputer Science Department
dc.type.genreThesis
dc.subject.keywordsactive global adversary
dc.subject.keywordsanonymous communication
dc.subject.keywordsrandomized routing
dc.subject.keywordsunpredictable aging


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record