Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary




Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Source Anonymity using multiple mixes in Packet Scheduling

Mrs.S.Suganyadevi , Mrs.Dr.V.Anuratha , , ,
Affiliations

:


Abstract
Secret communication, where users converse without revealing the personalities of communicating parties or the trails of data stream is critical in data networks. On the Internet, Chaum mixes, intermediate nodes, or proxy servers, which use coated encryption and packet shuffling techniques to hide source identities, are used to provide anonymity to network users. In this analysis, an information theoretic structure is developed to study the maximum anonymity possible by packet shuffling when the merges are memory restricted—in other words, they can store a finite number of packets. Network of mixes over receiving packet sources from an eavesdropper’s perspective as the measure of secrecy, the maximum achievable secrecy of a single mix with buffer size b (packets which contains the source and destination details of itself ) serving for achieving multiple mixes (network of mixes). By obtaining network of mixes the source anonymity is achieved successfully. For a general multiuser system, the maximum anonymity as buffer size b→∞ is shown to approach the entropy of the source arrival probabilities at a convergence rate no less significant than 1/b2. When the arrival probabilities of the general multiuser system can be expressed as a rational portion k/2n for some fixed n, this union rate is shown to be achievable. The secrecy analysis is extended to a common network of mixes linking the sources to multi destination, where the source secrecy achievable on the target link is shown to be lower enclosed by a weighted sum of the secrecy achievable by each individual mix.


Citation
S.Suganyadevi, et al. "Source Anonymity using multiple mixes in Packet Scheduling”, International Journal of Computer Engineering In Research Trends, Volume 3, Issue 6, June-2016, pp. 332-335


Keywords :

References

   


DOI Link :

Download :
  V3I611.pdf


Refbacks :

Support Us


We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links



DOI:10.22362/ijcert


Science Central

Score: 13.30





Submit your paper to editorijcert@gmail.com