Show simple item record

dc.contributor.authorDavoudi, Anahita
dc.date.accessioned2016-01-28T18:03:42Z
dc.date.available2016-01-28T18:03:42Z
dc.date.submittedJanuary 2012
dc.identifier.otherDISS-11879
dc.identifier.urihttp://hdl.handle.net/10106/25522
dc.description.abstractAn improvement in preventing information leak attacks has been proposed by enhancing the path building process using pair of nodes obtained from lookups done by each initiator randomly. Using a pool of pairs locally produced for each initiator by random lookups done by that node; improves anonymity for the circuit initiator. The percentages of how many pools each pair belongs to, availability of each pair, and number of circuit attempts are analyzed for different number of both pool size and redundancy level. With these modifications and additions, the performance of the system has improved against the Conventional Continuous Stage Attack, and the probability of success for the Bridging an Honest First Stage Attack has been decreased. For the improved Salsa system with certain values for redundancy level and percentage of malicious nodes, this probability is significantly reduced comparing to the original Salsa system. The third type of attack studied here, the Bridging an Honest Stage Attack, was shown not to be affected by the implemented modifications in the design of the system.
dc.description.sponsorshipWright, Matthew
dc.language.isoen
dc.publisherElectrical Engineering
dc.titleCircuit Pools: Preventive Information Leak Attacks In Salsa Through Cached Lookups
dc.typeM.S.
dc.contributor.committeeChairWright, Matthew
dc.degree.departmentElectrical Engineering
dc.degree.disciplineElectrical Engineering
dc.degree.grantorUniversity of Texas at Arlington
dc.degree.levelmasters
dc.degree.nameM.S.


Files in this item

Thumbnail


This item appears in the following Collection(s)

Show simple item record