Mitigating Sybil Attack in Self-Destructing Data System
Main Article Content
Abstract
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
. Geambasu, T. Kohno, A. Levy, and H. M. Levy. Vanish:Increasing data privacy with self destructing data. In USENIX Security, pages 299–314, 2009.
U. Feige, A. Fiat, A. Shamir, “Zero-Knowledge Proofs of Identityâ€, Journal of Cryptology 1 (2), 1988, pp. 77-94.
A. Fiat, A. Shamir, “How to Prove Yourself: Practical Solutions of Identification and Signature Problemsâ€, Crypto ’86, 1987, pp. 186-194.
K. Ohta, T. Okamoto, “A Modification to the FiatShamir Schemeâ€, Crypto ’88, 1990, pp. 232-243.
A. Shamir, “An Efficient Identification Scheme Based on Permuted Kernelsâ€,Crypto ’89, 1990, pp. 606-609.
J. S. Donath, “Identity and Deception in the Virtual Communityâ€, Communities in Cyberspace, Routledge, 1998.
S. Turkle, Life on the Screen: Identity in the Age of the Internet, Simon & Schuster, 1995.
C. Ellison, “Establishing Identity Without Certification Authoritiesâ€, 6th USENIX Security Symposium, 1996, pp. 67-76.
P. Zimmerman, PGP User’s Guide, MIT, 1994.
J. R. Douceur. The Sybil attack. In IPTPS ’01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 251–260, 2002.
S. Wolchok, O. S. Hofmann, N. Heninger, E. W. Felten, J. A. Halderman, C. J. Rossbach, B. Waters, and E. Witchel, “Defeating vanish with low-cost Sybil attacks against large DHEs,†in Proc. Network and Distributed System Security Symp., 2010.
Azureus, 2010 [Online]. Available: http://www.vuze.com/
Anderson,J. Computer Security Threat Monitoring and Surveillance. Fort Washington,PA: James P.Anderson Co.,April 1980.
M. J. Freedman and R. Morris. Tarzan: A peer-to-peer anonymizing network layer. In Proc. ACM CCS, Nov. 2002.
P. Judge. .Net vote rigging illustrates importance of Web services. http://news.zdnet.co.uk/software/0,1000000121, 2102244,00.htm.
M. Yurkewych, B. N. Levine, and A. L. Rosenberg. On the cost-ineffectiveness of redundancy in commercial P2P computing. In CCS, pages 280–288, 2005.
A. Cheng and E. Friedman. Sybilproof reputation mechanisms. In P2PECON: ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems, pages 128–132, 2005.
K. S. Bauer, D. McCoy, D. Grunwald, T. Kohno, and D. C. Sicker. Low-resource routing attacks against Tor. In WPES, pages 11–20, 2007.