[All entries] This page as [Text] or [Bibtex]

  • @inproceedings{Bissias:2018,
    Author = { George Biassias and Brian Neil Levine and David Thibodeau},
    Booktitle = {Proceedings of the International Workshop on Cryptocurrencies and Blockchain Technology (CBT'18)},
    Keywords = {blockchain},
    Month = {September},
    Url = {http://cryptoeconomics.cs.umass.edu/pubs/bissias.cbt.2018.pdf},
    Title = {{Using Economic Risk to Model Miner Hash Rate Allocation in Cryptocurrencies}},
    Year = 2018}
    [link][PDF]

  • @article{Sung:2019,
    Author = { Keen Sung and Joydeep Biswas and Erik Learned-Miller and Brian Neil Levine and Marc Liberatore},
    Journal = {ACM Transactions on Mobile Computing},
    Keywords = {privacy; cellular;Journal Paper},
    Month = {August},
    Url = {http://forensics.cs.umass.edu/pubs/sung.TMC.2018.pdf},
    Title = {{Server-side traffic analysis reveals mobile location information over the Internet}},
    Year = 2018} Server-side traffic analysis reveals mobile location information over the Internet
    [link][PDF]

  • @inproceedings{Corner:2018,
    Author = { Mark D. Corner and Brian Neil Levine},
    Booktitle = {Proceedings ACM International Conference on Mobile Systems, Applications, and Services (MobiSys)},
    Keywords = {advertising;cellular},
    Url = {https://people.cs.umass.edu/~mcorner/papers/mobisys18-micromobile.pdf},
    Month = {June},
    Title = {{MicroMobile: Leveraging Mobile Advertising for Large-Scale Experimentation}},
    Year = 2018}
    [link][PDF]

  • @inproceedings{Corner:2017,
    Author = { Mark D. Corner and Brian Neil Levine and Omar Ismail and Angela Upreti},
    Booktitle = {ACM International Conference on Mobile Computing and Networking (MobiCom)},
    Keywords = {wireless; cellular; advertising},
    Url = {http://forensics.cs.umass.edu/pubs/corner.mobicom.2017.pdf},
    Addendum_Url = {http://forensics.cs.umass.edu/pubs/censorship-corner-levine.pdf},
    Month = {{October}},
    Title = {{Advertising-based Measurement: A Platform of 7 Billion Mobile Devices}},
    Year = {2017}}

    [link][PDF]

  • @inproceedings{Bissias:2017,
    Url = {http://forensics.cs.umass.edu/pubs/bissias.nspw.2017.pdf},
    Author = { George Bissias and Brian Neil Levine and Nikunj Kapadia},
    Booktitle = {Proc. of New Security Paradigms Workshop [draft version was: arXiv:1701.03945]},
    Keywords = {blockchain; security},
    Month = {October},
    Title = {{Securing the Assets of Decentralized Applications using Financial Derivatives}},
    Year = {2017}}

    [link][PDF]

  • @techreport{Bissias:2017a,
    Author = { George Bissias and Brian Neil Levine},
    Address = {Amherst, MA},
    Arxiv_Techrep_Url = {https://arxiv.org/abs/1709.08750},
    Institution = {University of Massachusetts},
    Keywords = {blockchain; security},
    Month = {September},
    Number = {arXiv:1709.08750},
    Title = {{Bobtail: A Proof-of-Work Target that Minimizes Blockchain Mining Variance}},
    Year = {2017}}

    [link]

  • @inproceedings{Ozisik:2017c,
    Author = { A. Pinar Ozisik and Gavin Andresen and George Bissias and Amir Houmansadr and Brian Neil Levine},
    Booktitle = {Proc. of International Workshop on Cryptocurrencies and Blockchain Technology (ESORICS Workshop)},
    Keywords = {blockchain; peer-to-peer},
    Url = {http://forensics.cs.umass.edu/pubs/ozisik.cbt2017.pdf},
    Month = {September},
    Title = {{Graphene: A New Protocol for Block Propagation Using Set Reconciliation}},
    Year = {2017}}

    [link][PDF]

  • @techreport{Ozisik:2017b,
    Address = {Amherst, MA},
    Arxiv_Techrep_Url = {https://arxiv.org/abs/1707.00082},
    Author = { A. Pinar Ozisik and George Bissias and Brian Neil Levine},
    Demo_Url = {http://www.cs.umass.edu/~brian/blockchain.html},
    Institution = {University of Massachusetts},
    Keywords = {blockchain; security},
    Month = {July},
    Number = {arXiv:1707.00082},
    Title = {{Estimation of Miner Hash Rates and Consensus on Blockchains}},
    Year = {2017}}

    [link]

  • @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]

  • @techreport{Ozisik:2017,
    Address = {Amherst, MA},
    Arxiv_pdf_Url = {http://arxiv.org/abs/1701.03977},
    Author = { A. Pinar Ozisik and Brian Neil Levine},
    Institution = {University of Massachusetts},
    Keywords = {blockchain; security},
    Month = {January},
    Number = {arXiv:1701.03977},
    Title = {{An Explanation of Nakamoto's Analysis of Double-spend Attacks}},
    Year = {2017}}

    [link]

  • @techreport{Bissias:2016,
    Address = {Amherst, MA},
    Arxiv_Techrep_Url = {https://arxiv.org/abs/1610.07985},
    Author = { George Bissias and Brian Neil Levine and A. Pinar Ozisik and Gavin Andresen},
    Institution = {University of Massachusetts},
    Keywords = {blockchain; security},
    Month = {October},
    Number = {arXiv:1610.07985},
    Title = {{An Analysis of Attacks on Blockchain Consensus}},
    Year = {2016}}

    [link]

  • @techreport{Ozisik:2016,
    Address = {Amherst, MA},
    Author = { A. Pinar Ozisik and Gavin Andresen and George Bissias and Amir Houmansadr and Brian Neil Levine},
    Institution = {University of Massachusetts},
    Keywords = {blockchain; security; peer-to-peer},
    Month = {October},
    Number = {UM-CS-2016-006},
    Title = {{A Secure, Efficient, and Transparent Network Architecture for Bitcoin}},
    Url = {https://web.cs.umass.edu/publication/details.php?id=2417},
    Year = {2016},
    Bdsk-Url-1 = {https://web.cs.umass.edu/publication/details.php?id=2417}}

    [link][PDF]

  • @article{Bissias:2015a,
    Author = { George Bissias and Brian Neil Levine and Marc Liberatore and Brian Lynn and Juston Moore and Hanna Wallach and Janis Wolak},
    Doi = {http://dx.doi.org/10.1016/j.chiabu.2015.10.022},
    Journal = {Elsevier Child Abuse \& Neglect},
    Keywords = {forensics; peer-to-peer;Child sexual exploitation;Journal Paper},
    Month = {February},
    Pages = {185--199},
    Sponsors = {2011-MC-CX-0001},
    Title = {{Characterization of Contact Offenders and Child Exploitation Material Trafficking on Five Peer-to-Peer Networks}},
    Url = {http://forensics.umass.edu/pubs/bissias.ChildAbuseNeglect.2015.pdf},
    Volume = {52},
    Year = {2016},
    Bdsk-Url-2 = {http://dx.doi.org/10.1016/j.chiabu.2015.10.022}}

    [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{Walls:2015,
    Author = { Robert J. Walls and Yuriy Brun and Marc Liberatore and Brian Neil Levine},
    Booktitle = {Proc.\ IEEE International Symposium on Software Reliability Engineering},
    Keywords = {security},
    Month = {November},
    Title = {{Discovering Specification Violations in Networked Software Systems}},
    Url = {http://forensics.umass.edu/pubs/Walls15issre.pdf},
    Year = {2015},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Walls15issre.pdf}}

    [link][PDF]

  • @inproceedings{Bissias:2014,
    Author = { George Bissias and A. Pinar Ozisik and Brian Neil Levine and Marc Liberatore},
    Booktitle = {Proc.\ ACM Workshop on Privacy in the Electronic Society},
    Keywords = {Privacy; blockchain; Sybil attack; Peer-to-peer},
    Month = {November},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/ozisik.wpes.2014.slides.pdf},
    Title = {{Sybil-Resistant Mixing for Bitcoin}},
    Url = {http://forensics.umass.edu/pubs/bissias.wpes.2014.pdf},
    Year = {2014},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bissias.wpes.2014.pdf}}

    [link][PDF]

  • @inproceedings{Varma:2014,
    Author = { Saksham Varma and Robert J. Walls and Brian Lynn and Brian Neil Levine},
    Booktitle = {Proc.\ ACM Workshop on Security and Privacy in Smartphones and Mobile Devices},
    Keywords = {forensics},
    Month = {November},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/walls.spsm.2014.slides.pdf},
    Source_Code_Url = {http://forensics.umass.edu/projects.php},
    Sponsors = {NPS-N00244-12-1-0057},
    Title = {{Efficient Smart Phone Forensics Based on Relevance Feedback}},
    Url = {http://forensics.umass.edu/pubs/varma.spsm.2014.pdf},
    Year = {2014},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/varma.spsm.2014.pdf}}

    [link][PDF]

  • @article{Liberatore:2014,
    Author = { Marc Liberatore and Brian Neil Levine and Clay Shields and Brian Lynn},
    Journal = {IEEE Transactions on Dependable and Secure Computing},
    Keywords = {forensics; peer-to-peer; Journal Paper; Child sexual exploitation},
    Month = {September},
    Number = {5},
    Pages = {425--439},
    Sponsor = {CNS-1018615 CNS-0905349, CNS-1018615, DUE-0830876, 2008-CE-CX-K005.},
    Title = {{Efficient Tagging of Remote Peers During Child Pornography Investigations}},
    Url = {http://forensics.umass.edu/pubs/Liberatore.tdsc.2014.pdf},
    Volume = {11},
    Year = {2014},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Liberatore.tdsc.2014.pdf}}

    [link][PDF]

  • @inproceedings{Sung:2014,
    Author = { Keen Sung and Brian Neil Levine and Marc Liberatore},
    Booktitle = {Proc. IEEE Workshop on Mobile System Technologies (MoST)},
    Keywords = {Privacy; Cellular; Remote Inference; security},
    Month = {May},
    Slides_Url = {http://forensics.umass.edu/pubs/Sung-MoST-2014.slides.pdf},
    Sponsors = {CNS-0905349},
    Title = {{Location Privacy without Carrier Cooperation}},
    Url = {http://forensics.umass.edu/pubs/Sung-MoST-2014.pdf},
    Year = {2014},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Sung-MoST-2014.pdf}}

    [link][PDF]

  • @article{Wolak:2014,
    Author = { Janis Wolak and Marc Liberatore and Brian Neil Levine},
    Journal = {Elsevier Child Abuse \& Neglect},
    Keywords = {Peer-to-peer; Child sexual exploitation; Journal Paper; forensics},
    Month = {February},
    Number = 2, Pages = {347--356},
    Sponsors = {CNS-1016788, CNS-1018615, 2008-CE-CX-K005},
    Title = {{Measuring a year of child pornography trafficking by US computers on a peer-to-peer network}},
    Url = {http://dx.doi.org/10.1016/j.chiabu.2013.10.018},
    Volume = 38, Year = {2014},
    Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.chiabu.2013.10.018}}

    [link][PDF]

  • @inproceedings{Soroush:2013,
    Author = { Hamed Soroush and Keen Sung and Erik Learned-Miller and Brian Neil Levine and Marc Liberatore},
    Booktitle = {Proc. Privacy Enhancing Technologies Symposium (PETS)},
    Keywords = {Privacy; Cellular; Remote Inference},
    Month = {July},
    Pages = {103--122},
    Sponsors = {CNS-0905349},
    Title = {{Turning Off GPS is Not Enough: Cellular location leaks over the Internet}},
    Traces_Url = {brian.php/Network},
    Url = {http://forensics.umass.edu/pubs/soroush.pets.2013.pdf},
    Year = {2013},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/soroush.pets.2013.pdf}}

    [link][PDF]

  • @inproceedings{Hurley:2013,
    Author = { Ryan Hurley and Swagatika Prusty and Hamed Soroush and Robert J. Walls and Jeannie Albrecht and Emmanuel Cecchet and Brian Neil Levine and Marc Liberatore and Brian Lynn and Janis Wolak},
    Booktitle = {Proc. Intl. World Wide Web Conference (WWW)},
    Keywords = {forensics; peer-to-peer; Award Paper; Child sexual exploitation},
    Month = {May},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/walls.www.2013.slides.pdf},
    Sponsors = {CNS-1018615; CNS-0905349; 2008-CE-CX-K005},
    Techreport_Url = {http://web.cs.umass.edu/publication/docs/2013/UM-CS-2013-007.pdf},
    Title = {{Measurement and Analysis of Child Pornography Trafficking on P2P Networks (Runner-Up, Best Paper Award)}},
    Url = {http://forensics.umass.edu/pubs/hurley.www.2013.pdf},
    Year = {2013},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/hurley.www.2013.pdf}}

    [link][PDF]

  • @inproceedings{Yang:2013,
    Author = { Sookhyun Yang and Jim Kurose and Brian Neil Levine},
    Booktitle = {Proc. IEEE INFOCOM Mini-Conference},
    Keywords = {forensics; wireless; Synthesis project},
    Month = {April},
    Pages = {5},
    Sponsors = {CNS-0905349},
    Title = {{Disambiguation of Residential Wired and Wireless Access in a Forensic Setting}},
    Url = {http://forensics.umass.edu/pubs/yang.infocom-mini.2013.pdf},
    Year = {2013},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/yang.infocom-mini.2013.pdf}}

    [link][PDF]

  • @inproceedings{Walls:2012,
    Author = {Walls, Robert J. and Clark, Shane S. and Levine, Brian Neil},
    Booktitle = {Proc. USENIX Workshop on Hot Topics in Security},
    Keywords = {privacy},
    Month = {August},
    Source_Code_Url = {http://forensics.umass.edu/projects.php},
    Title = {{Functional Privacy or Why Cookies are Better with Milk}},
    Url = {http://forensics.umass.edu/pubs/walls.hotsec12.pdf},
    Workshop_Url = {https://www.usenix.org/conference/hotsec12},
    Year = {2012},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/walls.hotsec12.pdf}}

    [link][PDF]

  • @inproceedings{Partan:2011,
    Author = { James W. Partan and Jim Kurose and Brian Neil Levine and James Preisig},
    Booktitle = {Proc. ACM International Workshop on UnderWater Networks (WUWNet)},
    Keywords = {MAC Protocols; wireless; underwater; Synthesis project},
    Month = {December},
    Sponsors = {CNS-0519881},
    Title = {{Low Spreading Loss in Underwater Acoustic Networks Reduces RTS/CTS Effectiveness}},
    Url = {http://forensics.umass.edu/pubs/partan.wuwnet.2011.pdf},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/partan.wuwnet.2011.pdf}}

    [link][PDF]

  • @inproceedings{Soroush:2011a,
    Author = { Hamed Soroush and Peter Gilbert and Nilanjan Banerjee and Brian Neil Levine and Mark D. Corner and Landon Cox},
    Booktitle = {Proc.\ ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
    Keywords = {DOME; wireless},
    Month = {December},
    Pages = {12},
    Sponsors = {CNS-0519881, CNS-0447877, CNS-0720717, CNS-1018112, CNS-1055061, CNS-1115728},
    Title = {{Concurrent Wi-Fi for Mobile Users: Analysis and Measurements}},
    Url = {http://forensics.umass.edu/pubs/soroush.conext.2011.pdf},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/soroush.conext.2011.pdf}}

    [link][PDF]

  • @article{Soroush:2011b,
    Author = {Soroush, Hamed and Banerjee, Nilanjan and Corner, Mark and Levine, Brian and Lynn, Brian},
    Journal = {ACM SIGMOBILE Mobile Computing and Communications Review},
    Keywords = {DOME; wireless},
    Month = {October},
    Number = {4},
    Pages = {2--15},
    Title = {{A retrospective look at the UMass DOME mobile testbed} (invited)},
    Url = {http://forensics.umass.edu/pubs/soroush.mc2r.2011.pdf},
    Volume = {15},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/soroush.mc2r.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{Margolin:2011,
    Abstract = {Once electronic content has been released it is very difficult to prevent copies of the content from being widely distributed. Such distribution can cause economic harm to the content's copyright owner and others. Our protocol, SPIES, allows one party to sell a secret to second party and provides an economic incentive for two parties to limit sharing of a secret between themselves. We do not use watermarking or traditional DRM mechanisms. We focus on content which is to be shared between two parties only, which is valuable, and which only needs to be protected for a limited amount of time. Examples include passwords to a subscription service, pre-release of media for review, or content shared but bound by a non-disclosure agreement. With SPIES, any possesor of the content can receive a portion of the funds placed in escrow by the two legitimate possesors. We analyze this system and show that the best strategy of the content provider and content consumer to maximize their utility is to use SPIES and not share the content further. We deal successfully with a ``dummy registration'' attack in which multiple false identities are used in an attempt to get a higher payment. We also discuss how to determine the correct escrow amount. },
    Author = {Margolin, N. Boris and Levine, Brian Neil and James D. Miller and Wright, Matthew},
    Doi_Url = {http://dx.doi.org/10.1016/j.elerap.2010.12.006},
    Journal = {Elsevier Electronic Commerce Research and Applications},
    Keywords = {security; Sybil attack; Journal Paper},
    Month = {September},
    Number = {5},
    Pages = {553-564},
    Sponsors = {NSF-0133055 and NSF-0087482 and NSF-0080199},
    Title = {{Economic Incentives for Protecting Digital Rights Online}},
    Url = {http://forensics.umass.edu/pubs/margolin.ECRA.2011.pdf},
    Volume = {10},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/margolin.ECRA.2011.pdf}}

    [link][PDF]

  • @inproceedings{Walls:2011a,
    Audio_Url = {http://forensics.umass.edu/pubs/Walls.hotsec.2011.mp3},
    Author = { Robert J. Walls and Brian Neil Levine and Marc Liberatore and Clay Shields},
    Booktitle = {Proc.\ USENIX Workshop on Hot Topics in Security (HotSec)},
    Keywords = {forensics; security},
    Month = {August},
    Slides_Url = {http://forensics.umass.edu/pubs/rjwalls.hotsec.2011.slides.pdf},
    Sponsors = {CNS-1018615, CNS-0905349, DUE-0830876, 2008-CE-CX-K005},
    Title = {{Effective Digital Forensics Research is Investigator-Centric}},
    Url = {http://forensics.umass.edu/pubs/Walls.hotsec.2011.pdf},
    Video_Url = {http://forensics.umass.edu/pubs/Walls.hotsec.2011.mp4},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Walls.hotsec.2011.pdf}}

    [link][PDF]

  • @inproceedings{Soroush:2011,
    Author = { Hamed Soroush and Peter Gilbert and Nilanjan Banerjee and Brian Neil Levine and Mark D. Corner and Landon Cox},
    Booktitle = {Proc.\ ACM SIGCOMM},
    Keywords = {DOME; wireless},
    Month = {August},
    Title = {{Spider: Improving Mobile Networking with Concurrent Wi-Fi Connections (Poster)}},
    Url = {http://forensics.umass.edu/pubs/soroush.sigcomm.2011.poster.pdf},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/soroush.sigcomm.2011.poster.pdf}}

    [link][PDF]

  • @inproceedings{Walls:2011,
    Audio_Url = {http://forensics.umass.edu/pubs/Walls.usenixSecurity.2011.mp3},
    Author = { Robert J. Walls and Erik Learned-Miller and Brian Neil Levine},
    Booktitle = {Proc.\ USENIX Security Symposium},
    Keywords = {forensics; Synthesis project},
    Month = {August},
    Slides_Url = {http://forensics.umass.edu/pubs/rjwalls.usenixSecurity.2011.slides.pdf},
    Source_Code_Url = {http://forensics.umass.edu/projects.php},
    Sponsors = {DUE-0830876},
    Title = {{Forensic Triage for Mobile Phones with DEC0DE}},
    Url = {http://forensics.umass.edu/pubs/Walls.usenixSecurity.2011.pdf},
    Video_Url = {http://forensics.umass.edu/pubs/Walls.usenixSecurity.2011.mp4},
    Year = {2011},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Walls.usenixSecurity.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]

  • @inproceedings{Bissias:2010,
    Author = { George Bissias and Brian Neil Levine and Ramesh Sitaraman},
    Booktitle = {Proc.\ ACM Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
    Keywords = {security; wireless; routing},
    Month = {November},
    Slides_Url = {http://forensics.umass.edu/pubs/bissias.conext.2010.slides.pdf},
    Sponsor = {CNS-0519881 and CNS-0519894},
    Title = {{Assessing the Vulnerability of Replicated Network Services}},
    Url = {http://forensics.umass.edu/pubs/bissias.conext.2010.pdf},
    Year = {2010},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bissias.conext.2010.pdf}}

    [link][PDF]

  • @inproceedings{Liberatore:2010b,
    Author = { Marc Liberatore and Brian Neil Levine and Clay Shields},
    Booktitle = {Proc.\ ACM Conference on Future Networking Technologies (CoNEXT)},
    Keywords = {forensics; peer-to-peer; Child sexual exploitation},
    Month = {November},
    Slides_Url = {http://forensics.umass.edu/pubs/liberatore.conext.2010.slides.pdf},
    Sponsors = {DUE-0830876, CNS-1018615, and 2008-CE-CX-K005 CNS-0905349},
    Title = {{Strengthening Forensic Investigations of Child Pornography on P2P Networks}},
    Url = {http://forensics.umass.edu/pubs/liberatore.conext.2010.pdf},
    Year = {2010},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/liberatore.conext.2010.pdf}}

    [link][PDF]

  • @inproceedings{Tuttle:2010,
    Author = { John Tuttle and Robert J. Walls and Erik Learned-Miller and Brian Neil Levine},
    Booktitle = {Proc.\ ACM Workshop on Insider Threats},
    Keywords = {forensics},
    Month = {October},
    Sponsors = {CNS-0905349 and DUE-0830876},
    Title = {{Reverse Engineering for Mobile Systems Forensics with Ares}},
    Url = {http://forensics.umass.edu/pubs/tuttle.ares.2010.pdf},
    Workshop_Url = {http://www.csiir.ornl.gov/ccsw2010/},
    Year = {2010},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/tuttle.ares.2010.pdf}}

    [link][PDF]

  • @inproceedings{Liberatore:2010,
    Author = { Marc Liberatore and Robert Erdely and Thomas Kerle and Brian Neil Levine and Clay Shields},
    Booktitle = {Proc.\ DFRWS Annual Digital Forensics Research Conference},
    Correction_Url = {http://forensics.umass.edu/pubs/liberatore.dfrws2010.correction.pdf},
    Keywords = {forensics; peer-to-peer; Child sexual exploitation},
    Month = {August},
    Sponsors = {2008-CE-CX-K005, CNS-0905349, and DUE-0830876},
    Title = {{Forensic Investigation of Peer-to-Peer File Sharing Networks}},
    Url = {http://forensics.umass.edu/pubs/liberatore.dfrws2010.pdf},
    Year = {2010},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/liberatore.dfrws2010.pdf}}

    [link][PDF]

  • @techreport{Partan:2010,
    Author = { James W. Partan and Jim Kurose and Brian Neil Levine and James Preisig},
    Institution = {University of Massachusetts Amherst},
    Keywords = {MAC Protocols; wireless; underwater; Tech report; Synthesis project},
    Month = {July},
    Number = {UM-CS-2010-045},
    Title = {{Spatial Reuse in Underwater Acoustic Networks using RTS/CTS MAC Protocols}},
    Url = {http://forensics.umass.edu/pubs/Partan.UM-CS-2010-045.pdf},
    Year = {2010},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Partan.UM-CS-2010-045.pdf}}

    [link][PDF]

  • @article{Balasubramanian:2010,
    Author = { Aruna Balasubramanian and Brian Neil Levine and Arun Venkataramani},
    Journal = {IEEE/ACM Transactions on Networking},
    Keywords = {DTN; routing; Journal Paper; wireless; DOME},
    Month = {April},
    Number = {2},
    Pages = {596--609},
    Sponsors = {NSF-0133055 and CNS-0519881},
    Title = {{Replication Routing in DTNs: A Resource Allocation Approach}},
    Url = {http://forensics.umass.edu/pubs/Balasubramanian.ToN.2010.pdf},
    Volume = {18},
    Year = {2010},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Balasubramanian.ToN.2010.pdf}}

    [link][PDF]

  • @article{Banerjee:2010,
    Abstract = {Disruption Tolerant Networks rely on intermittent contacts between mobile nodes to deliver packets using store- carry-and-forward paradigm. The key to improving performance in DTNs is to engineer a greater number of transfer opportunities. We earlier proposed the use of throwbox nodes, which are stationary, battery powered nodes with storage and processing, to enhance the capacity of DTNs. However, the use of throwboxes without efficient power management is minimally effective. If the nodes are too liberal with their energy consumption, they will fail prematurely. However if they are too conservative, they may miss important transfer opportunities, hence increasing lifetime without improving performance. In this paper, we present a hardware and software architecture for energy efficient throwboxes in DTNs. We propose a hardware platform that uses a multi-tiered, multi-radio, scalable, solar powered platform. The throwbox employs an approximate heuristic for solving the NP-Hard problem of meeting an average power constraint while maximizing the number of bytes forwarded by it. We built and deployed prototype throwboxes in UMassDieselNet -- a bus DTN testbed. Through extensive trace-driven simulations and prototype deployment we show that a single throwbox with a 270 cm2 solar panel can run perpetually while improving packet delivery by 37% and reducing message delivery latency by at least 10% in the network. },
    Author = {Banerjee, Nilanjan and Corner, Mark D. and Levine, Brian Neil},
    Journal = {IEEE/ACM Transactions on Networking},
    Keywords = {Power Management; DTN; Journal Paper; DOME},
    Month = {April},
    Number = {2},
    Pages = {554--567},
    Sponsors = {CNS-0447877, NSF-0133055, CNS-0520729, CNS-0519881, DUE-0416863},
    Title = {{Design and Field Experimentation of an Energy-Efficient Architecture for DTN Throwboxes}},
    Url = {http://forensics.umass.edu/pubs/Banerjee.ToN.2010.pdf},
    Volume = {18},
    Year = {2010},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/Banerjee.ToN.2010.pdf}}

    [link][PDF]

  • @inproceedings{Levine:2009a,
    Author = { Brian Neil Levine and Marc Liberatore},
    Booktitle = {Proc. of DFRWS Annual Conference},
    Conference_Url = {http://dfrws.org/2009/},
    Keywords = {forensics},
    Month = {August},
    Source_Code_Url = {http://forensics.umass.edu/projects.php},
    Sponsors = {DUE-0830876 and 2008-CE-CX-K005},
    Title = {{DEX: Digital Evidence Provenance Supporting Reproducibility and Comparison}},
    Url = {http://forensics.umass.edu/pubs/levine.dfrws.2009.pdf},
    Year = {2009},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/levine.dfrws.2009.pdf}}

    [link][PDF]

  • @inproceedings{Soroush:2009,
    Author = { Hamed Soroush and Nilanjan Banerjee and Aruna Balasubramanian and Mark D. Corner and Brian Neil Levine and Brian Lynn},
    Booktitle = {Proc. ACM Intl. Workshop on Hot Topics of Planet-Scale Mobility Measurements (HotPlanet)},
    Keywords = {Wireless, DTN; DOME},
    Month = {June},
    Sponsors = {CNS-0519881, CNS-0447877},
    Techreport_Url = {https://web.cs.umass.edu/publication/docs/2009/UM-CS-2009-023.pdf},
    Title = {{DOME: A Diverse Outdoor Mobile Testbed}},
    Url = {http://forensics.umass.edu/pubs/soroush.hotplanet09.pdf},
    Year = {2009},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/soroush.hotplanet09.pdf}}

    [link][PDF]

  • @incollection{Levine:2009,
    Author = { Brian Neil Levine and Gerome Miklau},
    Booktitle = {{Encyclopedia of Database Systems}},
    Editor = {M. Tamer A-Zsu and Ling Liu},
    Keywords = {forensics; database security;},
    Month = {June},
    Publisher = {Springer-Verlag},
    Table_Of_Contents_Url = {brian.php?id=1212},
    Title = {{Auditing and Forensic Analysis}},
    Year = {2009}}

    [link]

  • @techreport{DeBonis:2008,
    Appendix_D_Url = {http://forensics.umass.edu/pubs/ISTTF_Final_Report-APPENDIX_D_TAB_and_EXHIBITS.pdf},
    Author = {DeBonis, Laura and Adida, Ben and Bradner, Scott and Farid, Hany and Hollaar, Lee and Inskeep, Todd and Levine, Brian Neil and Mcabian, Adi and Morgan, R.L. and Nguyen, Lam and Schiller, Jeff and Weitzner, Danny},
    Full_Report_Url = {http://cyber.law.harvard.edu/pubrelease/isttf/},
    Institution = {Internet Safety Technical Task Force to the Multi-State Working Group on Social Networking of State Attorneys General of the United States},
    Keywords = {peer-to-peer; forensics},
    Month = {December},
    Title = {{Enhancing Child Safety \& Online Technologies. Appendix D: Technology Advisory Board Report}},
    Year = {2008}}

    [link]

  • @inproceedings{Balasubramanian:2008b,
    Author = {Balasubramanian, Aruna and Levine, Brian Neil and Venkataramani, Arun},
    Booktitle = {Proc. ACM Mobicom},
    Keywords = {wireless; DTN; information retrieval; DOME},
    Month = {September},
    Pages = {70--80},
    Sponsors = {CNS-0519881 and W911NF-07-1-0281},
    Title = {{Enabling Interactive Web Applications in Hybrid Networks}},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.mobicom.2008.pdf},
    Year = {2008},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/balasubramanian.mobicom.2008.pdf}}

    [link][PDF]

  • @inproceedings{BanerjeeMobicom08,
    Address = {San Francisco, CA, USA},
    Author = {Banerjee, Nilanjan and Corner, Mark D. and Towsley, Don and Levine, Brian Neil},
    Booktitle = {Proc. ACM Mobicom},
    Keywords = {Wireless; DTN; DOME},
    Month = {September},
    Pages = {81--91},
    Sponsors = {CNS-0519881,NSF-0133055,CNS-0615075,CNS-0520729,CNS-0447877, W911NF-07-1-0281},
    Title = {{Relays, Base Stations, and Meshes: Enhancing Mobile Networks with Infrastructure}},
    Traces_Url = {brian.php/Network},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.mobicom.2008.pdf},
    Year = {2008},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/balasubramanian.mobicom.2008.pdf}}

    [link][PDF]

  • @inproceedings{Balasubramanian:2008a,
    Author = {Balasubramanian, Aruna and Mahajan, Ratul and Venkataramani, Arun and Levine, Brian Neil and Zahorjan, John},
    Booktitle = {Proc. ACM SIGCOMM},
    Keywords = {wireless; DTN; DOME},
    Month = {August},
    Pages = {427--438},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/balasubramanian.sigcomm.2008.ppt},
    Sponsors = {CNS-0519881},
    Title = {{Interactive WiFi Connectivity for Moving Vehicles}},
    Traces_Url = {brian.php/Network},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.sigcomm.2008.pdf},
    Year = {2008},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/balasubramanian.sigcomm.2008.pdf}}

    [link][PDF]

  • @article{Burns:2008,
    Abstract = {Disruption-tolerant networks (DTNs) differ from other types of networks in that capacity is created by the movements of network participants. This implies that understanding and influencing the participants' motions can have a significant impact on network performance. In this paper, we introduce the routing protocol MORA, which learns structure in the movement patterns of network participants and uses it to enable informed message passing. We also propose the introduction of autonomous agents as additional participants in DTNs. These agents adapt their movements in response to variations in network capacity and demand. We use multi-objective control methods from robotics to generate motions capable of optimizing multiple network performance metrics simultaneously. We present experimental evidence that these strategies, individually and in conjunction, result in significant performance improvements in DTNs.},
    Author = {Burns, Brendan and Brock, Oliver and Levine, Brian Neil},
    Journal = {Elsevier Ad hoc Networks Journal},
    Keywords = {DTN; routing; Synthesis project; Journal Paper; DOME},
    Month = {June},
    Number = {4},
    Pages = {600-620},
    Sponsors = {ANI-0133055, CNS-0519881, IIS-0545934, EIA-0080199, NAG9-1445\#1},
    Title = {{MORA Routing and Capacity Building in Disruption-Tolerant Networks}},
    Url = {http://forensics.umass.edu/pubs/bburns.adhoc_nets_jrnl.pdf},
    Volume = {6},
    Year = {2008},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bburns.adhoc_nets_jrnl.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]

  • @article{Partan:2007,
    Author = {Partan, James W. and Kurose, Jim and Levine, Brian Neil},
    Journal = {Special Issue of ACM Mobile Computing Communications Review},
    Keywords = {DTN; underwater; wireless; DOME},
    Month = {October},
    Number = {4},
    Pages = {23--33},
    Sponsors = {CNS-0519881 and N00014-05-G-0106-0008},
    Title = {{A Survey of Practical Issues in Underwater Networks}},
    Url = {http://forensics.umass.edu/pubs/partan.mc2r07.pdf},
    Volume = {11},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/partan.mc2r07.pdf}}

    [link][PDF]

  • @inproceedings{Balasubramanian:2007b,
    Author = {Balasubramanian, Aruna and Zhou, Yun and Croft, W. Bruce and Levine, Brian Neil and Venkataramani, Arun},
    Booktitle = {Proc. ACM Workshop on Challenged Networks (CHANTS)},
    Keywords = {DTN; wireless; information retrieval; Synthesis project;DOME},
    Month = {September},
    Pages = {59--66},
    Pdf_Url = {http://forensics.umass.edu/pubs/balasubramanian.chants.2007.pdf},
    Slides_Url = http://forensics.umass.edu/pubs/slides/balasubramanian.chants.2007.ppt, Title = {{Web Search From a Bus}},
    Traces_Url = {brian.php/Network/Network},
    Year = {2007}}

    [link]

  • @inproceedings{Zhang:2007,
    Abstract = {In this paper, we study traces taken from UMass DieselNet, a sparse mobile wireless DTN network consisting of WiFi nodes attached to buses. As buses travel their routes, they encounter other buses and in some cases are able to establish pair-wise connections and transfer data between them. We analyze these traces to characterize inter-contact behavior among buses, and study the impact on DTN routing performance. We find that the all-bus-pairs aggregated inter-contact times show no discernible pattern. However, the inter-contact times aggregated at a route level exhibit periodic behavior. By analyzing the deterministic inter-meeting times for bus pairs on different route pairs, and then additionally considering variability in bus movement and random failures to establish connections when a pair of buses are in transmission range, we find that these inter-contact times aggregated at a route level can be modeled as mixtures of normal distributions. Based on this analysis, we construct generative models that capture the behavior described above, allowing one to generate synthetic traces of DTN inter-contact times. Using trace-driven simulations of epidemic DTN routing, we find that the epidemic performance predicted by traces generated with this finer-grained route-level model are much closer to the actual performance that would be realized in the operational system than traces generated using the coarse-grained all-bus-pairs aggregated model. This suggests that one must take care in choosing the right level of model granularity when modeling mobility-related measures such as inter-contact times in DTN networks. },
    Acm_Url = {http://doi.acm.org/10.1145/1287853.1287876},
    Author = {Zhang, Xiaolan and Kurose, Jim and Levine, Brian Neil and Towsley, Don and Zhang, Honggang},
    Booktitle = {Proc. ACM Intl. Conf. on Mobile Computing and Networking (Mobicom)},
    Keywords = {DTN; routing; wireless;DOME},
    Month = {September},
    Pages = {195--206},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/zhang.mobicom.2007.ppt.pdf},
    Sponsors = {CNS-0519881, ANI-0325868, and W911NF-06-3-0001},
    Title = {{Study of a Bus-Based Disruption Tolerant Network: Mobility Modeling and Impact on Routing}},
    Traces_Url = {brian.php/Network},
    Url = {http://forensics.umass.edu/pubs/zhang.mobicom.2007.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/zhang.mobicom.2007.pdf}}

    [link][PDF]

  • @inproceedings{Burgess:2007,
    Abstract = {Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN may attempt to delay or destroy data in transit to its destination. Such attacks include dropping data, flooding the network with extra messages, corrupting routing tables, and counterfeiting network acknowledgments. Many existing methods for securing routing protocols require authentication supported by mechanisms such as a public key infrastructure, which is difficult to deploy and operate in a DTN, where connectivity is sporadic. Furthermore, the complexity of such mechanisms may dissuade node participation so strongly that potential attacker impacts are dwarfed by the loss of contributing participants. In this paper, we use connectivity traces from our UMass DieselNet project and the Haggle project to quantify routing attack effectiveness on a DTN that lacks security. We introduce plausible attackers and attack modalities and provide complexity results for the strongest of attackers. We show that the same routing with packet replication used to provide robustness in the face of unpredictable mobility allows the network to gracefully survive attacks. In the case of the most effective attack, acknowledgment counterfeiting, we show a straightforward defense that uses cryptographic hashes but not a central authority. We conclude that disruption-tolerant networks are extremely robust to attack; in our trace-driven evaluations, an attacker that has compromised 30% of all nodes reduces delivery rates from 70% to 55%, and to 20% with knowledge of future events. By comparison, contemporaneously connected networks are significantly more fragile. },
    Address = {Montreal, Quebec, Canada},
    Author = {Burgess, John and Bissias, George and Corner, Mark D. and Levine, Brian Neil},
    Booktitle = {Proc. ACM International Symposium on Mobile Ad hoc Networking and Computing (MobiHoc)},
    Keywords = {DTN; wireless; security; routing; DOME},
    Month = {September},
    Pages = {61--70},
    Slides_Url = {http://forensics.umass.edu/pubs/mcorner/mobihoc07.ppt},
    Sponsors = {CNS-0133055, CNS-0519881, and CNS 0447877},
    Title = {{Surviving Attacks on Disruption-Tolerant Networks without Authentication}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/burgess.mobihoc.2007.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/burgess.mobihoc.2007.pdf}}

    [link][PDF]

  • @inproceedings{Balasubramanian:2007a,
    Author = {Balasubramanian, Aruna and Levine, Brian Neil and Venkataramani, Arun},
    Booktitle = {Proc. ACM SIGCOMM},
    Keywords = {DTN; routing; wireless;DOME},
    Month = {August},
    Pages = {373--384},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/balasubramanian.sigcomm.2007.ppt.pdf},
    Sponsors = {NSF-0133055 and CNS-0519881},
    Title = {{DTN Routing as a Resource Allocation Problem}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.sigcomm.2007.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/balasubramanian.sigcomm.2007.pdf}}

    [link][PDF]

  • @inproceedings{Stahlberg:2007,
    Author = {Stahlberg, Patrick and Miklau, Gerome and Levine, Brian Neil},
    Booktitle = {Proc. ACM Intl Conf. on Management of Data (SIGMOD)},
    Keywords = {forensics; database security; Privacy},
    Month = {June},
    Pages = {91--102},
    Title = {{Threats to Privacy in the Forensic Analysis of Database Systems}},
    Url = {http://forensics.umass.edu/pubs/stahlberg07forensicDB.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/stahlberg07forensicDB.pdf}}

    [link][PDF]

  • @inproceedings{Bissias:2007,
    Author = { George Bissias and Brian Neil Levine and Arnold L. Rosenberg},
    Booktitle = {Proc. ACM SIGMETRICS},
    Keywords = {security; routing},
    Month = {{June}},
    Pages = {367---368},
    Poster_Url = {http://forensics.umass.edu/pubs/bissias.sigmetrics.abstract.2007.pdf},
    Sponsors = {CNS-0133055, ANI-0325868},
    Title = {{Bounding Damage From Link Destruction with Application to the Internet (extended abstract)}},
    Url = {http://forensics.umass.edu/pubs/bissias.sigmetrics.abstract.2007.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bissias.sigmetrics.abstract.2007.pdf}}

    [link][PDF]

  • @inproceedings{BanerjeeInfocom07:Throwbox,
    Abstract = {Disruption Tolerant Networks rely on intermittent contacts between mobile nodes to deliver packets using store- carry-and-forward paradigm. The key to improving performance in DTNs is to engineer a greater number of transfer opportunities. We earlier proposed the use of throwbox nodes, which are stationary, battery powered nodes with storage and processing, to enhance the capacity of DTNs. However, the use of throwboxes without efficient power management is minimally effective. If the nodes are too liberal with their energy consumption, they will fail prematurely. However if they are too conservative, they may miss important transfer opportunities, hence increasing lifetime without improving performance. In this paper, we present a hardware and software architecture for energy efficient throwboxes in DTNs. We propose a hardware platform that uses a multi-tiered, multi-radio, scalable, solar powered platform. The throwbox employs an approximate heuristic for solving the NP-Hard problem of meeting an average power constraint while maximizing the number of bytes forwarded by it. We built and deployed prototype throwboxes in UMassDieselNet -- a bus DTN testbed. Through extensive trace-driven simulations and prototype deployment we show that a single throwbox with a 270 cm2 solar panel can run perpetually while improving packet delivery by 37% and reducing message delivery latency by at least 10% in the network. },
    Address = {Anchorage, Alaska},
    Author = {Banerjee, Nilanjan and Corner, Mark D. and Levine, Brian Neil},
    Booktitle = {Proceedings of IEEE Infocom},
    Keywords = {Power Management; DTN; DOME},
    Month = {May},
    Pages = {776--784},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/banerjee.infocom.2007.ppt},
    Sponsors = {CNS-0447877, NSF-0133055, CNS-0520729, CNS-0519881, DUE-0416863},
    Techreport_Url = {http://forensics.umass.edu/pubs/mcorner/banerjee06-39.pdf},
    Title = {{An Energy-Efficient Architecture for DTN Throwboxes}},
    Url = {http://forensics.umass.edu/pubs/banerjee.infocom07.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/banerjee.infocom07.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]

  • @article{Baughman:2007,
    Abstract = {We explore exploits possible for cheating in real-time, multiplayer games for both client-server and serverless architectures. We offer the first formalization of cheating in online games and propose an initial set of strong solutions. We propose a protocol that has provable anti-cheating guarantees, is provably safe and live, but suffers a performance penalty. We then develop an extended version of this protocol, called asynchronous synchronization, which avoids the penalty, is serverless, offers provable anti-cheating guarantees, is robust in the presence of packet loss, and provides for significantly increased communication performance. This technique is applicable to common game features as well as clustering and cell-based techniques for massively multiplayer games. Specifically, we provide a zero-knowledge proof protocol so that players are within a specific range of each other, and otherwise have no notion of their distance. Our performance claims are backed by analysis using a simulation based on real game traces.},
    Author = {Baughman, Nathaniel E. and Liberatore, Marc and Levine, Brian Neil},
    Journal = {IEEE/ACM Transactions on Networking},
    Keywords = {security;gaming;peer-to-peer; Journal Paper},
    Month = {February},
    Number = {1},
    Pages = {1--13},
    Sponsors = {NSF-0133055},
    Title = {{Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming}},
    Url = {http://forensics.umass.edu/pubs/baughman.ToN.pdf},
    Volume = {15},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/baughman.ToN.pdf}}

    [link][PDF]

  • @inproceedings{Miklau:2007a,
    Author = {Miklau, Gerome and Levine, Brian Neil and Stahlberg, Patrick},
    Booktitle = {Biennial ACM/VLDB Conference on Innovative Data Systems Research (CIDR)},
    Keywords = {database security; forensics},
    Month = {January},
    Pages = {387--396},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/mikalu.cidr2007.pdf},
    Title = {{Securing History: Privacy and Accountability in Database Systems}},
    Url = {http://forensics.umass.edu/pubs/mikalu.cidr2007.pdf},
    Year = {2007},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/mikalu.cidr2007.pdf}}

    [link][PDF]

  • @inproceedings{Liberatore:2006aMaximizing,
    Abstract = {Devices in disruption tolerant networks (DTNs) must be able to communicate robustly in the face of short and infrequent connection opportunities. Unfortunately, one of the most inexpensive, energy-efficient and widely deployed peer-to-peer capable radios, Bluetooth, is not well-suited for use in a DTN. Bluetooth's half-duplex process of neighbor discovery can take tens of seconds to complete between two mutually undiscovered radios. This delay can be larger than the time that mobile nodes can be expected to remain in range, resulting in a missed opportunity and lower overall performance in a DTN. This paper proposes a simple, cost effective, and high performance modification to mobile nodes to dramatically reduce this delay: the addition of a second Bluetooth radio. We showed through analysis and simulation that this dual radio technique improves both connection frequency and duration. Moreover, despite powering two radios simultaneously, nodes using dual radios are more energy efficient, spending less energy on average per second of data transferred.},
    Author = {Liberatore, Marc and Levine, Brian Neil and Barakat, Chadi},
    Booktitle = {Proc. ACM Conference on Future Networking Technologies (CoNext)},
    Keywords = {DTN; wireless; MAC Protocols; DOME},
    Month = {December},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/chadi.conext.2006.pdf},
    Sponsors = {NSF-0519881 and NSF-0133055 and NSF-0325868 and W15P7T-05-C-P213},
    Title = {{Maximizing Transfer Opportunities in Bluetooth DTNs}},
    Url = {http://forensics.umass.edu/pubs/liberatore.conext.2006.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/liberatore.conext.2006.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{Zhao:2006,
    Abstract = {Disruption Tolerant Networks (DTNs) are designed to overcome limitations in connectivity due to conditions such as mobility, poor infrastructure, and short range radios. DTNs rely on the inherent mobility in the network to deliver packets around frequent and extended network partitions using a store-carry-and-forward paradigm. However, missed contact opportunities decrease throughput and increase delay in the network. We propose the use of throwboxes in mobile DTNs to create a greater number of contact opportunities, consequently improving the performance of the network. Throwboxes are wireless nodes that act as relays, creating additional contact opportunities in the DTN. We propose algorithms to deploy stationary throwboxes in the network that simultaneously consider routing as well as placement. We also present placement algorithms that use more limited knowledge about the network structure. We perform an extensive evaluation of our algorithms by varying both the underlying routing and mobility models. Our results suggest several findings to guide the design and operation of throwbox-augmented DTNs.},
    Author = {Zhao, Wenrui and Chen, Yang and Ammar, Mostafa and Corner, Mark D. and Levine, Brian Neil and Zegura, Ellen},
    Booktitle = {Proceedings of IEEE International Conf on Mobile Ad hoc and Sensor Systems (MASS)},
    Keywords = {DTN; wireless; DOME},
    Month = {October},
    Pages = {31-40},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/chen.mass.2006.pdf},
    Sponsors = {NSF-0519784 and NSF-0519881 and W15P7T-05-C-P213},
    Title = {{Capacity Enhancement using Throwboxes in DTNs}},
    Url = {http://forensics.umass.edu/pubs/mcorner/mass06.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/mcorner/mass06.pdf}}

    [link][PDF]

  • @inproceedings{Partan:2006,
    Author = {Partan, James W. and Kurose, Jim and Levine, Brian Neil},
    Booktitle = {Proc. ACM International Workshop on UnderWater Networks (WUWNet)},
    Keywords = {DTN; underwater; wireless; DOME},
    Month = {September},
    Pages = {17--24},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/Partan_WUWNet_2006.pdf},
    Sponsors = {CNS-0519881 and N00014-05-G-0106-0008},
    Title = {{A Survey of Practical Issues in Underwater Networks}},
    Url = {http://forensics.umass.edu/pubs/partan.wuwnet2006.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/partan.wuwnet2006.pdf}}

    [link][PDF]

  • @inproceedings{Piro:2006,
    Abstract = {Mobility is often a problem for providing security services in ad hoc networks. In this paper, we show that mobility can be used to enhance security. Specifically, we show that nodes that passively monitor traffic in the network can detect a Sybil attacker that uses a number of network identities simultaneously. We show through simulation that this detection can be done by a single node, or that multiple trusted nodes can join to improve the accuracy of detection. We then show that although the detection mechanism will falsely identify groups of nodes traveling together as a Sybil attacker, we can extend the protocol to monitor collisions at the MAC level to differentiate between a single attacker spoofing many addresses and a group of nodes traveling in close proximity.},
    Author = {Piro, Chris and Shields, Clay and Brian Neil Levine},
    Booktitle = {Proc. IEEE/ACM International Conference on Security and Privacy in Communication Networks (SecureComm)},
    Keywords = {security; Sybil attack; wireless},
    Month = {August},
    Pages = {1--11},
    Sponsors = {NSF-0133055 and NSF-0534618 and NSF-0087639},
    Title = {{Detecting the Sybil Attack in Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/piro.securecomm2006.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/piro.securecomm2006.pdf}}

    [link][PDF]

  • @inproceedings{Burns:2006,
    Abstract = {Mobile robots have successfully solved many real world problems. In the following we present the use of mobile robots to address the novel and challenging problem of providing disruption tolerant network service. In disruption tolerant networks, all messages are transported by the physical motion of participants in the network. When these movements do not meet the service demands of the network, network performance can only be improved by adding robots that provide additional network service. The task of controlling such robots is a problem that is NP-Hard. To develop an approximate solution, we propose a nullspace-based algorithm for controlling the motion of the added robots. This controller simultaneously optimizes multiple network performance metrics. Experiments that simulate the addition of robots to a real-world disruption tolerant network show that the introduction of mobile robots running our control scheme can significantly improve the performance and service guarantees of a disruption tolerant network.},
    Author = {Burns, Brendan and Brock, Oliver and Levine, Brian Neil},
    Booktitle = {Proc. IEEE International Conference on Robotics and Automation},
    Keywords = {DTN; wireless; routing; DOME},
    Month = {May},
    Pages = {2105--2110},
    Sponsors = {NSF-0519881 and NSF-0080199},
    Title = {{Autonomous Enhancement of Disruption Tolerant Networks}},
    Url = {http://forensics.umass.edu/pubs/bburns.icra2006.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bburns.icra2006.pdf}}

    [link][PDF]

  • @inproceedings{Burgess:2006,
    Annote = {Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited duration. In this paper, we propose MaxProp, a protocol for effective routing of DTN messages. MaxProp is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according to historical data and also on several complementary mechanisms, including acknowledgments, a head-start for new packets, and lists of previous intermediaries. Our evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers. Our evaluations are based on 60 days of traces from a real DTN network we have deployed on 30 buses. Our network, called UMassDieselNet, serves a large geographic area between five colleges. We also evaluate MaxProp on simulated topologies and show it performs well in a wide variety of DTN environments. },
    Author = {Burgess, John and Gallagher, Brian and Jensen, David and Levine, Brian Neil},
    Booktitle = {Proc. IEEE INFOCOM},
    Keywords = {DTN; wireless; routing; Synthesis project; DOME; Award Paper},
    Month = {April},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/Burgess.Infocom.2006.slides.pdf},
    Sponsors = {C-36-B82-S1 and CNS-0519881 and NSF-0080199},
    Title = {{MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks (2017 Test of Time Award Winner)}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/burgess.infocom2006.pdf},
    Year = {2006},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/burgess.infocom2006.pdf}}

    [link][PDF]

  • @inproceedings{Yurkewych:2005,
    Abstract = {We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated for work). We study the cost of implementing redundant task allocation (redundancy, for short) as a means of preventing cheating. Under the assumption that clients are motivated solely by the desire to maximize expected profit, we prove that, within this framework, redundancy is cost effective only when collusion among clients, including the Sybil attack, can be prevented. We show that in situations where this condition cannot be met, non-redundant task allocation is much less costly than redundancy.},
    Author = {Yurkewych, Matthew and Levine, Brian Neil and Rosenberg, Arnold L.},
    Booktitle = {Proc. ACM Conference on Computer and Communications Security (CCS)},
    Keywords = {security; peer-to-peer; Sybil attack; Synthesis project},
    Month = {November},
    Pages = {280--288},
    Sponsors = {NSF-0133055},
    Title = {{On the Cost-Ineffectiveness of Redundancy in Commercial P2P Computing}},
    Url = {http://forensics.umass.edu/pubs/yurkewych.ccs.2005.pdf},
    Year = {2005},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/yurkewych.ccs.2005.pdf}}

    [link][PDF]

  • @inproceedings{Fast:2005,
    Author = {Fast, Andrew and Jensen, David and Levine, Brian Neil},
    Booktitle = {Proc. ACM Intl. Conf. on Knowledge Discovery in Data Mining (KDD)},
    Keywords = {peer-to-peer},
    Month = {August},
    Pages = {568--573},
    Title = {{Creating Social Networks to Improve Peer-to-Peer Networking}},
    Url = {http://forensics.umass.edu/pubs/fast-et-al-kdd2005.pdf},
    Year = {2005},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/fast-et-al-kdd2005.pdf}}

    [link][PDF]

  • @inproceedings{St.-John:2005,
    Abstract = {We present Ghost, a peer-to-peer game architecture that manages game consistency across a set of players with heterogeneous network resources. Ghost dynamically creates responsive sub-games based on the delay profiles of players. Ghost allows each user to set the quality of game they are willing to play and creates the maximum-sized game that satisfies the users' requirements. Ghost extends our earlier Asynchronous Synchronization (AS) protocol, which provides cheat-free playout for peer-to-peer games. This modification to AS enables p2p games to efficiently function in network environments that would typically be hostile to multiplayer networked games. These include networks with highly variable delays and variable route partitions. Our evaluation shows that Ghost performs well, always ensuring consistent p2p play with the maximum number of players, while preventing any one player from destroying the quality of play for others.},
    Author = {{St. John}, Aaron and Levine, Brian Neil},
    Booktitle = {Proc. ACM Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV)},
    Keywords = {peer-to-peer; gaming},
    Month = {June},
    Pages = {1--6},
    Sponsors = {NSF-0133055 and NSF-0323597 and NSF-0080199},
    Title = {{Supporting P2P Gaming When Players Have Heterogeneous Resources}},
    Url = {http://forensics.umass.edu/pubs/stjohn.nossdav.2005.pdf},
    Year = {2005},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/stjohn.nossdav.2005.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]

  • @techreport{Zhou:2005,
    Author = {Zhou, Yun and Levine, Brian Neil and Croft, W. Bruce},
    Institution = {University of Massachusetts Amherst},
    Keywords = {DTN; information retrieval; DOME},
    Month = {March},
    Number = {IR-412},
    Pdf_Url = {http://maroo.cs.umass.edu/pub/web/getpdf.php?id=556},
    Title = {{Distributed Information Retrieval For Disruption-Tolerant Mobile Networks}},
    Type = {CIIR Technical Report},
    Year = {2005}}

    [link]

  • @article{Sanzgiri:2005,
    Abstract = {Initial work in ad hoc routing has considered only the problem of providing efficient mechanisms for finding paths in very dynamic networks, without considering security. Because of this, there are a number of attacks that can be used to manipulate the routing in an ad hoc network. In this paper, we describe these threats, specifically showing their effects on AODV and DSR. Our protocol, named Authenticated Routing for Ad hoc Networks (ARAN), uses public-key cryptographic mechanisms to defeat all identified attacks. We detail how ARAN can secure routing in environments where nodes are authorized to participate but untrusted to cooperate, as well as environments where participants do not need to be authorized to participate. Through both simulation and experimentation with our publicly-available implementation, we characterize and evaluate ARAN and show that it is able to effectively and efficiently discover secure routes within an ad hoc network.},
    Author = {Sanzgiri, Kimaya and Dahill, Bridget and LaFlamme, Daniel and Levine, Brian Neil and Shields, Clay and Belding-Royer, Elizabeth},
    Journal = {IEEE/ACM Journal of Selected Areas in Communications: Special issue on Wireless Ad hoc Networks (JSAC)},
    Keywords = {wireless; security; routing; Journal Paper},
    Month = {March},
    Number = {3},
    Pages = {598--610},
    Sponsors = {NSF-522564 and NSF-0080199 and 2000-DT-CX-K001},
    Title = {{Authenticated Routing for Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/aran_jsac05.pdf},
    Volume = {23},
    Year = {2005},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/aran_jsac05.pdf}}

    [link][PDF]

  • @inproceedings{Burns:2005,
    Abstract = {Disruption-Tolerant networks (DTNs) differ from other types of networks in that capacity is exclusively created by the movements of participants. This implies that understanding and influencing the participants' motions can have a significant impact on network performance. In this paper, we introduce the routing protocol MV, which learns structure in the movement patterns of network participants and uses it to enable informed message passing. We also propose the introduction of autonomous agents as additional participants in DTNs. These agents adapt their movements in response to variations in network capacity and demand. We use multi-objective control methods from robotics to generate motions capable of optimizing multiple network performance metrics simultaneously. We present experimental evidence that these strategies, individually and in conjunction, result in significant performance improvements in DTNs.},
    Author = {Burns, Brendan and Brock, Oliver and Levine, Brian Neil},
    Booktitle = {Proc. IEEE INFOCOM},
    Keywords = {routing; DTN;wireless; Synthesis project; DOME},
    Month = {March},
    Pages = {398--408},
    Sponsors = {NSF-0133055 and NSF-0080199},
    Title = {{\emph{MV} Routing and Capacity Building in Disruption Tolerant Networks}},
    Url = {http://forensics.umass.edu/pubs/bburns.infocom.2005.pdf},
    Year = {2005},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bburns.infocom.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{Margolin:2004,
    Abstract = {Once electronic content has been released it is very difficult to prevent copies of the content from being widely distributed. Such distribution can cause economic harm to the content's copyright owner and others. Our protocol, SPIES, allows one party to sell a secret to second party and provides an economic incentive for two parties to limit sharing of a secret between themselves. We do not use watermarking or traditional DRM mechanisms. We focus on content which is to be shared between two parties only, which is valuable, and which only needs to be protected for a limited amount of time. Examples include passwords to a subscription service, pre-release of media for review, or content shared but bound by a non-disclosure agreement. With SPIES, any possesor of the content can receive a portion of the funds placed in escrow by the two legitimate possesors. We analyze this system and show that the best strategy of the content provider and content consumer to maximize their utility is to use SPIES and not share the content further. We deal successfully with a ``dummy registration'' attack in which multiple false identities are used in an attempt to get a higher payment. We also discuss how to determine the correct escrow amount. },
    Author = {Margolin, N. Boris and Wright, Matthew and Levine, Brian Neil},
    Booktitle = {Proc.~ACM Digital Rights Management Workshop (DRM)},
    Keywords = {security; Sybil attack},
    Month = {October},
    Pages = {22--30},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/margolin.drm_2004.pdf},
    Sponsors = {NSF-0133055 and NSF-0087482 and NSF-0080199},
    Title = {{Analysis of an Incentives-based Protection System}},
    Url = {http://forensics.umass.edu/pubs/margolin.drm2004.pdf},
    Year = {2004},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/margolin.drm2004.pdf}}

    [link][PDF]

  • @article{Arnold:2004,
    Author = {Arnold, Jeffrey and Levine, Brian Neil and Manmatha, R. and Lee, F. and Shenoy, Prashant and Tsai, M.-C. and Ibrahim, T.K. and OBrien, D. and Walsh, D.A.},
    Journal = {Journal of Prehospital and Disaster Medicine},
    Keywords = {wireless; peer-to-peer; DTN; Journal Paper; DOME},
    Month = {July},
    Number = 3, Pages = {201--207},
    Title = {{Information Sharing in Out-of-Hospital Disaster Response: The Future Role of Information Technology}},
    Url = {https://www.ncbi.nlm.nih.gov/pubmed/15571195},
    Volume = {19},
    Year = {2004},
    Bdsk-Url-1 = {https://www.ncbi.nlm.nih.gov/pubmed/15571195}}

    [link][PDF]

  • @inproceedings{Zhang:2004,
    Author = {Zhang, Haizheng and Croft, W. Bruce and Levine, Brian Neil and Lesser, Victor},
    Booktitle = {Proc.~Intl. Joint Conf. on Autonomous Agents and MultiAgent Systems},
    Keywords = {peer-to-peer; Synthesis project; information retrieval},
    Month = {July},
    Pages = {456--464},
    Title = {{A Multi-agent Approach for Peer-to-Peer based Information Retrieval System}},
    Url = {http://forensics.umass.edu/pubs/haizheng-aamas04.pdf},
    Year = {2004},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/haizheng-aamas04.pdf}}

    [link][PDF]

  • @inproceedings{Chu:2004a,
    Annote = {Although peer-to-peer networking applications continue to increase in popularity, there have been few measurement studies of their performance. We present the first study of the popularity of files stored and transferred among peers in Napster and Gnutella over month-long periods. Our analysis indicates that the popularity of files is skewed in all four cases and fits well to a log-quadratic distribution. This predicts that caches of the most popular songs would increase performance of the system. We also took baseline measurements of file types and sizes for comparison over time with future studies. Not surprisingly, audio files are most popular, however a significant fraction of stored data is occupied by videos. Finally, we measured the distribution of time peers in Gnutella were available for downloading. We found that node availability is strongly influenced by time-of-day effects, and that most user's tend to be available for only very short contiguous lengths of time.},
    Author = {Chu, Jacky and Labonte, Kevin and Levine, Brian Neil},
    Booktitle = {Proc.\ ACM SIGMETRICS},
    Keywords = {peer-to-peer},
    Month = {June},
    Pages = {432--433},
    Sponsors = {NSF-0133055 and NSF-0080119},
    Title = {{An Evaluation of Chord Using Traces of Peer-to-Peer File Sharing (extended abstract)}},
    Url = {http://forensics.umass.edu/pubs/chu.labonte.p2pjournal.pdf},
    Year = {2004},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/chu.labonte.p2pjournal.pdf}}

    [link][PDF]

  • @techreport{Bellissimo:2004,
    Address = {Dept. of Computer Science},
    Author = {Bellissimo, Anthony and Shenoy, Prashant and Levine, Brian Neil},
    Institution = {University of Massachusetts Amherst},
    Keywords = {peer-to-peer},
    Month = {June},
    Number = {04-41},
    Tech_Report_Url = {http://forensics.umass.edu/pubs/bellissimo.bittorrent.pdf},
    Title = {{Exploring the Use of BitTorrent as the Basis for a Large Trace Repository}},
    Year = {2004}}

    [link]

  • @inproceedings{Margolin:2004b,
    Abstract = {Once electronic content has been released, it is very difficult to prevent perfect copies of the content from being widely distributed, which can cause economic harm to the content's owner and others. We focus on content which is to be shared to a limited extent, which is valuable, and which only needs to be protected for a limited amount of time, such as trade secrets. For such content we provide an economic incentive to limit sharing, without using DRM or watermarking. In our protocol, a quantity of money is placed in escrow, and anyone can get a portion of it by providing proof of knowledge of the content. Since payments become smaller as more individuals give proof, it is in the interest of those with access to the content to prevent further sharing. },
    Author = {Margolin, N. Boris and Wright, Matthew and Levine, Brian Neil},
    Booktitle = {Proc.~ Workshop on the Economics of Peer-to-Peer Systems (p2pEcon)},
    Keywords = {security; Sybil attack},
    Month = {June},
    Sponsors = {NSF-0087482 and NSF-0133055 and NSF-0080119},
    Title = {{SPIES: Secrets Protection Incentives-based Escrow System}},
    Url = {http://forensics.umass.edu/pubs/margolin.p2pecon2004.pdf},
    Year = {2004},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/margolin.p2pecon2004.pdf}}

    [link][PDF]

  • @techreport{LaFlamme:2004,
    Address = {Dept. of Computer Science},
    Author = {LaFlamme, Daniel and Levine, Brian Neil},
    Institution = {University of Massachusetts Amherst},
    Keywords = {security; Tech report},
    Month = {March},
    Number = {04-11},
    Tech_Report_Url = {http://forensics.umass.edu/pubs/laflamme.tr-04-11.pdf},
    Title = {{Surviving Attacks on DNS using Ubiquitous Replication}},
    Year = {2004}}

    [link]

  • @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{Hanna:2003,
    Abstract = {We propose and evaluate a mobile, peer-to-peer Information Retrieval system. Such a system can, for example, support medical care in a disaster by allowing access to a large collections of medical literature. In our system, documents in a collection are replicated in an overlapping manner at mobile peers. This provides resilience in the face of node failures, malicious attacks, and network partitions. We show that our design manages the randomness of node mobility. Although nodes contact only direct neighbors (who change frequently) and do not use any ad hoc routing, the system maintains good IR performance. This makes our design applicable to mobility situations where routing partitions are common. Our evaluation shows that our scheme provides significant savings in network costs, and increased access to information over ad-hoc routing-based approaches; nodes in our system require only a modest amount of additional storage on average.},
    Author = {Hanna, Katrina M. and Levine, Brian Neil and Manmatha, R.},
    Booktitle = {Proc. IEEE Intl. Conference on Network Protocols (ICNP)},
    Keywords = {routing; DTN; wireless; Synthesis project; information retrieval; DOME},
    Month = {November},
    Pages = {38--47},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/hanna.p2pir.icnp_2003.pdf},
    Sponsors = {NSF-0133055 and NSF-9983215 and NSF-0080199},
    Title = {{Mobile Distributed Information Retrieval For Highly Partitioned Networks}},
    Url = {http://forensics.umass.edu/pubs/hanna.icnp03.pdf},
    Year = {2003},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/hanna.icnp03.pdf}}

    [link][PDF]

  • @article{Levine:2001,
    Author = {Levine, Brian Neil and Paul, Sanjoy and Garcia-Luna-Aceves, J.J.},
    Journal = {ACM/Springer Multimedia Systems Journal},
    Keywords = {multicast; Journal Paper},
    Month = {July},
    Number = 1, Pages = {3--14},
    Title = {{Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation}},
    Url = {http://forensics.umass.edu/pubs/brian.tracer.mmsj.pdf},
    Volume = 9, Year = {2003},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.tracer.mmsj.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]

  • @inproceedings{Bernstein:2003,
    Abstract = {In a peer-to-peer file-sharing system, a client desiring a particular file must choose a source from which to download. The problem of selecting a good data source is difficult because some peers may not be encountered more than once, and many peers are on low-bandwidth connections. Despite these facts, information obtained about peers just prior to the download can help guide peer selection. A client can gain additional time savings by aborting bad download attempts until an acceptable peer is discovered. We denote as peer selection the entire process of switching among peers and finally settling on one. Our main contribution is to use the methodology of machine learning for the construction of good peer selection strategies from past experience. Decision tree learning is used for rating peers based on low-cost information, and Markov decision processes are used for deriving a policy for switching among peers. Preliminary results with the Gnutella network demonstrate the promise of this approach. },
    Author = {Bernstein, Daniel and Feng, Zhengzhu and Levine, Brian Neil and Zilberstein, Shlomo},
    Booktitle = {Proc. Intl. Workshop on Peer-to-Peer Systems (IPTPS)},
    Keywords = {peer-to-peer; Synthesis project},
    Month = {February},
    Pages = {237--246},
    Sponsors = {NSF-0133055 and NSF-0080119},
    Title = {{Adaptive Peer Selection}},
    Url = {http://forensics.umass.edu/pubs/bernstein.iptps.pdf},
    Year = {2003},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/bernstein.iptps.pdf}}

    [link][PDF]

  • @inproceedings{Sanzgiri:2002,
    Author = {Sanzgiri, Kimaya and Dahill, Bridget and Levine, Brian Neil and Shields, Clay and Belding-Royer, Elizabeth},
    Booktitle = {Proc. of IEEE International Conference on Network Protocols (ICNP)},
    Keywords = {security; wireless; routing},
    Month = {November},
    Pages = {78--89},
    Plagiarized_Url = {http://forensics.umass.edu/pubs/aran.comparison.IJCNIS-V4-N12-7.pdf},
    Sponsor = {ANI-522564, ANI-522564, EIA-0080199, and 2000-DT-CX-K001},
    Title = {{A Secure Routing Protocol for Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/aran.icnp02.pdf},
    Year = {2002},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/aran.icnp02.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{Chu:2002,
    Abstract = {Although peer-to-peer networking applications continue to increasein popularity, there have been few measurement studies of their performance. We present the first study of the locality of files stored and transferred among peers in Napster and Gnutella over month-long periods. Our analysis indicates that the locality of files is skewed in all four cases and fits well to a log-quadratic distribution. This predicts that caches of the most popular songs would increase performance of the system. We also took baseline measurements of file types and sizes for comparison over time with future studies. Not surprisingly, audio files are most popular, however a significant fraction of stored data is occupied by videos. Finally, we measured the distribution of time peers in Gnutella were available for downloading. We found that node availability is strongly influenced by time-of-day effects, and that most user's tend to be available for only very short contiguous lengths of time.},
    Author = {Chu, Jacky and Labonte, Kevin and Levine, Brian Neil},
    Booktitle = {Proc.\ ITCom: Scalability and Traffic Control in IP Networks II Conference},
    Keywords = {peer-to-peer},
    Month = {July},
    Pages = {310--321},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/chu.labonte.spie.2002.pdf},
    Title = {{Availability and Locality Measurements of Peer-to-Peer File Systems}},
    Url = {http://forensics.umass.edu/pubs/chu.labonte.spie.pdf},
    Volume = {SPIE 4868},
    Year = {2002},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/chu.labonte.spie.pdf}}

    [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{Hanna:2001,
    Author = {Hanna, Katrina M. and Natarajan, Nandini and Levine, Brian Neil},
    Booktitle = {Proc. IEEE Intl. Conference on Network Protocols (ICNP)},
    Keywords = {peer-to-peer},
    Month = {November},
    Pages = {290--300},
    Title = {{Evaluation of a Novel Two-Step Server Selection Metric}},
    Url = {http://forensics.umass.edu/pubs/hanna.nan.icnp01.pdf},
    Year = {2001},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/hanna.nan.icnp01.pdf}}

    [link][PDF]

  • @inproceedings{Davis:2001,
    Author = {Davis, James and Fagg, Andy and Levine, Brian Neil},
    Booktitle = {Proc.~IEEE Intl. Symp on Wearable Computers (ISWC)},
    Keywords = {wireless; DTN; routing; Synthesis project; DOME},
    Month = {October},
    Pages = {141--148},
    Title = {{Wearable Computers and Packet Transport Mechanisms in Highly Partitioned Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/iswc01_pednet.pdf},
    Year = {2001},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/iswc01_pednet.pdf}}

    [link][PDF]

  • @inproceedings{Baughman:2001,
    Author = {Baughman, Nathaniel E. and Levine, Brian Neil},
    Booktitle = {Proc. IEEE Infocom},
    Keywords = {peer-to-peer; gaming;security},
    Month = {April},
    Pages = {104--113},
    Title = {{Cheat-Proof Playout for Centralized and Distributed Online Games}},
    Url = {http://forensics.umass.edu/pubs/baughman.infocom01.pdf},
    Year = {2001},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/baughman.infocom01.pdf}}

    [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]

  • @inproceedings{Walz:2000,
    Author = {Walz, Joerg and Levine, Brian Neil},
    Booktitle = {Proc.~Intl. Workshop on Networked Group Communication (NGC)},
    Keywords = {multicast},
    Month = {November},
    Pages = {105--116},
    Title = {{A Hierarchical Multicast Monitoring Scheme}},
    Url = {http://forensics.umass.edu/pubs/joerg.ngc00.pdf},
    Year = {2000},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/joerg.ngc00.pdf}}

    [link][PDF]

  • @inproceedings{Levine:2000,
    Author = {Levine, Brian Neil and Crowcroft, Jon and Diot, Christophe and Aceves, J.J. Garcia-Luna and Kurose, Jim},
    Booktitle = {Proc.~IEEE Infocom},
    Keywords = {multicast},
    Month = {March},
    Pages = {470--479},
    Plagiarized_Url = {http://forensics.umass.edu/pubs/brian.infocom2000.plagiarized.pdf},
    Title = {{Consideration of Receiver Interest for IP Multicast Delivery}},
    Url = {http://forensics.umass.edu/pubs/brian.infocom2000.pdf},
    Year = {2000},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.infocom2000.pdf}}

    [link][PDF]

  • @article{Diot:2000,
    Author = {Diot, Christophe and Levine, Brian Neil and Lyles, Bryan and Kassan, H. and Balsiefien, D.},
    Journal = {IEEE Network: Special Issue on Multicasting},
    Keywords = {multicast; Journal Paper},
    Month = {January},
    Number = 1, Pages = {78--88},
    Title = {{Deployment Issues for the {IP} Multicast Service and Architecture}},
    Url = {http://forensics.umass.edu/pubs/brian.ieeenetwork00.pdf},
    Volume = 14, Year = {2000},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.ieeenetwork00.pdf}}

    [link][PDF]

  • @inbook{Levine:1999b,
    Author = {Levine, Brian Neil and Diot, Christophe and Huitema, Christian},
    Chapter = {{11: IP Multicast Routing}},
    Edition = {Second},
    Keywords = {multicast},
    Month = {November},
    Pages = {235--260},
    Publisher = {Pearson Education},
    Title = {Routing in the Internet},
    Year = {1999}}

    [link]

  • @phdthesis{Levine:1999a,
    Address = {Santa Cruz, CA},
    Author = {Levine, Brian Neil},
    Keywords = {multicast; routing; thesis},
    Month = {June},
    School = {Computer Engineering, University of California},
    Title = {{Network Support for Group Communication}},
    Url = {http://forensics.umass.edu/pubs/brian.phd.pdf},
    Year = {1999},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.phd.pdf}}

    [link][PDF]

  • @inproceedings{Levine:1998a,
    Author = {Levine, Brian Neil and Paul, Sanjoy and Garcia-Luna-Aceves, J.J.},
    Booktitle = {Proc. ACM Multimedia},
    Keywords = {multicast},
    Month = {September},
    Pages = {201--210},
    Title = {{Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation}},
    Url = {http://forensics.umass.edu/pubs/brian.mm98.pdf},
    Year = {1998},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.mm98.pdf}}

    [link][PDF]

  • @article{Levine:1998,
    Author = {Levine, Brian Neil and Garcia-Luna-Aceves, J.J.},
    Journal = {ACM/Springer Multimedia Systems Journal},
    Keywords = {multicast; Journal Paper},
    Month = {August},
    Number = 5, Pages = {334--348},
    Title = {{A Comparison of Reliable Multicast Protocols}},
    Url = {http://forensics.umass.edu/pubs/brian.mmsj.pdf},
    Volume = 6, Year = {1998},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.mmsj.pdf}}

    [link][PDF]

  • @inproceedings{Levine:1997,
    Author = {Levine, Brian Neil and Garcia-Luna-Aceves, J.J.},
    Booktitle = {Proc.~IEEE International Conference on Network Protocols (ICNP)},
    Keywords = {multicast; routing},
    Month = {October},
    Pages = {241--50},
    Title = {{Improving Internet Multicast with Routing Labels}},
    Url = {http://forensics.umass.edu/pubs/brian.icnp97.pdf},
    Year = {1997},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.icnp97.pdf}}

    [link][PDF]

  • @inbook{Garcia-Luna-Aceves:1997aCh6,
    Author = {Garcia-Luna-Aceves, J.J. and Levine, Brian Neil},
    Chapter = {{6: End-to-End Reliable Multicast}},
    Keywords = {multicast},
    Month = {September},
    Pages = {169--191},
    Publisher = {Prentice-Hall},
    Title = {Multimedia Communications: Protocols and Applications},
    Year = {1997}}

    [link]

  • @inproceedings{Levine:1996a,
    Author = {Levine, Brian Neil and Lavo, D. and Garcia-Luna-Aceves, J.J.},
    Booktitle = {Proc.~{ACM} Multimedia},
    Keywords = {multicast},
    Month = {November},
    Pages = {365--376},
    Title = {{The Case for Reliable Concurrent Multicasting Using Shared Ack Trees}},
    Url = {http://forensics.umass.edu/pubs/brian.mm96.pdf},
    Year = {1996},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.mm96.pdf}}

    [link][PDF]

  • @inproceedings{Levine:1996,
    Author = {Levine, Brian Neil and Garcia-Luna-Aceves, J.J.},
    Booktitle = {Proc.~IEEE International Conference on Network Protocols (ICNP)},
    Keywords = {multicast},
    Month = {October},
    Pages = {112--121},
    Title = {{A Comparison of Known Classes of Reliable Multicast Protocols}},
    Url = {http://forensics.umass.edu/pubs/brian.icnp.pdf},
    Year = {1996},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.icnp.pdf}}

    [link][PDF]

  • @mastersthesis{Levine:1996b,
    Address = {Santa Cruz, CA},
    Author = {Levine, Brian Neil},
    Keywords = {multicast; thesis},
    Month = {June},
    School = {Computer Engineering, University of California},
    Title = {{A Comparison of Known Classes of Reliable Multicast Protocols}},
    Url = {http://forensics.umass.edu/pubs/brian.masters.pdf},
    Year = {1996},
    Bdsk-Url-1 = {http://forensics.umass.edu/pubs/brian.masters.pdf}}

    [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