Mitigating Sybil Attack in Self-Destructing Data System

Bhavya Alankar, Mohd. Saif

Abstract


Abstract: Data privacy is an important concern in the digital computing environment. Personal data which is stored on the server may contain account numbers, passwords and other important information which can be theft and misused. Self-Destructing data therefore,is an important idea to have reliability over digital communication. Self-Destructing data provides data privacy by making all the copies of file unreadable after user specified time and that too without user’s intervention. Most of the present Self-Destructing data models are prone to the Sybil attack.Thus this paper aims at proposing a solution to mitigate the Sybil attack on the self-destructing data systems.

Keywords


privacy; self-destruct data; Sybil attack; identity management.

Full Text:

PDF

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.




DOI: https://doi.org/10.26483/ijarcs.v8i5.3339

Refbacks

  • There are currently no refbacks.


Bookmark and Share


Copyright (c) 2017 International Journal of Advanced Research in Computer Science