17 results where keywords includes anonymity.
[All entries] This page as [Text] or [Bibtex]

  • @inproceedings{Levine:2017,
    Author = { Brian Neil Levine and Marc Liberatore and Brian Lynn and Matthew Wright},
    Booktitle = {Proceedings Third IEEE International Workshop on Privacy Engineering},
    Keywords = {security; forensics; peer-to-peer; anonymity; Child sexual exploitation},
    Month = {May},
    Pages = {25--32},
    Title = {{Statistical Detection of Downloaders in Freenet}},
    Url = {http://ceur-ws.org/Vol-1873/IWPE17_paper_12.pdf},
    Year = {2017},
    Bdsk-Url-1 = {http://ceur-ws.org/Vol-1873/IWPE17_paper_12.pdf}}

    [link][PDF]

  • @article{Bissias:2015,
    Author = { George Bissias and Brian Neil Levine and Marc Liberatore and Swagatika Prusty},
    Journal = {IEEE Transactions on Dependable and Secure Computing},
    Keywords = {forensics; peer-to-peer; anonymity; Journal Paper},
    Month = {Accepted for publication in},
    Sponsors = {CNS-1018615},
    Title = {{Forensic Identification of Anonymous Sources in OneSwarm}},
    Url = {http://forensics.umass.edu/pubs/bissias.tdsc.2015.pdf},
    Year = {2015},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/prusty.ccs.2011.pdf}}

    [link][PDF]

  • @inproceedings{Prusty:2011,
    Author = { Swagatika Prusty and Brian Neil Levine and Marc Liberatore},
    Booktitle = {Proc. ACM Conference on Computer \& Communications Security (CCS)},
    Keywords = {forensics; peer-to-peer; anonymity},
    Month = {October},
    Pages = {201--214},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/prusty.ccs.2011.slides.pdf},
    Sponsors = {CNS-1018615},
    Title = {{Forensic Investigation of the OneSwarm Anonymous Filesharing System}},
    Url = {http://forensics.umass.edu/pubs/prusty.ccs.2011.pdf},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/prusty.ccs.2011.pdf}}

    [link][PDF]

  • @article{Liberatore:2010a,
    Author = { Marc Liberatore and Bikas Gurung and Brian Neil Levine and Matthew Wright},
    Journal = {Elsevier Journal of Network and Computer Applications},
    Keywords = {privacy; anonymity; peer-to-peer; Journal Paper},
    Month = {January},
    Number = 1, Pages = {341-350},
    Title = {{Empirical Tests of Anonymous Voice Over IP}},
    Url = {http://forensics.umass.edu/pubs/liberatore.JCNA.2010.pdf},
    Volume = 34, Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/liberatore.JCNA.2010.pdf}}

    [link][PDF]

  • @article{Wright:2008,
    Author = {Wright, Matthew and Adler, Micah and Levine, Brian Neil and Shields, Clay},
    Journal = {ACM Transactions on Information and System Security (TISSEC)},
    Keywords = {anonymity; peer-to-peer;Journal Paper},
    Month = {May},
    Number = {2},
    Pages = {1--34},
    Sponsors = {EIA-0080119, ANI-0087482, ANI-0296194, and CNS-0549998, 2000-DT-CX-K001},
    Title = {{Passive-Logging Attacks Against Anonymous Communications Systems}},
    Url = {http://forensics.umass.edu/pubs/wright.tissec.2008.pdf},
    Volume = {11},
    Year = {2008},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/wright.tissec.2008.pdf}}

    [link][PDF]

  • @inproceedings{Margolin:2008,
    Author = {Margolin, N. Boris and Levine, Brian Neil},
    Booktitle = {Proc. Financial Cryptography and Data Security (FC)},
    Keywords = {Sybil attack; peer-to-peer; anonymity},
    Month = {January},
    Pages = {1--15},
    Sponsors = {NSF-0133055},
    Title = {{Quantifying Resistance to the Sybil Attack}},
    Url = {http://forensics.umass.edu/pubs/margolin.fc08.pdf},
    Year = {2008},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/margolin.fc08.pdf}}

    [link][PDF]

  • @inproceedings{Margolin:2007,
    Abstract = {We propose an economic approach to Sybil attack detection. In our Informant protocol, a detective offers a reward for Sybils to reveal themselves. The detective accepts from one identity a security deposit and the name of target peer; the deposit and a reward are given to the target. We prove the optimal strategy for the informant is to play the game if and only if she is Sybil with a low opportunity cost, and the target will cooperate if and only if she is identical to the informant. Informant uses a Dutch auction to find the minimum possible reward that will reveal a Sybil attacker. Because our approach is economic, it is not limited to a specific application and does not rely on a physical device or token.},
    Author = {Margolin, N. Boris and Levine, Brian Neil},
    Booktitle = {Proc. Financial Cryptography and Data Security (FC)},
    Keywords = {Sybil attack; peer-to-peer; anonymity},
    Month = {February},
    Pages = {192--207},
    Presentation_Url = {http://forensics.umass.edu/pubs/margolin.FC.2007.slides.pdf},
    Sponsors = {NSF-0133055},
    Techreport_Url = {http://forensics.umass.edu/pubs/margolin.informant.tr.2006.pdf},
    Title = {{Informant: Detecting Sybils Using Incentives}},
    Url = {http://forensics.umass.edu/pubs/margolin.FC.2007.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/margolin.FC.2007.pdf}}

    [link][PDF]

  • @techreport{Levine:2006,
    Abstract = {Many security mechanisms are based on specific assumptions of identity and are vulnerable to attacks when these assumptions are violated. For example, impersonation is the well-known consequence when authenticating credentials are stolen by a third party. Another attack on identity occurs when credentials for one identity are purposely shared by multiple individuals, for example to avoid paying twice for a service. In this paper, we survey the impact of the Sybil attack, an attack against identity in which an individual entity masquerades as multiple simultaneous identities. The Sybil attack is a fundamental problem in many systems, and it has so far resisted a universally applicable solution.},
    Address = {Amherst, MA},
    Author = {Levine, Brian Neil and Shields, Clay and Margolin, N. Boris},
    Institution = {University of Massachusetts Amherst},
    Keywords = {Sybil attack; peer-to-peer;security; anonymity},
    Month = {October},
    Number = {2006-052},
    Sponsors = {NSF-0133055},
    Title = {{A Survey of Solutions to the Sybil Attack}},
    Type = {Tech report},
    Url = {http://forensics.umass.edu/pubs/levine.sybil.tr.2006.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/levine.sybil.tr.2006.pdf}}

    [link][PDF]

  • @inproceedings{Liberatore:2006,
    Abstract = {We examine the effectiveness of two traffic analysis techniques for identifying encrypted HTTP streams. The techniques are based upon classification algorithms, identifying encrypted traffic on the basis of similarities to features in a library of known profiles. We show that these profiles need not be collected immediately before the encrypted stream; these methods can be used to identify traffic observed both well before and well after the library is created. We give evidence that these techniques will exhibit the scalability necessary to be effective on the Internet. We examine several methods of actively countering the techniques, and we find that such countermeasures are effective, but at a significant increase in the size of the traffic stream. Our claims are substantiated by experiments and simulation on over 400,000 traffic streams we collected from 2,000 distinct web sites during a two month period.},
    Author = {Liberatore, Marc and Levine, Brian Neil},
    Booktitle = {Proc. ACM conference on Computer and Communications Security (CCS)},
    Keywords = {security; privacy; anonymity; forensics},
    Month = {October},
    Pages = {255--263},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/liberatore.ccs2006.slides.pdf},
    Sponsors = {NSF-0133055 and NSF-0325868},
    Title = {{Inferring the Source of Encrypted HTTP Connections}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/liberatore.ccs2006.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/liberatore.ccs2006.pdf}}

    [link][PDF]

  • @inproceedings{Bissias:2005,
    Abstract = {Encrypting traffic does not prevent an attacker from performing some types of traffic analysis. We present a straightforward traffic analysis attack against encrypted HTTP streams that is surprisingly effective in identifying the source of the traffic. An attacker starts by creating a profile of the statistical characteristics of web requests from interesting sites, including distributions of packet sizes and inter-arrival times. Later, candidate encrypted streams are compared against these profiles. In our evaluations using real traffic, we find that many web sites are sub ject to this attack. With a training period of 24 hours and a 1 hour delay afterwards, the attack achieves only 23% accuracy. However, an attacker can easily pre-determine which of trained sites are easily identifiable. Accordingly, against 25 such sites, the attack achieves 40% accuracy; with three guesses, the attack achieves 100% accuracy for our data. Longer delays after training decrease accuracy, but not substantially. We also propose some countermeasures and improvements to our current method. Previous work analyzed SSL traffic to a proxy, taking advantage of a known flaw in SSL that reveals the length of each web object. In contrast, we exploit the statistical characteristics of web streams that are encrypted as a single flow, which is the case with WEP/WPA, IPsec, and SSH tunnels.},
    Author = {Bissias, George and Liberatore, Marc and Jensen, David and Levine, Brian Neil},
    Booktitle = {Proc. Privacy Enhancing Technologies Workshop (PET)},
    Keywords = {security; anonymity; privacy},
    Month = {May},
    Pages = {1--11},
    Sponsors = {NSF-0133055 and NSF-0325868 and NSF-0080199},
    Title = {{Privacy Vulnerabilities in Encrypted HTTP Streams}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/bissias.liberatore.pet.2005.pdf},
    Year = {2005},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bissias.liberatore.pet.2005.pdf}}

    [link][PDF]

  • @article{Wright:2004,
    Abstract = {There have been a number of protocols proposed for anonymous network communication. In this paper we investigate attacks by corrupt group members that degrade the anonymity of each protocol over time. We prove that when a particular initiator continues communication with a particular responder across path reformations, existing protocols are sub ject to the attack. We use this result to place an upper bound on how long existing protocols, including Crowds, Onion Routing, Hordes, Web Mixes, and DC-Net, can maintain anonymity in the face of the attacks described. This provides a basis for comparing these protocols against each other. Our results show that fully-connected DC-Net is the most resilient to these attacks, but it suffers from scalability issues that keep anonymity group sizes small. We also show through simulation that the underlying topography of the DC-Net has affects the resilience of the protocol: as the number of neighbors a node has increases both the communications overhead and the strength of the protocol increase. },
    Author = {Wright, Matthew and Adler, Micah and Levine, Brian Neil and Shields, Clay},
    Journal = {ACM Transactions on Information and System Security (TISSEC)},
    Keywords = {anonymity; peer-to-peer; Journal Paper},
    Month = {November},
    Number = 7, Pages = {489--522},
    Sponsors = {NSF-0080119 and NSF-0087482 and NSF-0296194 and 2000-DT-CX-K001},
    Title = {{The Predecessor Attack: An Analysis of a Threat to Anonymous Communications Systems}},
    Url = {http://forensics.umass.edu/pubs/wright-tissec.pdf},
    Volume = 4, Year = {2004},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/wright-tissec.pdf}}

    [link][PDF]

  • @inproceedings{Levine:2004,
    Author = {Levine, Brian Neil and Reiter, Mike and Wang, Chenxi and Wright, Matthew},
    Booktitle = {Proc. Financial Cryptography (FC) (LNCS 3110)},
    Keywords = {peer-to-peer; anonymity},
    Month = {February},
    Pages = {251---265},
    Sponsors = {NSF-0087482 and NSF-0080199},
    Title = {{Timing Attacks in Low-Latency Mix Systems}},
    Url = {http://forensics.umass.edu/pubs/wright.FC04.pdf},
    Year = {2004},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/wright.FC04.pdf}}

    [link][PDF]

  • @inproceedings{Wright:2003,
    Author = {Wright, Matthew and Adler, Micah and Levine, Brian Neil and Shields, Clay},
    Booktitle = {Proc. IEEE Symposium on Security and Privacy (Oakland)},
    Keywords = {anonymity;peer-to-peer},
    Month = {May},
    Pages = {28--41},
    Sponsors = {NSF-0080119},
    Title = {{Defending Anonymous Communication Against Passive Logging Attacks}},
    Url = {http://forensics.umass.edu/pubs/wright-passive.pdf},
    Year = {2003},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/wright-passive.pdf}}

    [link][PDF]

  • @article{Levine:2002,
    Author = {Levine, Brian Neil and Shields, Clay},
    Journal = {Journal of Computer Security},
    Keywords = {anonymity; multicast; peer-to-peer; Journal Paper},
    Month = {September},
    Number = {3},
    Pages = {213--240},
    Sponsors = {NSF-0080119 and NSF-0087482 and NSF-0296194 and 2000-DT-CX-K001},
    Title = {{Hordes --- A Multicast Based Protocol for Anonymity}},
    Url = {http://portal.acm.org/citation.cfm?id=603404.603406},
    Volume = {10},
    Year = {2002},
    Bdsk-Url-1 = {http://portal.acm.org/citation.cfm?id=603404.603406}}

    [link][PDF]

  • @inproceedings{Wright:2002,
    Author = {Wright, Matthew and Adler, Micah and Levine, Brian Neil and Shields, Clay},
    Booktitle = {Proc. ISOC Symposium Network and Distributed System Security (NDSS)},
    Keywords = {peer-to-peer; anonymity;award paper; Synthesis project},
    Month = {February},
    Note = {Outstanding Paper Award},
    Pages = {38--50},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/wright.ndss_2002.pdf},
    Sponsor = {ANI-0087639, ANI-0087482, 2000-DT-CK-K001},
    Title = {{An Analysis of the Degradation of Anonymous Protocols}},
    Url = {http://forensics.umass.edu/pubs/wright.ndss01.pdf},
    Year = {2002},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/wright.ndss01.pdf}}

    [link][PDF]

  • @inproceedings{Scarlata:2001,
    Author = {Scarlata, Vincent and Levine, Brian Neil and Shields, Clay},
    Booktitle = {Proc.\ IEEE International Conference on Network Protocols (ICNP)},
    Keywords = {peer-to-peer; anonymity},
    Month = {November},
    Pages = {272--280},
    Title = {{Responder Anonymity and Anonymous Peer-to-Peer File Sharing}},
    Url = {http://doi.ieeecomputersociety.org/10.1109/ICNP.2001.992907},
    Year = {2001},
    Bdsk-Url-1 = {http://doi.ieeecomputersociety.org/10.1109/ICNP.2001.992907}}

    [link][PDF]

  • @inproceedings{Shields:2000,
    Author = {Shields, Clay and Levine, Brian Neil},
    Booktitle = {Proc. ACM Conference on Computer and Communication Security (CCS)},
    Keywords = {anonymity; multicast; peer-to-peer},
    Month = {November},
    Pages = {33--43},
    Title = {{A Protocol for Anonymous Communication Over the Internet}},
    Url = {http://doi.acm.org/10.1145/352600.352607},
    Year = {2000},
    Bdsk-Url-1 = {http://doi.acm.org/10.1145/352600.352607}}

    [link][PDF]

 
Keywords
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996