Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Brian Lynn

dblp:50/4918 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Digital forensics and information hiding · 76% Network security · 24%
Computer networks
1 paper
Network measurement and analytics · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
digital forensics
0.832020
A Forensically Sound Method of Identifying Downloaders and Uploaders in Freenet · CCS 2020
Efficient Tagging of Remote Peers during Child Pornography Investigations · IEEE Trans. Dependable Secur. Comput. 2014
Measurement and analysis of child pornography trafficking on P2P networks · WWW 2013
Digital forensics and information hiding › digital forensics
network forensics
0.212014
Efficient Tagging of Remote Peers during Child Pornography Investigations · IEEE Trans. Dependable Secur. Comput. 2014
Network security
traffic analysis
0.212014
Efficient Tagging of Remote Peers during Child Pornography Investigations · IEEE Trans. Dependable Secur. Comput. 2014
Network measurement and analytics › internet measurement
peer-to-peer network measurement
0.212013
Measurement and analysis of child pornography trafficking on P2P networks · WWW 2013
Network security
anonymity networks
0.112020
A Forensically Sound Method of Identifying Downloaders and Uploaders in Freenet · CCS 2020
Digital forensics and information hiding
criminal network analysis
0.012013
Measurement and analysis of child pornography trafficking on P2P networks · WWW 2013
Storage systems › i/o architecture › i/o subsystem
asynchronous i/o
0.012006
Evaluating network processing efficiency with processor partitioning and asynchronous I/O · EuroSys 2006

Methods — techniques the papers use, named apart from their topics

traffic analysis · 0.4hypothesis testing · 0.4network measurement · 0.3forensic tools · 0.3network-level identifier analysis · 0.2application-level identifier analysis · 0.2performance analysis · 0.1AIO programming interface · 0.1
YearPublicationVenuePosition
2020 A Forensically Sound Method of Identifying Downloaders and Uploaders in Freenet
abstract
The creation and distribution of child sexual abuse materials (CSAM) involves a continuing violation of the victims? privacy beyond the original harms they document. A large volume of these materials is distributed via the Freenet anonymity network: in our observations, nearly one third of requests on Freenet were for known CSAM. In this paper, we propose and evaluate a novel approach for investigating these violations of exploited childrens' privacy. Our forensic method distinguishes whether or not a neighboring peer is the actual uploader or downloader of a file or merely a relayer. Our method requires analysis of the traffic sent to a single, passive node only. We evaluate our method extensively. Our in situ measurements of actual CSAM requests show an FPR of 0.002 ± 0.003 for identifying downloaders. And we show an FPR of 0.009 ± 0.018, a precision of 1.00 ± 0.01, and a TPR of 0.44 ± 0.01 for identifying uploaders based on in situ tests. Further, we derive expressions for the FPR and Power of our hypothesis test; perform simulations of single and concurrent downloaders; and characterize the Freenet network to inform parameter selection. We were participants in several United States Federal Court cases in which the use of our method was uniformly upheld.
Brian Neil Levine, Marc Liberatore, Brian Lynn, Matthew Wright 0001
CCS3
2014 Efficient Tagging of Remote Peers during Child Pornography Investigations
abstract
Measurements of the Internet for law enforcement purposes must be forensically valid. We examine the problems inherent in using various network- and application-level identifiers in the context of forensic measurement, as exemplified in the policing of peer-to-peer file sharing networks for sexually exploitative imagery of children. First, we present a one-year measurement performed in the law enforcement context. Our proposed tagging method offers remote machines application- or system-level data that is valid, but which covertly has meaning to investigators. This tagging allows investigators to link network observations with physical evidence in a legal, forensically strong, and valid manner. We present a detailed model and analysis of our method, show how tagging can be used in several specific applications, discuss the general applicability of our method, and detail why the tags are strong evidence of criminal intent and participation in a crime. We then describe the tagging mechanisms that have we implemented using the eMule file sharing client.
Marc Liberatore, Brian Neil Levine, Clay Shields, Brian Lynn
IEEE Trans. Dependable Secur. Comput.4
2013 Measurement and analysis of child pornography trafficking on P2P networks
abstract
Peer-to-peer networks are the most popular mechanism for the criminal acquisition and distribution of child pornography (CP). In this paper, we examine observations of peers sharing known CP on the eMule and Gnutella networks, which were collected by law enforcement using forensic tools that we developed. We characterize a year's worth of network activity and evaluate different strategies for prioritizing investigators' limited resources. The highest impact research in criminal forensics works within, and is evaluated under, the constraints and goals of investigations. We follow that principle, rather than presenting a set of isolated, exploratory characterizations of users.
Ryan Hurley, Swagatika Prusty, Hamed Soroush, Robert J. Walls, Jeannie R. Albrecht, Emmanuel Cecchet, Brian Neil Levine, Marc Liberatore, Brian Lynn, Janis Wolak
WWW9
2006 Evaluating network processing efficiency with processor partitioning and asynchronous I/O
abstract
Applications requiring high-speed TCP/IP processing can easily saturate a modern server. We and others have previously suggested alleviating this problem in multiprocessor environments by dedicating a subset of the processors to perform network packet processing. The remaining processors perform only application computation, thus eliminating contention between these functions for processor resources. Applications interact with packet processing engines (PPEs) using an asynchronous I/O (AIO) programming interface which bypasses the operating system. A key attraction of this overall approach is that it exploits the architectural trend toward greater thread-level parallelism in future systems based on multi-core processors. In this paper, we conduct a detailed experimental performance analysis comparing this approach to a best-practice configured Linux baseline system.
Tim Brecht, G. John Janakiraman, Brian Lynn, Vikram A. Saletore, Yoshio Turner
EuroSys3