SPECIAL REPORT

OF THE

RESEARCH COUNCIL

concerning

CREATION OF THE UMASS CYBERSECURITY INSTITUTE IN THE

COLLEGE OF INFORMATION AND COMPUTER SCIENCES (#6275)

Presented at the 794th Regular Meeting of the Faculty Senate

March 12, 2020

RESEARCH COUNCIL MEMBERSHIP

Dominique Alfandari, MJ Alhabeeb, Michelle Budig, Leslie Button, Lisa Chasan-Taber, Carey Clouse, E. Bryan Coughlin, Robert DeConto, Jennifer Donais, Janet Fink, Lori Goldner, Michelle Hosp, Paul Katz, James Kitts, Barbara Krauthamer, Michael Malone, Jason Moralee, J. Eliot Moss, Simon Neame, Martina Nieswandt, Jennifer Normanly, MJ Peterson, Sarah Poissant, Ashwin Ramasubramaniam, Peter Reinhart,Alexander Ribbe, Brian Shelburne, Carol Sprague, Maria Tymoczko, Rachel Walker, Annette Wysocki

COUNCIL RECOMMENDATION

The Research Council endorses granting permanent approval to the Cybersecurity Institute (CSI), which is already operating on the University of Massachusetts Amherst campus. In consultation with the CSI Director, VCRE, and Provost, we recommend that CSI be approved as a Center affiliated with the College of Information and Computer Sciences (CICS), reporting to the CICS Dean, and following established policies regarding the management and oversight of Centers. We recommend that the Faculty Senate approve the Cybersecurity Institute name.

GENERAL QUESTIONS:

1. Is this proposal for a Center or an Institute?Institute

2. Proposed Title of Institute/CenterUMass Cybersecurity Institute

Sen. Doc. No. 20-074

3. What is the School/College or other major budgetary unit that this center or institutewill be a part of?

College of Information and Computer Sciences

4. What are the names of the Center/Institute directors or other responsible persons?Brian Levine

5. What is the mailing address, telephone number of director(s) or responsibleperson(s)?

140 Governors Drive, Amherst, MA 413-577-0238

6. What is the proposed starting date?Now

PROPOSAL DESCRIPTION:

1. Please provide a brief description (60 words or less) of the proposed enterprise(name, basic mission, activity scope, clientele).

Faculty and students who are part of the Institute work in research areas spanning security and privacy challenges in networking and communications, embedded systems, data privacy, software engineering, software systems, applied cryptography, and more. "Security for the Common Good" is the guiding principle of the Institute's efforts in research and education.

2. What are the rationale and justification (mission, goals, objectives, relation tocampus goals, needs addressed, population served, resources obtained)?

The Institute contributes to the mission of the campus in several ways. Security is critical to every person, industry, and government in the world today, and our research projects have had enormous impact. The Institute serves the campus' educational mission as well by coordinating the curriculum and efforts of several colleges.

3. What are the specific activities planned as an on-going part of the enterprise(types, quantities of activities, meetings, publications, seminars, research)?

The Institute has several recurring activities. Each fall we run a Security Speaker Series. We support two student organizations that are focused on security. We run an NSF-supported Scholarship for Service program. The faculty involved are of course involved in a broad set of research topics. Please see the attached PDF for an overview.

4. How does this enterprise differ from other offices or activities on campus withsimilar names, missions, interests?

Sen. Doc. No. 20-074

There are no similar offices, centers, or institutes; however our efforts have synergery with centers and institutes dealing with data science and analytics because they face cybersecurity issues. We already coordinate with the Center for Data Science, for example.

INSTITUTIONAL RELATIONSHIPS AND GOVERNANCE:

1. List all University units involved and describe administrative arrangements withthem, if any.

The Institute primarily involves the College of Information and Computer Sciences and the Department of Electrical and Computer Engineering. However, faculty from other departments are members, including Mathematics & Statistics, Political Science, and Isenberg. The Institute is open to anyone with an interest in our broad field and a desire to advance societal good.

2. Describe any organizational relationships (as distinct from funding sources) withother agencies, public or private, outside the University.

The Institute is funded by a gift from the MassMutual Foundation. That award was matched by the Massachusetts Tech Collaborative (MTC). We meet regularly with the MTC. In addition, the Institute leads a 5-year NSF Scholarship for Service (SFS) program on campus, and recently submitted a proposal to NSF to renew the program. Faculty associated with the Institute have a broad set of research sponsors, including the NSF, Department of Justice, Department of State, DARPA, and private companies.

3. Describe the organization’s advisory board or other governance group.

The advisory board is the College of Information and Computer Sciences advisory board. https://www.cics.umass.edu/people/advisory

4. Will this be an institute — an independent organizational unit, acting as adepartment for purposes of non-faculty personnel actions and appointments, able to solicit its own funds without departmental head approval?

Yes

5. If a center, describe the relationship within the department or college to which thisorganization is subordinate.

N/A

6. Describe arrangements for any patent rights, copyrights, or other ownershipcomponents of activities, and any restrictions on access to research information.

Sen. Doc. No. 20-074

We follow the in-place rules and policies of the university regarding these issues. There is no need for special arrangements.

1. Describe the space available for use by the organization. (If this is not a permanentlocation, indicate other space arrangements that are to be made in the future, if known.)

The Institute is virtual but has access to space in the College of Information and Computer Sciences and the College of Engineering for seminars, meetings, talks, etc.

2. Describe any requests for space that have been made.

None.

3. Describe any repairs, renovations, major equipment needed to make the space youhave useful to the organization.

N/A

4. If University employees or students are or will be using space, describe thearrangement.

N/A

Staffing (when operation is fully developed)

1. Non-Faculty (provide rank or grade, student status, working title, FTE, source offunding).

The Institute is staffed by

- Priscilla Scott, business manager (part time)- Nancy Fontes, Clerk V (part time)

The source of funding is a long-term$3M gift from the MassMutual Foundation, as well as a profit sharing with CICS generated from managing CICS online courses.

2. Faculty involved (provide name, department, extent involved, release timearrangement, if any).

Director: Professor Brian Levine. One course release per year. Deeply involved. Many faculty are members of the institute and work on its research and educational programs. See a list here: https://infosec.cs.umass.edu/faculty/faculty-directory

Sen. Doc. No. 20-074

3. Describe how the Center or Institute may impact existing teaching responsibilities of participating faculty members through “buy-out” arrangements, reduced teaching loads, or other provisions, and how such impacts will be resolved.

Prof. Levine has teaching release of one course per year. The Institute resolves this

loss for CICS by hiring instructors to teach many courses, which more than make up for the loss of Levine's teaching.

4. Attach a detailed budget showing sources of funding, full-year basic operation costs and anticipated expenditures. (This should show programmatic expenditure descriptions, kinds of funding accounts and amounts by subsidiary accounts as well as alternative funding arrangements or programmatic adjustments to be made if funding sources fail.) ATTACHMENTS:

1. Budget Summary 2. UMass Cybersecurity Institute Document 3. Research Council Review

MOTION: That the Faculty Senate approve Creation of the UMass Cybersecurity 28-20 Institute in the College of Information and Computer Sciences, as presented

in Sen. Doc. No. 20-074.

Sen. Doc. No. 20-074

  

Budget Summary  Budget Information A. Revenues by Source    Fiscal Year 2018  Projected for Fiscal Year 

2019 Campus Funds (be specific)  None  None 

Special State Appropriation  None  None 

Grants and Contracts  None  None 

Endowment  None  None 

Private Contributions  $ 300,000 $ 300,000 Course Revenue   $ 75,630 $ 100,000 Total  $ 375,630   B. Expenses  Faculty and Instructor Salaries/Benefits 

(include release time) 

$ 203,242/ $63,560 $ 210,000 / $65,000

Staff Salaries/Benefits   $ 40,679/ $ 8,457 $ 42,000 / $ 8,500 Graduate Stipends/Benefits  $ 14,157/ $ 2,175 $ 15,000 / $ 6,000

Undergraduate Support (course asst,))

 

$ 671 $ 0

Post-Doctoral Salaries/Benefits   $ 0 $ 0 Events (e.g., meetings, symposia)  $ 0 $ 3,000 Travel   $ 0 $ 0 Other (specify) supplies, computers, 

books, etc. 

$ 13,496 $ 14,000

Total   $ 345,766 $ 363,500

   The above numbers include only expenses and revenues related to online courses and the MMF gift. Profits from individual classes are shared with the College and not listed above.    

3

Sen. Doc. No. 20-074

1 UMass Cybersecurity Institute

The UMass Cybersecurity Institute serves as an interdisciplinary focal point for cybersecurity education and training at Massachusetts’ flagship public university. The home of the CSI is the College of Information and Computer Sciences, which has as its motto, “Computing for the Common Good”. Appropriately, the CSI is also focused on efforts that have a strong, positive impact on society. Our research and education of students is guided by that principle.

1.1 Research Overview

The University of Massachusetts Amherst has a long and prestigious history as a leader in academic and applied cybersecurity. Our research in security is focused on several areas, including digital forensics, network security, signals security and covert communication, network privacy, differential privacy, data mining and causal inference, cryptography, and hardware security. UMass Amherst has an extensive record of National Science Foundation, Department of Justice, DARPA, and other external support for cybersecurity research resulting in numerous influential publications. These research contributions are in the context of strong academic programs offered by a large set of faculty working with a large student body.

Our publications have been appeared for years in prominent top-tier conferences in security, privacy, networking, hardware, and systems. In particular, our publications include topics within many “Cyber Defense” core areas. Example publications in the areas from UMass Amherst faculty include research in

• Digital Forensics and investigation of crimes against children

• Data mining, including fraud detection

• Detection and protection from Malware

• Applied Cryptography and information security

• Wireless, link, and signal security

• Database security and privacy

• Security and privacy of networks, distributed computing, OS, and infrastructure

• Personal and Societal Privacy

Faculty. UMass has a broad and deep bench of faculty with active research and teaching programsthat cover various domains in cybersecurity, and are directly involved in our Cybersecurity Institute.Over 30 faculty are part of the CSI. They teach our coursework, advise students in research, havehelped us place students, and host visiting security-related speakers.

Grants and awards. Faculty across UMass Amherst have made a strong and ongoing commitmentto cybersecurity research programs for decades. More than $5 million has been awarded to UMassAmherst each year on average over the past several years to further research in the field ofcybersecurity. These awards support an enormous number of research projects in cybersecuritythat UMass students can and have participated in. Example awards include: Internet of BattlefieldThings (IoBT-REIGN) (Army Research Labs, 9/17–9/22, $4.4M); Limits and algorithms for covertcommunications (NSF-1564067, 9/16–8/20, $1.2M); Differential privacy (DARPA Brandeis, 10/15–5/21, $1.2M); Forensic tools for child sexual exploitation investigations (OJJDP, 2018-MC-FX-K059,$750k 10/18–9/21); IoT privacy (NSF-1739462, 9/17–8/20, $1M); obfuscated hardware to thwartreverse engineering (NSF-1563829, 08/16–07/20, $1.2M); and a gift to support cybersecurity(MassMutual Foundation, 7/16–6/26,$3M).

1

Sen. Doc. No. 20-074

1.2 Academic programs

UMass offers multiple programs at the undergraduate and graduate level with a focus on cybersecu-rity.

• The College of Information and Computer Sciences (CICS) offers undergraduate and graduatecourses in computer and network security, digital forensics, computer crime law, softwareengineering, data mining, and many relevant seminars covering new topics in cybersecurity,such as privacy enhancing technologies. Our BS degree allows students to focus on security andprivacy topics, and our MS/PhD degree has a formal concentration in Security. Additionally,we offer a graduate-level certificate in Information Security that can be completed along withthe MS degree.

• The Department of Electrical and Computer Engineering (ECE) offers courses in trustworthycomputing, fault tolerant systems, and cryptography engineering, and is developing courses inIT security, network security, and embedded security at the graduate and undergraduate level;these courses will form the core of the BS and MS/PhD security tracks that scholars follow.ECE has a graduate-level certificate in Computer Systems Security that can be completed aspart of its MS degree.

CICS and ECE faculty regularly teach a variety of foundational courses at both the undergraduateand graduate levels in security, privacy, forensics, and applied cryptography. Although in separatecolleges on campus, the two departments work collaboratively to schedule classes and coordinatecurricula; degrees offered by the two departments accept courses from each other. CICS and ECEMasters and PhD students contribute to research and take coursework focused on the topics listedabove, and often undergraduates join research projects as well.

Some of the courses we offer at the undergraduate (U) and graduate level (G) across our depart-ments include: CyberEffects: reverse engineering, exploit analysis, and capability development (G);Intro to Computer and Network Security (U); Digital Forensics (U); Advanced Digital Forensics(G); Computer Crime Law (U); Internet Law and Policy (G); Introduction to Knowledge Discovery(U); Senior Capstone Design Projects in Security (U); Software Engineering (U/G); TrustworthyComputing (U/G); Crypto Engineering (U/G); Introduction to Cryptography (U/G); Security Engi-neering (U/G); Advanced Information Assurance (G); Applied Cryptography (U); Secure DistributedSystems (U/G); Detecting Interference in Networks (G); Quantum Information Systems (G); SecureDistributed Systems (U/G); Adversarial Machine Learning (G); Applied Cryptography (U); andFoundations of Applied Cryptography (G).

Scholarship For Service. The University of Massachusetts Amherst has successfully run aScholarship for Service program (DGE-156552) since January 2016. SFS is one of NSF’s premiertraining grants. To date, we have provided to each of these students, each year, full tuition and fees,a $8000 professional development fund, and a stipend of $25,000 ($34,000 for graduate students).30 students who have completed or are promised a total of 110 semesters of support.

Growth. Since 2015, UMass Amherst has added many personnel focused on security research andteaching: three tenure-track faculty (Gill, O’Neill, Holcomb), one teaching faculty (Liberatore), apermanent Research Scientist (Bissias), and two part-time lecturers (Kermani, Cable); and we lostno personnel in security. We have introduced many new courses, we now offer 5 courses online, weintroduced two graduate certificates in security, and we vastly increased the number of graduatestudents researching security.

2

Sen. Doc. No. 20-074

1.3 Institute events and activities

• New England Security Day. In Fall 2015, UMass hosted the first annual New EnglandSecurity Day, an event bringing together 110 faculty and student researchers in cybersecurityfrom across the many colleges and universities in New England and the Northeast. Abouta quarter of attendees were women. A diverse array of speakers from across the regiongave research and policy talks, students presented posters, and many great opportunities forcollaboration arose. This event, for which PI Levine founded the steering committee, occursannually and rotates around schools in New England (UMass, WPI, Harvard, Northeastern),ensuring a close connections to the regional security community.

• Hack@DAC is an event that co-PI Holcomb co-founded and co-organized in each of thelast three years. In the contest, students score points by finding and reporting securityvulnerabilities that are planted in an System-on-Chip design we provide to them. In the 2019iteration, 44 teams competed in the initial round, and the top 14 teams were invited to atwo-day real-time final round where they are given a new design to explore. The design helpstrain a workforce of security-capable design engineers.

• Cybersecurity Lecture Series. We run a lecture series each fall. In the past several years,this series has included talks from researchers and government employees on their work andresearch. Recent and upcoming speakers and visitors include employees of the U.S. Census,Office of the MA Attorney General, the NSA, Assistant Secretary of Technology of MA, andFederal Reserve Board, as well as faculty from Northeastern, Univ. of Michigan, UC SanDiego, and Bell Labs.

• UMass Amherst host an ACM Cybersecurity Club and a Penetration Testing (Pen-Test) Club, which enables students to learn security concepts outside the classroom. OurPenTest team regularly participates in the Collegiate Cyber Defense Competition (CCDC),and joins similar pentest events on an ad hoc basis.

3

Sen. Doc. No. 20-074

References

[1] Proceedings of the 13th International Conference on emerging Networking EXperiments andTechnologies, CoNEXT 2017, Incheon, Republic of Korea, December 12 - 15, 2017. ACM,2017. ISBN 978-1-4503-5422-6. https://doi.org/10.1145/3143361.

[2] Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O’Neill, and JustinThaler. Ad hoc multi-input functional encryption. IACR Cryptology ePrint Archive, 2019:356,2019. https://eprint.iacr.org/2019/356.

[3] Georgios Amanatidis, Alexandra Boldyreva, and Adam O’Neill. Provably-secure schemes forbasic query support in outsourced databases. In Steve Barker and Gail-Joon Ahn, editors, Dataand Applications Security XXI, 21st Annual IFIP WG 11.3 Working Conference on Data andApplications Security, Redondo Beach, CA, USA, July 8-11, 2007, Proceedings, volume 4602of Lecture Notes in Computer Science, pages 14–30. Springer, 2007. ISBN 978-3-540-73533-5.https://doi.org/10.1007/978-3-540-73538-0_2.

[4] David T. Arbour, Dan Garant, and David D. Jensen. Inferring network effects from ob-servational data. In Balaji Krishnapuram, Mohak Shah, Alexander J. Smola, Charu C.Aggarwal, Dou Shen, and Rajeev Rastogi, editors, Proceedings of the 22nd ACM SIGKDDInternational Conference on Knowledge Discovery and Data Mining, San Francisco, CA,USA, August 13-17, 2016, pages 715–724. ACM, 2016. ISBN 978-1-4503-4232-2. https:

//doi.org/10.1145/2939672.2939791.

[5] Jeffrey Arnold, Brian Neil Levine, R. Manmatha, F. Lee, Prashant Shenoy, M.-C. Tsai,T.K. Ibrahim, D. OBrien, and D.A. Walsh. Information Sharing in Out-of-Hospital DisasterResponse: The Future Role of Information Technology. Journal of Prehospital and DisasterMedicine, 19(3):201–207, July 2004. https://www.ncbi.nlm.nih.gov/pubmed/15571195.

[6] Aruna Balasubramanian, Brian Neil Levine, and Arun Venkataramani. DTN Routing asa Resource Allocation Problem. In Proc. ACM SIGCOMM, pages 373–384, August 2007.http://forensics.umass.edu/pubs/balasubramanian.sigcomm.2007.pdf.

[7] Aruna Balasubramanian, Brian Neil Levine, and Arun Venkataramani. Replication Routing inDTNs: A Resource Allocation Approach. IEEE/ACM Transactions on Networking, 18(2):596–609, April 2010. http://forensics.umass.edu/pubs/Balasubramanian.ToN.2010.pdf.

[8] Nilanjan Banerjee, Mark D. Corner, and Brian Neil Levine. An Energy-Efficient Architecturefor DTN Throwboxes. In Proceedings of IEEE Infocom, pages 776–784. Anchorage, Alaska,May 2007. http://forensics.umass.edu/pubs/banerjee.infocom07.pdf.

[9] Nilanjan Banerjee, Mark D. Corner, and Brian Neil Levine. Design and Field Experimentationof an Energy-Efficient Architecture for DTN Throwboxes. IEEE/ACM Transactions onNetworking, 18(2):554–567, April 2010. http://forensics.umass.edu/pubs/Banerjee.ToN.2010.pdf.

[10] Nilanjan Banerjee, Mark D. Corner, Don Towsley, and Brian Neil Levine. Relays, BaseStations, and Meshes: Enhancing Mobile Networks with Infrastructure. In Proc. ACMMobicom, pages 81–91. San Francisco, CA, USA, September 2008. http://forensics.umass.edu/pubs/balasubramanian.mobicom.2008.pdf.

1

Sen. Doc. No. 20-074

[11] Boulat A. Bash, Dennis Goeckel, and Don Towsley. Covert communication gains fromadversary’s ignorance of transmission time. IEEE Trans. Wireless Communications, 15(12):8394–8405, 2016. https://doi.org/10.1109/TWC.2016.2614502.

[12] Boulat A. Bash, Dennis Goeckel, Don Towsley, and Saikat Guha. Hiding information in noise:fundamental limits of covert wireless communication. IEEE Communications Magazine, 53(12):26–31, 2015. https://doi.org/10.1109/MCOM.2015.7355562.

[13] Boulat A. Bash, Saikat Guha, Dennis Goeckel, and Don Towsley. Quantum noise limited opticalcommunication with low probability of detection. In Proceedings of the 2013 IEEE InternationalSymposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, pages 1715–1719. IEEE,2013. ISBN 978-1-4799-0446-4. https://doi.org/10.1109/ISIT.2013.6620520.

[14] Georg T. Becker, Francesco Regazzoni, Christof Paar, and Wayne P. Burleson. Stealthydopant-level hardware trojans. In Proceedings of Cryptographic Hardware and EmbeddedSystems (CHES), 2013.

[15] G.T. Becker, Daehyun Strobel, Christof Paar, and Wayne Burleson. Detecting software theftin embedded systems: A side-channel approach. IEEE Transactions on Information Forensicsand Security, 7(4):1144–1154, August 2012. ISSN 1556-6013.

[16] Mihir Bellare, Alexandra Boldyreva, and Adam O’Neill. Deterministic and efficiently searchableencryption. IACR Cryptology ePrint Archive, 2006:186, 2006. http://eprint.iacr.org/

2006/186.

[17] Mihir Bellare, Alexandra Boldyreva, and Adam O’Neill. Deterministic and efficiently searchableencryption. In Alfred Menezes, editor, Advances in Cryptology - CRYPTO 2007, 27thAnnual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007,Proceedings, volume 4622 of Lecture Notes in Computer Science, pages 535–552. Springer,2007. ISBN 978-3-540-74142-8. https://doi.org/10.1007/978-3-540-74143-5_30.

[18] Mihir Bellare, Marc Fischlin, Adam O’Neill, and Thomas Ristenpart. Deterministic encryption:Definitional equivalences and constructions without random oracles. IACR Cryptology ePrintArchive, 2008:267, 2008. http://eprint.iacr.org/2008/267.

[19] Mihir Bellare, Marc Fischlin, Adam O’Neill, and Thomas Ristenpart. Deterministic encryption:Definitional equivalences and constructions without random oracles. In Wagner [282], pages360–378. ISBN 978-3-540-85173-8. https://doi.org/10.1007/978-3-540-85174-5_20.

[20] Mihir Bellare and Adam O’Neill. Semantically-secure functional encryption: Possibility results,impossibility results and the quest for a general definition. IACR Cryptology ePrint Archive,2012:515, 2012. http://eprint.iacr.org/2012/515.

[21] Mihir Bellare and Adam O’Neill. Semantically-secure functional encryption: Possibility results,impossibility results and the quest for a general definition. In Michel Abdalla, Cristina Nita-Rotaru, and Ricardo Dahab, editors, Cryptology and Network Security - 12th InternationalConference, CANS 2013, Paraty, Brazil, November 20-22. 2013. Proceedings, volume 8257 ofLecture Notes in Computer Science, pages 218–234. Springer, 2013. ISBN 978-3-319-02936-8.https://doi.org/10.1007/978-3-319-02937-5_12.

[22] Mihir Bellare, Adam O’Neill, and Igors Stepanovs. Forward-security under continual leakage.In Srdjan Capkun and Sherman S. M. Chow, editors, Cryptology and Network Security - 16th

2

Sen. Doc. No. 20-074

International Conference, CANS 2017, Hong Kong, China, November 30 - December 2, 2017,Revised Selected Papers, volume 11261 of Lecture Notes in Computer Science, pages 3–26.Springer, 2017. ISBN 978-3-030-02640-0. https://doi.org/10.1007/978-3-030-02641-7_1.

[23] Mihir Bellare, Adam O’Neill, and Igors Stepanovs. Forward-security under continual leakage.IACR Cryptology ePrint Archive, 2017:476, 2017. http://eprint.iacr.org/2017/476.

[24] Pavel Berkhin, Rich Caruana, and Xindong Wu, editors. Proceedings of the 13th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose,California, USA, August 12-15, 2007. ACM, 2007. ISBN 978-1-59593-609-7.

[25] Garrett Bernstein, Ryan McKenna, Tao Sun, Daniel Sheldon, Michael Hay, and GeromeMiklau. Differentially private learning of undirected graphical models using collective graphicalmodels. In Doina Precup and Yee Whye Teh, editors, Proceedings of the 34th InternationalConference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017,volume 70 of Proceedings of Machine Learning Research, pages 478–487. PMLR, 2017. http://proceedings.mlr.press/v70/bernstein17a.html.

[26] George Bissias, Brian Neil Levine, Marc Liberatore, Brian Lynn, Juston Moore, Hanna Wallach,and Janis Wolak. Characterization of Contact Offenders and Child Exploitation MaterialTrafficking on Five Peer-to-Peer Networks. Elsevier Child Abuse & Neglect, 52:185–199,February 2016. http://forensics.umass.edu/pubs/bissias.ChildAbuseNeglect.2015.

pdf.

[27] George Bissias, Brian Neil Levine, Marc Liberatore, and Swagatika Prusty. Forensic Identifica-tion of Anonymous Sources in OneSwarm. IEEE Transactions on Dependable and Secure Com-puting, 14(6):620–632, 2017. http://forensics.umass.edu/pubs/bissias.tdsc.2015.pdf.

[28] George Bissias, Brian Neil Levine, and Arnold L. Rosenberg. Bounding Damage FromLink Destruction with Application to the Internet (extended abstract). In Proc. ACMSIGMETRICS, pages 367—368, June 2007. http://forensics.umass.edu/pubs/bissias.sigmetrics.abstract.2007.pdf.

[29] George Bissias, Marc Liberatore, David Jensen, and Brian Neil Levine. Privacy Vulnera-bilities in Encrypted HTTP Streams. In Proc. Privacy Enhancing Technologies Workshop(PET), pages 1–11, May 2005. http://forensics.umass.edu/pubs/bissias.liberatore.

pet.2005.pdf.

[30] Hendrik Blockeel, David D. Jensen, and Stefan Kramer. Introduction to the special issue onmulti-relational data mining and statistical relational learning. Machine Learning, 62(1-2):3–5, 2006. https://doi.org/10.1007/s10994-006-5856-7.

[31] Alexandra Boldyreva, Nathan Chenette, Younho Lee, and Adam O’Neill. Order-preservingsymmetric encryption. In Antoine Joux, editor, Advances in Cryptology - EUROCRYPT2009, 28th Annual International Conference on the Theory and Applications of CryptographicTechniques, Cologne, Germany, April 26-30, 2009. Proceedings, volume 5479 of LectureNotes in Computer Science, pages 224–241. Springer, 2009. ISBN 978-3-642-01000-2. https://doi.org/10.1007/978-3-642-01001-9_13.

3

Sen. Doc. No. 20-074

[32] Alexandra Boldyreva, Nathan Chenette, Younho Lee, and Adam O’Neill. Order-preservingsymmetric encryption. IACR Cryptology ePrint Archive, 2012:624, 2012. http://eprint.

iacr.org/2012/624.

[33] Alexandra Boldyreva, Nathan Chenette, and Adam O’Neill. Order-preserving encryptionrevisited: Improved security analysis and alternative solutions. In Rogaway [238], pages578–595. ISBN 978-3-642-22791-2. https://doi.org/10.1007/978-3-642-22792-9_33.

[34] Alexandra Boldyreva, Nathan Chenette, and Adam O’Neill. Order-preserving encryptionrevisited: Improved security analysis and alternative solutions. IACR Cryptology ePrintArchive, 2012:625, 2012. http://eprint.iacr.org/2012/625.

[35] Alexandra Boldyreva, Serge Fehr, and Adam O’Neill. On notions of security for deterministicencryption, and efficient constructions without random oracles. In Wagner [282], pages 335–359.ISBN 978-3-540-85173-8. https://doi.org/10.1007/978-3-540-85174-5_19.

[36] Alexandra Boldyreva, Serge Fehr, and Adam O’Neill. On notions of security for deterministicencryption, and efficient constructions without random oracles. IACR Cryptology ePrintArchive, 2008:352, 2008. http://eprint.iacr.org/2008/352.

[37] Alexandra Boldyreva, Craig Gentry, Adam O’Neill, and Dae Hyun Yum. Ordered multisigna-tures and identity-based sequential aggregate signatures, with applications to secure routing.In Peng Ning, Sabrina De Capitani di Vimercati, and Paul F. Syverson, editors, Proceedings ofthe 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria,Virginia, USA, October 28-31, 2007, pages 276–285. ACM, 2007. ISBN 978-1-59593-703-2.https://doi.org/10.1145/1315245.1315280.

[38] Alexandra Boldyreva, Craig Gentry, Adam O’Neill, and Dae Hyun Yum. Ordered multisigna-tures and identity-based sequential aggregate signatures, with applications to secure routing.IACR Cryptology ePrint Archive, 2007:438, 2007. http://eprint.iacr.org/2007/438.

[39] Alexandra Boldyreva, Craig Gentry, Adam O’Neill, and Dae Hyun Yum. New multipartysignature schemes for network routing applications. ACM Trans. Inf. Syst. Secur., 12(1):3:1–3:39, 2008. https://doi.org/10.1145/1410234.1410237.

[40] Chad Brubaker, Amir Houmansadr, and Vitaly Shmatikov. Cloudtransport: Using cloudstorage for censorship-resistant networking. In Emiliano De Cristofaro and Steven J. Mur-doch, editors, Privacy Enhancing Technologies - 14th International Symposium, PETS2014, Amsterdam, The Netherlands, July 16-18, 2014. Proceedings, volume 8555 of Lec-ture Notes in Computer Science, pages 1–20. Springer, 2014. ISBN 978-3-319-08505-0.https://doi.org/10.1007/978-3-319-08506-7_1.

[41] John Burgess, George Bissias, Mark D. Corner, and Brian Neil Levine. Surviving Attackson Disruption-Tolerant Networks without Authentication. In Proc. ACM InternationalSymposium on Mobile Ad hoc Networking and Computing (MobiHoc), pages 61–70. Montreal,Quebec, Canada, September 2007. http://forensics.umass.edu/pubs/burgess.mobihoc.2007.pdf.

[42] John Burgess, Brian Gallagher, David Jensen, and Brian Neil Levine. MaxProp: Routing forVehicle-Based Disruption-Tolerant Networks (2017 Test of Time Award Winner). In Proc. IEEEINFOCOM, April 2006. http://forensics.umass.edu/pubs/burgess.infocom2006.pdf.

4

Sen. Doc. No. 20-074

[43] Wayne Burleson and Sandro Carrara. Security and Privacy for Implantable Medical Devices.Springer, 2014.

[44] Wayne Burleson, Shane Clark, Benjamin Ransford, and Kevin Fu. Design challenges in secureimplantable medical devices. In ACM/IEEE Design Automation Conference, 2012.

[45] Brendan Burns, Oliver Brock, and Brian Neil Levine. MV Routing and Capacity Buildingin Disruption Tolerant Networks. In Proc. IEEE INFOCOM, pages 398–408, March 2005.http://forensics.umass.edu/pubs/bburns.infocom.2005.pdf.

[46] Brendan Burns, Oliver Brock, and Brian Neil Levine. Autonomous Enhancement of DisruptionTolerant Networks. In Proc. IEEE International Conference on Robotics and Automation,pages 2105–2110, May 2006. http://forensics.umass.edu/pubs/bburns.icra2006.pdf.

[47] Brendan Burns, Oliver Brock, and Brian Neil Levine. MORA Routing and Capacity Buildingin Disruption-Tolerant Networks. Elsevier Ad hoc Networks Journal, 6(4):600–620, June 2008.http://forensics.umass.edu/pubs/bburns.adhoc_nets_jrnl.pdf.

[48] Yan Cai, Patrick P. C. Lee, Weibo Gong, and Donald F. Towsley. Analysis of traffic correlationattacks on router queues. Computer Networks, 55(3):734–747, 2011. https://doi.org/10.

1016/j.comnet.2010.10.016.

[49] Nairen Cao, Adam O’Neill, and Mohammad Zaheri. Towards RSA-OAEP without randomoracles. IACR Cryptology ePrint Archive, 2018:1170, 2018. https://eprint.iacr.org/2018/1170.

[50] Cagatay Capar, Dennis Goeckel, Kenneth G. Paterson, Elizabeth A. Quaglia, Don Towsley,and Murtaza Zafer. Signal-flow-based analysis of wireless security protocols. Inf. Comput.,226:37–56, 2013. https://doi.org/10.1016/j.ic.2013.03.004.

[51] Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O’Neill, Omer Paneth, and GiuseppePersiano. On the achievability of simulation-based security for functional encryption. IACRCryptology ePrint Archive, 2013:364, 2013. http://eprint.iacr.org/2013/364.

[52] Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O’Neill, Omer Paneth, and GiuseppePersiano. On the achievability of simulation-based security for functional encryption. In RanCanetti and Juan A. Garay, editors, Advances in Cryptology - CRYPTO 2013 - 33rd AnnualCryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II,volume 8043 of Lecture Notes in Computer Science, pages 519–535. Springer, 2013. ISBN978-3-642-40083-4. https://doi.org/10.1007/978-3-642-40084-1_29.

[53] Angelo De Caro, Vincenzo Iovino, and Adam O’Neill. Deniable functional encryption. IACRCryptology ePrint Archive, 2015:1205, 2015. http://eprint.iacr.org/2015/1205.

[54] Angelo De Caro, Vincenzo Iovino, and Adam O’Neill. Deniable functional encryption. InChen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, and Bo-Yin Yang, editors, Public-KeyCryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory inPublic-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I, volume 9614of Lecture Notes in Computer Science, pages 196–222. Springer, 2016. ISBN 978-3-662-49383-0.https://doi.org/10.1007/978-3-662-49384-7_8.

5

Sen. Doc. No. 20-074

[55] Angelo De Caro, Vincenzo Iovino, and Adam O’Neill. Receiver- and sender-deniable functionalencryption. IET Information Security, 12(3):207–216, 2018. https://doi.org/10.1049/

iet-ifs.2017.0040.

[56] David Cash, Feng-Hao Liu, Adam O’Neill, Mark Zhandry, and Cong Zhang. Parameter-hidingorder revealing encryption. In Thomas Peyrin and Steven D. Galbraith, editors, Advancesin Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory andApplication of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6,2018, Proceedings, Part I, volume 11272 of Lecture Notes in Computer Science, pages 181–210.Springer, 2018. ISBN 978-3-030-03325-5. https://doi.org/10.1007/978-3-030-03326-2_7.

[57] David Cash, Feng-Hao Liu, Adam O’Neill, Mark Zhandry, and Cong Zhang. Parameter-hiding order revealing encryption. IACR Cryptology ePrint Archive, 2018:698, 2018. https://eprint.iacr.org/2018/698.

[58] David Cash, Feng-Hao Liu, Adam O’Neill, and Cong Zhang. Reducing the leakage inpractical order-revealing encryption. IACR Cryptology ePrint Archive, 2016:661, 2016. http://eprint.iacr.org/2016/661.

[59] Yan Chen, Ashwin Machanavajjhala, Michael Hay, and Gerome Miklau. Pegasus: Data-adaptive differentially private stream processing. In Thuraisingham et al. [276], pages 1375–1388. ISBN 978-1-4503-4946-8. https://doi.org/10.1145/3133956.3134102.

[60] Jung Hee Cheon and Tsuyoshi Takagi, editors. Advances in Cryptology - ASIACRYPT 2016 -22nd International Conference on the Theory and Application of Cryptology and InformationSecurity, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, volume 10032 of LectureNotes in Computer Science, 2016. ISBN 978-3-662-53889-0. https://doi.org/10.1007/

978-3-662-53890-6.

[61] Shinyoung Cho, Rishab Nithyanand, Abbas Razaghpanah, and Phillipa Gill. A churn for thebetter: Localizing censorship using network-level path churn and network tomography. InProceedings of the 13th International Conference on emerging Networking EXperiments andTechnologies, CoNEXT 2017, Incheon, Republic of Korea, December 12 - 15, 2017 [1], pages81–87. ISBN 978-1-4503-5422-6. https://doi.org/10.1145/3143361.3143386.

[62] Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, and Adam O’Neill. Enhancedchosen-ciphertext security and applications. IACR Cryptology ePrint Archive, 2012:543, 2012.http://eprint.iacr.org/2012/543.

[63] Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, and Adam O’Neill. Enhancedchosen-ciphertext security and applications. In Hugo Krawczyk, editor, Public-Key Cryptog-raphy - PKC 2014 - 17th International Conference on Practice and Theory in Public-KeyCryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings, volume 8383 ofLecture Notes in Computer Science, pages 329–344. Springer, 2014. ISBN 978-3-642-54630-3.https://doi.org/10.1007/978-3-642-54631-0_19.

[64] Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O’Neill, and Hong-Sheng Zhou.Leakage-resilient public-key encryption from obfuscation. In Chen-Mou Cheng, Kai-MinChung, Giuseppe Persiano, and Bo-Yin Yang, editors, Public-Key Cryptography - PKC 2016- 19th IACR International Conference on Practice and Theory in Public-Key Cryptography,

6

Sen. Doc. No. 20-074

Taipei, Taiwan, March 6-9, 2016, Proceedings, Part II, volume 9615 of Lecture Notes inComputer Science, pages 101–128. Springer, 2016. ISBN 978-3-662-49386-1. https://doi.

org/10.1007/978-3-662-49387-8_5.

[65] Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O’Neill, and Hong-Sheng Zhou.Leakage-resilient public-key encryption from obfuscation. IACR Cryptology ePrint Archive,2016:730, 2016. http://eprint.iacr.org/2016/730.

[66] Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O’Neill, and Hong-Sheng Zhou.Leakage resilience from program obfuscation. J. Cryptology, 32(3):742–824, 2019. https:

//doi.org/10.1007/s00145-018-9286-z.

[67] Jakub Dalek, Bennett Haselton, Helmi Noman, Adam Senft, Masashi Crete-Nishihata, PhillipaGill, and Ronald J. Deibert. A method for identifying and confirming the use of URL filteringproducts for censorship. In Konstantina Papagiannaki, P. Krishna Gummadi, and CraigPartridge, editors, Proceedings of the 2013 Internet Measurement Conference, IMC 2013,Barcelona, Spain, October 23-25, 2013, pages 23–30. ACM, 2013. ISBN 978-1-4503-1953-9.https://doi.org/10.1145/2504730.2504763.

[68] James Davis, Andy Fagg, and Brian Neil Levine. Wearable Computers and Packet TransportMechanisms in Highly Partitioned Ad hoc Networks. In Proc. IEEE Intl. Symp on WearableComputers (ISWC), pages 141–148, October 2001. http://forensics.umass.edu/pubs/

iswc01_pednet.pdf.

[69] Laura DeBonis, Ben Adida, Scott Bradner, Hany Farid, Lee Hollaar, Todd Inskeep, Brian NeilLevine, Adi Mcabian, R.L. Morgan, Lam Nguyen, Jeff Schiller, and Danny Weitzner. Enhanc-ing Child Safety & Online Technologies. Appendix D: Technology Advisory Board Report.Technical Report , Internet Safety Technical Task Force to the Multi-State Working Group onSocial Networking of State Attorneys General of the United States, December 2008.

[70] Brian Delaney, Andrew S. Fast, William M. Campbell, Clifford J. Weinstein, and David D.Jensen. The application of statistical relational learning to a database of criminal andterrorist activity. In Proceedings of the SIAM International Conference on Data Mining, SDM2010, April 29 - May 1, 2010, Columbus, Ohio, USA, pages 409–417. SIAM, 2010. ISBN978-0-89871-703-7. https://doi.org/10.1137/1.9781611972801.36.

[71] Siva Nishok Dhanuskodi and Daniel E Holcomb. An improved clocking methodology for energyefficient low area aes architectures using register renaming. In IEEE/ACM InternationalSymposium on Low Power Electronics and Design, July 2017.

[72] Arun Dunna, Ciaran O’Brien, and Phillipa Gill. Analyzing china’s blocking of unpublishedtor bridges. In Lex Gill and Rob Jansen, editors, 8th USENIX Workshop on Free and OpenCommunications on the Internet, FOCI 2018, Baltimore, MD, USA, August 14, 2018. USENIXAssociation, 2018. https://www.usenix.org/conference/foci18/presentation/dunna.

[73] Andrew S. Fast, Lisa Friedland, Marc E. Maier, Brian J. Taylor, David D. Jensen, Henry G.Goldberg, and John Komoroske. Relational data pre-processing techniques for improvedsecurities fraud detection. In Berkhin et al. [24], pages 941–949. ISBN 978-1-59593-609-7.https://doi.org/10.1145/1281192.1281293.

7

Sen. Doc. No. 20-074

[74] Andrew S. Fast and David D. Jensen. Why stacked models perform effective collectiveclassification. In Proceedings of the 8th IEEE International Conference on Data Mining(ICDM 2008), December 15-19, 2008, Pisa, Italy, pages 785–790. IEEE Computer Society,2008. ISBN 978-0-7695-3502-9. https://doi.org/10.1109/ICDM.2008.126.

[75] Tomas Filler, Tomas Pevny, Scott Craver, and Andrew D. Ker, editors. Information Hiding -13th International Conference, IH 2011, Prague, Czech Republic, May 18-20, 2011, RevisedSelected Papers, volume 6958 of Lecture Notes in Computer Science. Springer, 2011. ISBN978-3-642-24177-2. https://doi.org/10.1007/978-3-642-24178-9.

[76] Lisa Friedland, Amanda Gentzel, and David D. Jensen. Classifier-adjusted density estimationfor anomaly detection and one-class classification. In Mohammed Javeed Zaki, Zoran Obradovic,Pang-Ning Tan, Arindam Banerjee, Chandrika Kamath, and Srinivasan Parthasarathy, edi-tors, Proceedings of the 2014 SIAM International Conference on Data Mining, Philadelphia,Pennsylvania, USA, April 24-26, 2014, pages 578–586. SIAM, 2014. ISBN 978-1-61197-344-0.https://doi.org/10.1137/1.9781611973440.67.

[77] Lisa Friedland and David D. Jensen. Finding tribes: identifying close-knit individualsfrom employment patterns. In Berkhin et al. [24], pages 290–299. ISBN 978-1-59593-609-7.https://doi.org/10.1145/1281192.1281226.

[78] Benjamin Fuller, Adam O’Neill, and Leonid Reyzin. A unified approach to deterministicencryption: New constructions and a connection to computational entropy. IACR CryptologyePrint Archive, 2012:5, 2012. http://eprint.iacr.org/2012/005.

[79] Benjamin Fuller, Adam O’Neill, and Leonid Reyzin. A unified approach to deterministicencryption: New constructions and a connection to computational entropy. In RonaldCramer, editor, Theory of Cryptography - 9th Theory of Cryptography Conference, TCC2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings, volume 7194 of Lecture Notesin Computer Science, pages 582–599. Springer, 2012. ISBN 978-3-642-28913-2. https:

//doi.org/10.1007/978-3-642-28914-9_33.

[80] Benjamin Fuller, Adam O’Neill, and Leonid Reyzin. A unified approach to deterministicencryption: New constructions and a connection to computational entropy. J. Cryptology, 28(3):671–717, 2015. https://doi.org/10.1007/s00145-013-9174-5.

[81] Michele Garetto, Weibo Gong, and Donald F. Towsley. Modeling malware spreading dynamics.In Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEEComputer and Communications Societies, San Franciso, CA, USA, March 30 - April 3, 2003,pages 1869–1879. IEEE Computer Society, 2003. ISBN 0-7803-7752-4. https://doi.org/10.1109/INFCOM.2003.1209209.

[82] Craig Gentry, Adam O’Neill, and Leonid Reyzin. A unified framework for trapdoor-permutation-based sequential aggregate signatures. In Michel Abdalla and Ricardo Dahab,editors, Public-Key Cryptography - PKC 2018 - 21st IACR International Conference onPractice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018,Proceedings, Part II, volume 10770 of Lecture Notes in Computer Science, pages 34–57. Springer,2018. ISBN 978-3-319-76580-8. https://doi.org/10.1007/978-3-319-76581-5_2.

[83] Craig Gentry, Adam O’Neill, and Leonid Reyzin. A unified framework for trapdoor-permutation-based sequential aggregate signatures. IACR Cryptology ePrint Archive, 2018:70,2018. http://eprint.iacr.org/2018/070.

8

Sen. Doc. No. 20-074

[84] Michael Gerbush, Allison B. Lewko, Adam O’Neill, and Brent Waters. Dual form signatures:An approach for proving security from static assumptions. In Xiaoyun Wang and Kazue Sako,editors, Advances in Cryptology - ASIACRYPT 2012 - 18th International Conference on theTheory and Application of Cryptology and Information Security, Beijing, China, December 2-6,2012. Proceedings, volume 7658 of Lecture Notes in Computer Science, pages 25–42. Springer,2012. ISBN 978-3-642-34960-7. https://doi.org/10.1007/978-3-642-34961-4_4.

[85] Michael Gerbush, Allison B. Lewko, Adam O’Neill, and Brent Waters. Dual form signatures:An approach for proving security from static assumptions. IACR Cryptology ePrint Archive,2012:261, 2012. http://eprint.iacr.org/2012/261.

[86] Lise Getoor, Ted E. Senator, Pedro M. Domingos, and Christos Faloutsos, editors. Proceedingsof the Ninth ACM SIGKDD International Conference on Knowledge Discovery and DataMining, Washington, DC, USA, August 24 - 27, 2003. ACM, 2003. ISBN 1-58113-737-0.

[87] Samaneh Ghandali, Georg T Becker, Daniel Holcomb, and Christof Paar. A design methodologyfor stealthy parametric trojans and its application to bug attacks. In International Conferenceon Cryptographic Hardware and Embedded Systems, pages 625–647. Springer, 2016.

[88] Phillipa Gill, Masashi Crete-Nishihata, Jakub Dalek, Sharon Goldberg, Adam Senft, and GregWiseman. Characterizing web censorship worldwide: Another look at the opennet initiativedata. TWEB, 9(1):4:1–4:29, 2015. https://doi.org/10.1145/2700339.

[89] Phillipa Gill, Yashar Ganjali, Bernard Wong, and David Lie. Dude, where’s that ip? circum-venting measurement-based IP geolocation. In 19th USENIX Security Symposium, Washing-ton, DC, USA, August 11-13, 2010, Proceedings, pages 241–256. USENIX Association, 2010.http://www.usenix.org/events/sec10/tech/full_papers/Gill.pdf.

[90] Phillipa Gill, Adrian Perrig, and Matthias Wahlisch. Secure routing for the internet (dagstuhlseminar 18242). Dagstuhl Reports, 8(6):40–62, 2018. https://doi.org/10.4230/DagRep.8.6.40.

[91] Dennis Goeckel, Boulat A. Bash, Saikat Guha, and Don Towsley. Covert communicationswhen the warden does not know the background noise power. IEEE Communications Letters,20(2):236–239, 2016. https://doi.org/10.1109/LCOMM.2015.2507594.

[92] Dennis Goeckel, Boulat A. Bash, Azadeh Sheikholeslami, Saikat Guha, and Don Towsley.Covert active sensing of linear systems. In Matthews [187], pages 1692–1696. ISBN 978-1-5386-1823-3. https://doi.org/10.1109/ACSSC.2017.8335648.

[93] Dennis Goeckel, Azadeh Sheikholeslami, Tamara V. Sobers, Boulat A. Bash, Don Towsley, andSaikat Guha. Covert communications in a dynamic interference environment. In 19th IEEEInternational Workshop on Signal Processing Advances in Wireless Communications, SPAWC2018, Kalamata, Greece, June 25-28, 2018, pages 1–5. IEEE, 2018. ISBN 978-1-5386-3512-4.https://doi.org/10.1109/SPAWC.2018.8445896.

[94] Vipul Goyal, Aayush Jain, and Adam O’Neill. Multi-input functional encryption withunbounded-message security. IACR Cryptology ePrint Archive, 2015:1113, 2015. http:

//eprint.iacr.org/2015/1113.

[95] Vipul Goyal, Aayush Jain, and Adam O’Neill. Multi-input functional encryption withunbounded-message security. In Cheon and Takagi [60], pages 531–556. ISBN 978-3-662-53889-0. https://doi.org/10.1007/978-3-662-53890-6_18.

9

Sen. Doc. No. 20-074

[96] Vipul Goyal, Adam O’Neill, and Vanishree Rao. Correlated-input secure hash functions.In Yuval Ishai, editor, Theory of Cryptography - 8th Theory of Cryptography Conference,TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings, volume 6597 of LectureNotes in Computer Science, pages 182–200. Springer, 2011. ISBN 978-3-642-19570-9. https://doi.org/10.1007/978-3-642-19571-6_12.

[97] Vipul Goyal, Adam O’Neill, and Vanishree Rao. Correlated-input secure hash functions. IACRCryptology ePrint Archive, 2011:233, 2011. http://eprint.iacr.org/2011/233.

[98] Vani Gupta, Gerome Miklau, and Neoklis Polyzotis. Private database synthesis for outsourcedsystem evaluation. In Pablo Barcelo and Val Tannen, editors, Proceedings of the 5th AlbertoMendelzon International Workshop on Foundations of Data Management, Santiago, Chile,May 9-12, 2011, volume 749 of CEUR Workshop Proceedings. CEUR-WS.org, 2011. http:

//ceur-ws.org/Vol-749/paper10.pdf.

[99] Katrina M. Hanna, Brian Neil Levine, and R. Manmatha. Mobile Distributed InformationRetrieval For Highly Partitioned Networks. In Proc. IEEE Intl. Conference on NetworkProtocols (ICNP), pages 38–47, November 2003. http://forensics.umass.edu/pubs/hanna.icnp03.pdf.

[100] Seth Hardy, Masashi Crete-Nishihata, Katharine Kleemola, Adam Senft, Byron Sonne, GregWiseman, Phillipa Gill, and Ronald J. Deibert. Targeted threat index: Characterizing andquantifying politically-motivated targeted malware. In Kevin Fu and Jaeyeon Jung, editors,Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22,2014., pages 527–541. USENIX Association, 2014. https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/hardy.

[101] Michael Hay, Liudmila Elagina, and Gerome Miklau. Differentially private rank aggregation. InNitesh Chawla and Wei Wang, editors, Proceedings of the 2017 SIAM International Conferenceon Data Mining, Houston, Texas, USA, April 27-29, 2017., pages 669–677. SIAM, 2017. ISBN978-1-61197-497-3. https://doi.org/10.1137/1.9781611974973.75.

[102] Michael Hay, Chao Li, Gerome Miklau, and David D. Jensen. Accurate estimation of thedegree distribution of private networks. In Wei Wang, Hillol Kargupta, Sanjay Ranka, Philip S.Yu, and Xindong Wu, editors, ICDM 2009, The Ninth IEEE International Conference onData Mining, Miami, Florida, USA, 6-9 December 2009, pages 169–178. IEEE ComputerSociety, 2009. ISBN 978-0-7695-3895-2. https://doi.org/10.1109/ICDM.2009.11.

[103] Michael Hay, Kun Liu, Gerome Miklau, Jian Pei, and Evimaria Terzi. Privacy-aware datamanagement in information networks. In Timos K. Sellis, Renee J. Miller, Anastasios Kementsi-etsidis, and Yannis Velegrakis, editors, Proceedings of the ACM SIGMOD International Confer-ence on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011, pages 1201–1204. ACM, 2011. ISBN 978-1-4503-0661-4. https://doi.org/10.1145/1989323.1989453.

[104] Michael Hay, Ashwin Machanavajjhala, Gerome Miklau, Yan Chen, and Dan Zhang. Principledevaluation of differentially private algorithms using dpbench. In Ozcan et al. [222], pages139–154. ISBN 978-1-4503-3531-7. https://doi.org/10.1145/2882903.2882931.

[105] Michael Hay, Ashwin Machanavajjhala, Gerome Miklau, Yan Chen, Dan Zhang, and GeorgeBissias. Exploring privacy-accuracy tradeoffs using dpcomp. In Ozcan et al. [222], pages2101–2104. ISBN 978-1-4503-3531-7. https://doi.org/10.1145/2882903.2899387.

10

Sen. Doc. No. 20-074

[106] Michael Hay, Vibhor Rastogi, Gerome Miklau, and Dan Suciu. Boosting the accuracyof differentially private histograms through consistency. PVLDB, 3(1):1021–1032, 2010.http://www.vldb.org/pvldb/vldb2010/pvldb_vol3/R91.pdf.

[107] G. Hinterwalder, Christof Paar, and Wayne Burleson. Privacy preserving payments on ultra-low power privacy preserving payments on computational RFID devices with application inintelligent transportation systems. In RFID Security And Privacy, 2012.

[108] Rahul Hiran, Niklas Carlsson, and Phillipa Gill. Characterizing large-scale routing anomalies:A case study of the china telecom incident. In Matthew Roughan and Rocky K. C. Chang,editors, Passive and Active Measurement - 14th International Conference, PAM 2013, HongKong, China, March 18-19, 2013. Proceedings, volume 7799 of Lecture Notes in ComputerScience, pages 229–238. Springer, 2013. ISBN 978-3-642-36515-7. https://doi.org/10.1007/978-3-642-36516-4_23.

[109] Viet Tung Hoang, Jonathan Katz, Adam O’Neill, and Mohammad Zaheri. Selective-openingsecurity in the presence of randomness failures. In Cheon and Takagi [60], pages 278–306.ISBN 978-3-662-53889-0. https://doi.org/10.1007/978-3-662-53890-6_10.

[110] Viet Tung Hoang, Jonathan Katz, Adam O’Neill, and Mohammad Zaheri. Selective-openingsecurity in the presence of randomness failures. IACR Cryptology ePrint Archive, 2016:868,2016. http://eprint.iacr.org/2016/868.

[111] D. E. Holcomb, W. P. Burleson, and K. Fu. Power-up sram state as an identifying fingerprintand source of true random numbers. IEEE Transactions on Computers, 58(9):1198–1210, Sep.2009. ISSN 0018-9340.

[112] Daniel E Holcomb and Kevin Fu. Bitline puf: Building native challenge-response puf capabilityinto any sram. In Lejla Batina and Matthew Robshaw, editors, Cryptographic Hardware andEmbedded Systems (CHES 2014), volume 8731, pages 510–526, 2014. https://spqr.eecs.

umich.edu/papers/holcomb_bitline_ches14.pdf.

[113] John Holowczak and Amir Houmansadr. Cachebrowser: Bypassing chinese censorship withoutproxies using cached content. In Indrajit Ray, Ninghui Li, and Christopher Kruegel, editors,Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security,Denver, CO, USA, October 12-16, 2015, pages 70–83. ACM, 2015. ISBN 978-1-4503-3832-5.https://doi.org/10.1145/2810103.2813696.

[114] Amir Houmansadr and Nikita Borisov. Coco: Coding-based covert timing channels for networkflows. In Filler et al. [75], pages 314–328. ISBN 978-3-642-24177-2. https://doi.org/10.

1007/978-3-642-24178-9_22.

[115] Amir Houmansadr and Nikita Borisov. SWIRL: A scalable watermark to detect correlatednetwork flows. In Proceedings of the Network and Distributed System Security Symposium,NDSS 2011, San Diego, California, USA, 6th February - 9th February 2011. The InternetSociety, 2011. http://www.isoc.org/isoc/conferences/ndss/11/pdf/7_3.pdf.

[116] Amir Houmansadr and Nikita Borisov. Towards improving network flow watermarks using therepeat-accumulate codes. In Proceedings of the IEEE International Conference on Acoustics,Speech, and Signal Processing, ICASSP 2011, May 22-27, 2011, Prague Congress Center,Prague, Czech Republic, pages 1852–1855. IEEE, 2011. ISBN 978-1-4577-0539-7. https:

//doi.org/10.1109/ICASSP.2011.5946866.

11

Sen. Doc. No. 20-074

[117] Amir Houmansadr and Nikita Borisov. Botmosaic: Collaborative network watermark forthe detection of irc-based botnets. Journal of Systems and Software, 86(3):707–715, 2013.https://doi.org/10.1016/j.jss.2012.11.005.

[118] Amir Houmansadr and Nikita Borisov. The need for flow fingerprints to link correlatednetwork flows. In Emiliano De Cristofaro and Matthew K. Wright, editors, Privacy EnhancingTechnologies - 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12,2013. Proceedings, volume 7981 of Lecture Notes in Computer Science, pages 205–224. Springer,2013. ISBN 978-3-642-39076-0. https://doi.org/10.1007/978-3-642-39077-7_11.

[119] Amir Houmansadr, Chad Brubaker, and Vitaly Shmatikov. The parrot is dead: Observingunobservable network communications. In 2013 IEEE Symposium on Security and Privacy,SP 2013, Berkeley, CA, USA, May 19-22, 2013, pages 65–79. IEEE Computer Society, 2013.ISBN 978-1-4673-6166-8. https://doi.org/10.1109/SP.2013.14.

[120] Amir Houmansadr, Negar Kiyavash, and Nikita Borisov. Multi-flow attack resistant watermarksfor network flows. In Proceedings of the IEEE International Conference on Acoustics, Speech,and Signal Processing, ICASSP 2009, 19-24 April 2009, Taipei, Taiwan, pages 1497–1500.IEEE, 2009. https://doi.org/10.1109/ICASSP.2009.4959879.

[121] Amir Houmansadr, Negar Kiyavash, and Nikita Borisov. RAINBOW: A robust and invisiblenon-blind watermark for network flows. In Proceedings of the Network and DistributedSystem Security Symposium, NDSS 2009, San Diego, California, USA, 8th February - 11thFebruary 2009. The Internet Society, 2009. https://www.ndss-symposium.org/ndss2009/

rainbow-a-robust-and-invisible-non-blind-watermark-for-network-flows/.

[122] Amir Houmansadr, Negar Kiyavash, and Nikita Borisov. Non-blind watermarking of networkflows. IEEE/ACM Trans. Netw., 22(4):1232–1244, 2014. https://doi.org/10.1109/TNET.2013.2272740.

[123] Amir Houmansadr, Giang T. K. Nguyen, Matthew Caesar, and Nikita Borisov. Cirripede:circumvention infrastructure using router redirection with plausible deniability. In Yan Chen,George Danezis, and Vitaly Shmatikov, editors, Proceedings of the 18th ACM Conference onComputer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21,2011, pages 187–200. ACM, 2011. ISBN 978-1-4503-0948-6. https://doi.org/10.1145/

2046707.2046730.

[124] Amir Houmansadr, Hamed Pirsiavash, and Shahrokh Ghaemmaghami. Robust content-based video watermarking exploiting motion entropy masking effect. In Pedro A. AmadoAssuncao and Sergio M. M. de Faria, editors, SIGMAP 2006 - Proceedings of the InternationalConference on Signal Processing and Multimedia Applications, Setubal, Portugal, August 7-10,2006, SIGMAP is part of ICETE - The International Joint Conference on e-Business andTelecommunications, pages 252–259. INSTICC Press, 2006. ISBN 972-8865-64-3.

[125] Amir Houmansadr, Thomas J. Riedl, Nikita Borisov, and Andrew C. Singer.I want my voice to be heard: IP over voice-over-ip for unobservable cen-sorship circumvention. In 20th Annual Network and Distributed System Se-curity Symposium, NDSS 2013, San Diego, California, USA, February 24-27,2013. The Internet Society, 2013. https://www.ndss-symposium.org/ndss2013/

i-want-my-voice-be-heard-ip-over-voice-over-ip-unobservable-censorship-circumvention.

12

Sen. Doc. No. 20-074

[126] Amir Houmansadr, Edmund L. Wong, and Vitaly Shmatikov. No direction home:The true cost of routing around decoys. In 21st Annual Network and DistributedSystem Security Symposium, NDSS 2014, San Diego, California, USA, February 23-26, 2014. The Internet Society, 2014. https://www.ndss-symposium.org/ndss2014/

no-direction-home-true-cost-routing-around-decoys.

[127] Amir Houmansadr, Wenxuan Zhou, Matthew Caesar, and Nikita Borisov. SWEET: servingthe web by exploiting email tunnels. IEEE/ACM Trans. Netw., 25(3):1517–1527, 2017.https://doi.org/10.1109/TNET.2016.2640238.

[128] Ryan Hurley, Swagatika Prusty, Hamed Soroush, Robert J. Walls, Jeannie Albrecht, EmmanuelCecchet, Brian Neil Levine, Marc Liberatore, Brian Lynn, and Janis Wolak. Measurementand Analysis of Child Pornography Trafficking on P2P Networks (Runner-Up, Best PaperAward). In Proc. Intl. World Wide Web Conference (WWW), pages 631–642, May 2013.http://forensics.umass.edu/pubs/hurley.www.2013.pdf.

[129] David D. Jensen. Data snooping, dredging and fishing: The dark side of data mining, ASIGKDD99 panel report. SIGKDD Explorations, 1(2):52–54, 2000. https://doi.org/10.

1145/846183.846195.

[130] David D. Jensen, Andrew S. Fast, Brian J. Taylor, and Marc E. Maier. Automatic identificationof quasi-experimental designs for discovering causal knowledge. In Li et al. [165], pages 372–380.ISBN 978-1-60558-193-4. https://doi.org/10.1145/1401890.1401938.

[131] David D. Jensen, Jennifer Neville, and Brian Gallagher. Why collective inference improvesrelational classification. In Won Kim, Ron Kohavi, Johannes Gehrke, and William DuMouchel,editors, Proceedings of the Tenth ACM SIGKDD International Conference on KnowledgeDiscovery and Data Mining, Seattle, Washington, USA, August 22-25, 2004, pages 593–598.ACM, 2004. ISBN 1-58113-888-1. https://doi.org/10.1145/1014052.1014125.

[132] David D. Jensen, Matthew J. Rattigan, and Hannah Blau. Information awareness: a prospectivetechnical assessment. In Getoor et al. [86], pages 378–387. ISBN 1-58113-737-0. https:

//doi.org/10.1145/956750.956794.

[133] David D. Jensen and Matthew D. Schmill. Adjusting for multiple comparisons in decisiontree pruning. In David Heckerman, Heikki Mannila, and Daryl Pregibon, editors, Proceedingsof the Third International Conference on Knowledge Discovery and Data Mining (KDD-97),Newport Beach, California, USA, August 14-17, 1997, pages 195–198. AAAI Press, 1997.ISBN 1-57735-027-8. http://www.aaai.org/Library/KDD/1997/kdd97-038.php.

[134] Hao Jiang, Can Li, Rui Zhang, Peng Yan, Peng Lin, Yunning Li, J Joshua Yang, DanielHolcomb, and Qiangfei Xia. A provable key destruction scheme based on memristive crossbararrays. Nature Electronics, 1(10):548, 2018.

[135] Ben Jones, Tzu-Wen Lee, Nick Feamster, and Phillipa Gill. Automated detection andfingerprinting of censorship block pages. In Carey Williamson, Aditya Akella, and Nina Taft,editors, Proceedings of the 2014 Internet Measurement Conference, IMC 2014, Vancouver,BC, Canada, November 5-7, 2014, pages 299–304. ACM, 2014. ISBN 978-1-4503-3213-2.https://doi.org/10.1145/2663716.2663722.

13

Sen. Doc. No. 20-074

[136] Georgios Kellaris, George Kollios, Kobbi Nissim, and Adam O’Neill. Generic attacks onsecure outsourced databases. In Weippl et al. [287], pages 1329–1340. ISBN 978-1-4503-4139-4.https://doi.org/10.1145/2976749.2978386.

[137] Georgios Kellaris, George Kollios, Kobbi Nissim, and Adam O’Neill. Accessing data whilepreserving privacy. CoRR, abs/1706.01552, 2017. http://arxiv.org/abs/1706.01552.

[138] S. Keshavarz, C. Paar, and D. Holcomb. Design automation for obfuscated circuits withmultiple viable functions. In Design, Automation Test in Europe Conference Exhibition(DATE), 2017, pages 886–889, March 2017.

[139] Shahrzad Keshavarz and Daniel Holcomb. Threshold-based obfuscated keys with quantifiablesecurity against invasive readout. In Proceedings of the IEEE/ACM International Conferenceon Computer-Aided Design, ICCAD ’17, 2017.

[140] Shahrzad Keshavarz, Falk Schellenberg, Bastian Richte, Christof Paar, and Daniel Holcomb.Sat-based reverse engineering of gate-level schematics using fault injection and probing. In2018 IEEE International Symposium on Hardware Oriented Security and Trust (HOST), pages215–220. IEEE, 2018.

[141] Eike Kiltz, Payman Mohassel, and Adam O’Neill. Adaptive trapdoor functions and chosen-ciphertext security. In Henri Gilbert, editor, Advances in Cryptology - EUROCRYPT 2010,29th Annual International Conference on the Theory and Applications of CryptographicTechniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings, volume 6110 ofLecture Notes in Computer Science, pages 673–692. Springer, 2010. ISBN 978-3-642-13189-9.https://doi.org/10.1007/978-3-642-13190-5_34.

[142] Eike Kiltz, Adam O’Neill, and Adam D. Smith. Instantiability of RSA-OAEP under chosen-plaintext attack. In Tal Rabin, editor, Advances in Cryptology - CRYPTO 2010, 30thAnnual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings,volume 6223 of Lecture Notes in Computer Science, pages 295–313. Springer, 2010. ISBN978-3-642-14622-0. https://doi.org/10.1007/978-3-642-14623-7_16.

[143] Eike Kiltz, Adam O’Neill, and Adam D. Smith. Instantiability of RSA-OAEP under chosen-plaintext attack. IACR Cryptology ePrint Archive, 2011:559, 2011. http://eprint.iacr.

org/2011/559.

[144] Eike Kiltz, Adam O’Neill, and Adam D. Smith. Instantiability of RSA-OAEP underchosen-plaintext attack. J. Cryptology, 30(3):889–919, 2017. https://doi.org/10.1007/

s00145-016-9238-4.

[145] Negar Kiyavash, Amir Houmansadr, and Nikita Borisov. Multi-flow attacks against networkflow watermarking schemes. In Paul C. van Oorschot, editor, Proceedings of the 17th USENIXSecurity Symposium, July 28-August 1, 2008, San Jose, CA, USA, pages 307–320. USENIXAssociation, 2008. ISBN 978-1-931971-60-7. http://www.usenix.org/events/sec08/tech/full_papers/kiyavash/kiyavash.pdf.

[146] Ios Kotsogiannis, Michael Hay, Ashwin Machanavajjhala, Gerome Miklau, and Margaret Orr.DIAS: differentially private interactive algorithm selection using pythia. In Salihoglu et al. [244],pages 1679–1682. ISBN 978-1-4503-4197-4. https://doi.org/10.1145/3035918.3056441.

14

Sen. Doc. No. 20-074

[147] Ios Kotsogiannis, Ashwin Machanavajjhala, Michael Hay, and Gerome Miklau. Pythia: Datadependent differentially private algorithm selection. In Salihoglu et al. [244], pages 1323–1337.ISBN 978-1-4503-4197-4. https://doi.org/10.1145/3035918.3035945.

[148] Ios Kotsogiannis, Yuchao Tao, Ashwin Machanavajjhala, Gerome Miklau, and MichaelHay. Architecting a differentially private SQL engine. In CIDR 2019, 9th BiennialConference on Innovative Data Systems Research, Asilomar, CA, USA, January 13-16,2019, Online Proceedings. www.cidrdb.org, 2019. http://cidrdb.org/cidr2019/papers/

p125-kotsogiannis-cidr19.pdf.

[149] Ravi Kumar, Alexander Tuzhilin, Christos Faloutsos, David D. Jensen, Gueorgi Kossinets,Jure Leskovec, and Andrew Tomkins. Social networks: looking ahead. In Li et al. [165], page1060. ISBN 978-1-60558-193-4. https://doi.org/10.1145/1401890.1402017.

[150] Daniel LaFlamme and Brian Neil Levine. Surviving Attacks on DNS using UbiquitousReplication. Technical Report 04-11, University of Massachusetts Amherst, Dept. of ComputerScience, March 2004.

[151] Brian Neil Levine and Marc Liberatore. DEX: Digital Evidence Provenance SupportingReproducibility and Comparison. In Proc. of DFRWS Annual Conference, August 2009.http://forensics.umass.edu/pubs/levine.dfrws.2009.pdf.

[152] Brian Neil Levine, Marc Liberatore, Brian Lynn, and Matthew Wright. Statistical Detectionof Downloaders in Freenet. In Proc. IEEE International Workshop on Privacy Engineering,pages 25–32, May 2017. http://ceur-ws.org/Vol-1873/IWPE17_paper_12.pdf.

[153] Brian Neil Levine and Gerome Miklau. Auditing and Forensic Analysis. In M. Tamer A-Zsuand Ling Liu, editors, Encyclopedia of Database Systems. Springer-Verlag, June 2009.

[154] Brian Neil Levine, Mike Reiter, Chenxi Wang, and Matthew Wright. Timing Attacks in Low-Latency Mix Systems. In Proc. Financial Cryptography (FC) (LNCS 3110), pages 251—265,February 2004. http://forensics.umass.edu/pubs/wright.FC04.pdf.

[155] Brian Neil Levine and Clay Shields. Hordes — A Multicast Based Protocol for Anonymity.Journal of Computer Security, 10(3):213–240, September 2002. http://portal.acm.org/

citation.cfm?id=603404.603406.

[156] Mark Lewko, Adam O’Neill, and Adam D. Smith. Regularity of lossy RSA on subdomains andits applications. In Thomas Johansson and Phong Q. Nguyen, editors, Advances in Cryptology- EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applicationsof Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings, volume 7881 ofLecture Notes in Computer Science, pages 55–75. Springer, 2013. ISBN 978-3-642-38347-2.https://doi.org/10.1007/978-3-642-38348-9_4.

[157] Chao Li, Michael Hay, Gerome Miklau, and Yue Wang. A data- and workload-aware queryanswering algorithm for range queries under differential privacy. PVLDB, 7(5):341–352, 2014.http://www.vldb.org/pvldb/vol7/p341-li.pdf.

[158] Chao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau, and Andrew McGregor. Optimizinglinear counting queries under differential privacy. In Jan Paredaens and Dirk Van Gucht, editors,Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principlesof Database Systems, PODS 2010, June 6-11, 2010, Indianapolis, Indiana, USA, pages 123–134.ACM, 2010. ISBN 978-1-4503-0033-9. https://doi.org/10.1145/1807085.1807104.

15

Sen. Doc. No. 20-074

[159] Chao Li, Daniel Yang Li, Gerome Miklau, and Dan Suciu. A theory of pricing private data. InTan et al. [275], pages 33–44. ISBN 978-1-4503-1598-2. https://doi.org/10.1145/2448496.2448502.

[160] Chao Li, Daniel Yang Li, Gerome Miklau, and Dan Suciu. A theory of pricing private data.ACM Trans. Database Syst., 39(4):34:1–34:28, 2014. https://doi.org/10.1145/2691190.

2691191.

[161] Chao Li and Gerome Miklau. An adaptive mechanism for accurate query answering underdifferential privacy. PVLDB, 5(6):514–525, 2012. http://vldb.org/pvldb/vol5/p514_

chaoli_vldb2012.pdf.

[162] Chao Li and Gerome Miklau. Optimal error of query sets under the differentially-privatematrix mechanism. In Tan et al. [275], pages 272–283. ISBN 978-1-4503-1598-2. https:

//doi.org/10.1145/2448496.2448529.

[163] Chao Li and Gerome Miklau. Lower bounds on the error of query sets under the differentially-private matrix mechanism. Theory Comput. Syst., 57(4):1159–1201, 2015. https://doi.org/10.1007/s00224-015-9610-z.

[164] Chao Li, Gerome Miklau, Michael Hay, Andrew McGregor, and Vibhor Rastogi. The matrixmechanism: optimizing linear counting queries under differential privacy. VLDB J., 24(6):757–781, 2015. https://doi.org/10.1007/s00778-015-0398-x.

[165] Ying Li, Bing Liu, and Sunita Sarawagi, editors. Proceedings of the 14th ACM SIGKDDInternational Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA,August 24-27, 2008. ACM, 2008. ISBN 978-1-60558-193-4.

[166] Marc Liberatore, Robert Erdely, Thomas Kerle, Brian Neil Levine, and Clay Shields. ForensicInvestigation of Peer-to-Peer File Sharing Networks. In Proc. DFRWS Annual Digital Foren-sics Research Conference, August 2010. http://forensics.umass.edu/pubs/liberatore.

dfrws2010.pdf.

[167] Marc Liberatore, Bikas Gurung, Brian Neil Levine, and Matthew Wright. Empirical Tests ofAnonymous Voice Over IP. Elsevier Journal of Network and Computer Applications, 34(1):341–350, January 2011. http://forensics.umass.edu/pubs/liberatore.JCNA.2010.pdf.

[168] Marc Liberatore and Brian Neil Levine. Inferring the Source of Encrypted HTTP Connections.In Proc. ACM conference on Computer and Communications Security (CCS), pages 255–263,October 2006. http://forensics.umass.edu/pubs/liberatore.ccs2006.pdf.

[169] Marc Liberatore, Brian Neil Levine, and Clay Shields. Strengthening Forensic Investigationsof Child Pornography on P2P Networks. In Proc. ACM Conference on Future NetworkingTechnologies (CoNEXT), November 2010. http://forensics.umass.edu/pubs/liberatore.conext.2010.pdf.

[170] Marc Liberatore, Brian Neil Levine, Clay Shields, and Brian Lynn. Efficient Tagging ofRemote Peers During Child Pornography Investigations. IEEE Transactions on Dependableand Secure Computing, 11(5):425–439, September 2014. http://forensics.umass.edu/

pubs/Liberatore.tdsc.2014.pdf.

16

Sen. Doc. No. 20-074

[171] David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors. Proceedingsof the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS2018, Toronto, ON, Canada, October 15-19, 2018. ACM, 2018. ISBN 978-1-4503-5693-0.http://dl.acm.org/citation.cfm?id=3243734.

[172] Lang Lin, Dan Holcomb, Dilip Kumar Krishnappa, Prasad Shabadi, and Wayne Burleson.Low-power sub-threshold design of secure physical unclonable functions. In 2010 ACM/IEEEInternational Symposium on Low-Power Electronics and Design (ISLPED), pages 43–48. IEEE,2010.

[173] Lang Lin, S. Srivathsa, D.K. Krishnappa, P. Shabadi, and W. Burleson. Design and validationof arbiter-based PUFs for sub-45-nm low-power security applications. IEEE Transactions onInformation Forensics and Security, 7(4):1394–1403, August 2012. ISSN 1556-6013.

[174] D. Liu, C. Yu, X. Zhang, and D. Holcomb. Oracle-guided incremental sat solving to reverseengineer camouflaged logic circuits. In 2016 Design, Automation Test in Europe ConferenceExhibition (DATE), pages 433–438, March 2016. ISSN 1558-1101.

[175] Wentian Lu and Gerome Miklau. Auditguard: a system for database auditing under retentionrestrictions. PVLDB, 1(2):1484–1487, 2008. http://www.vldb.org/pvldb/1/1454207.pdf.

[176] Wentian Lu and Gerome Miklau. Auditing a database under retention restrictions. InYannis E. Ioannidis, Dik Lun Lee, and Raymond T. Ng, editors, Proceedings of the 25thInternational Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009,Shanghai, China, pages 42–53. IEEE Computer Society, 2009. ISBN 978-0-7695-3545-6.https://doi.org/10.1109/ICDE.2009.125.

[177] Wentian Lu and Gerome Miklau. Exponential random graph estimation under differentialprivacy. In Sofus A. Macskassy, Claudia Perlich, Jure Leskovec, Wei Wang, and Rayid Ghani,editors, The 20th ACM SIGKDD International Conference on Knowledge Discovery and DataMining, KDD ’14, New York, NY, USA - August 24 - 27, 2014, pages 921–930. ACM, 2014.ISBN 978-1-4503-2956-9. https://doi.org/10.1145/2623330.2623683.

[178] Wentian Lu, Gerome Miklau, and Vani Gupta. Generating private synthetic databases foruntrusted system evaluation. In Isabel F. Cruz, Elena Ferrari, Yufei Tao, Elisa Bertino, andGoce Trajcevski, editors, IEEE 30th International Conference on Data Engineering, Chicago,ICDE 2014, IL, USA, March 31 - April 4, 2014, pages 652–663. IEEE Computer Society,2014. ISBN 978-1-4799-3480-5. https://doi.org/10.1109/ICDE.2014.6816689.

[179] Wentian Lu, Gerome Miklau, and Neil Immerman. Auditing a database under retentionpolicies. VLDB J., 22(2):203–228, 2013. https://doi.org/10.1007/s00778-012-0282-x.

[180] Xiaofeng Lu, Pan Hui, Don Towsley, Juhua Pu, and Zhang Xiong. LOPP: A location privacyprotected anonymous routing protocol for disruption tolerant network. IEICE Transactions,93-D(3):503–509, 2010. https://doi.org/10.1587/transinf.E93.D.503.

[181] Vitaliy B. Lvin, Gene Novark, Emery D. Berger, and Benjamin G. Zorn. Archipelago: tradingaddress space for reliability and security. In Susan J. Eggers and James R. Larus, editors,Proceedings of the 13th International Conference on Architectural Support for ProgrammingLanguages and Operating Systems, ASPLOS 2008, Seattle, WA, USA, March 1-5, 2008,pages 115–124. ACM, 2008. ISBN 978-1-59593-958-6. https://doi.org/10.1145/1346281.1346296.

17

Sen. Doc. No. 20-074

[182] Weixuan Mao, Zhongmin Cai, Xiaohong Guan, and Don Towsley. Centrality metrics ofimportance in access behaviors and malware detections. In Charles N. Payne Jr., Adam Hahn,Kevin R. B. Butler, and Micah Sherr, editors, Proceedings of the 30th Annual ComputerSecurity Applications Conference, ACSAC 2014, New Orleans, LA, USA, December 8-12,2014, pages 376–385. ACM, 2014. ISBN 978-1-4503-3005-3. https://doi.org/10.1145/

2664243.2664286.

[183] Weixuan Mao, Zhongmin Cai, Don Towsley, Qian Feng, and Xiaohong Guan. Securityimportance assessment for system objects and malware detection. Computers & Security, 68:47–68, 2017. https://doi.org/10.1016/j.cose.2017.02.009.

[184] Weixuan Mao, Zhongmin Cai, Don Towsley, and Xiaohong Guan. Probabilistic inference onintegrity for access behavior based malware detection. In Herbert Bos, Fabian Monrose, andGregory Blanc, editors, Research in Attacks, Intrusions, and Defenses - 18th InternationalSymposium, RAID 2015, Kyoto, Japan, November 2-4, 2015, Proceedings, volume 9404 ofLecture Notes in Computer Science, pages 155–176. Springer, 2015. ISBN 978-3-319-26361-8.https://doi.org/10.1007/978-3-319-26362-5_8.

[185] N. Boris Margolin and Brian Neil Levine. Informant: Detecting Sybils Using Incentives.In Proc. Financial Cryptography and Data Security (FC), pages 192–207, February 2007.http://forensics.umass.edu/pubs/margolin.FC.2007.pdf.

[186] N. Boris Margolin and Brian Neil Levine. Quantifying Resistance to the Sybil Attack. InProc. Financial Cryptography and Data Security (FC), pages 1–15, January 2008. http:

//forensics.umass.edu/pubs/margolin.fc08.pdf.

[187] Michael B. Matthews, editor. 51st Asilomar Conference on Signals, Systems, and Computers,ACSSC 2017, Pacific Grove, CA, USA, October 29 - November 1, 2017. IEEE, 2017. ISBN978-1-5386-1823-3. https://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8330843.

[188] Charalampos Mavroforakis, Nathan Chenette, Adam O’Neill, George Kollios, and Ran Canetti.Modular order-preserving encryption, revisited. In Timos K. Sellis, Susan B. Davidson, andZachary G. Ives, editors, Proceedings of the 2015 ACM SIGMOD International Conference onManagement of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pages 763–777.ACM, 2015. ISBN 978-1-4503-2758-9. https://doi.org/10.1145/2723372.2749455.

[189] Ryan McKenna, Gerome Miklau, Michael Hay, and Ashwin Machanavajjhala. Optimizing errorof high-dimensional statistical queries under differential privacy. PVLDB, 11(10):1206–1219,2018. http://www.vldb.org/pvldb/vol11/p1206-mckenna.pdf.

[190] Ryan McKenna, Daniel Sheldon, and Gerome Miklau. Graphical-model based estimation andinference for differential privacy. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors,Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June2019, Long Beach, California, USA, volume 97 of Proceedings of Machine Learning Research,pages 4435–4444. PMLR, 2019. http://proceedings.mlr.press/v97/mckenna19a.html.

[191] Richard McPherson, Amir Houmansadr, and Vitaly Shmatikov. Covertcast: Using livestreaming to evade internet censorship. PoPETs, 2016(3):212–225, 2016. https://doi.org/10.1515/popets-2016-0024.

18

Sen. Doc. No. 20-074

[192] Gerome Miklau, Brian Neil Levine, and Patrick Stahlberg. Securing History: Privacy andAccountability in Database Systems. In Biennial ACM/VLDB Conference on Innovative DataSystems Research (CIDR), pages 387–396, January 2007. http://forensics.umass.edu/

pubs/mikalu.cidr2007.pdf.

[193] Gerome Miklau, Brian Neil Levine, and Patrick Stahlberg. Securing history: Privacy andaccountability in database systems. In CIDR 2007, Third Biennial Conference on InnovativeData Systems Research, Asilomar, CA, USA, January 7-10, 2007, Online Proceedings, pages387–396. www.cidrdb.org, 2007. http://cidrdb.org/cidr2007/papers/cidr07p44.pdf.

[194] Gerome Miklau and Dan Suciu. Cryptographically enforced conditional access for XML. InMary F. Fernandez and Yannis Papakonstantinou, editors, Proceedings of the Fifth Inter-national Workshop on the Web and Databases, WebDB 2002, Madison, Wisconsin, USA,June 6-7, 2002, in conjunction with ACM PODS/SIGMOD 2002. Informal proceedings, pages101–106, 2002. http://www.db.ucsd.edu/webdb2002/papers/59.pdf.

[195] Gerome Miklau and Dan Suciu. Controlling access to published data using cryptography. InJohann Christoph Freytag, Peter C. Lockemann, Serge Abiteboul, Michael J. Carey, Patricia G.Selinger, and Andreas Heuer, editors, Proceedings of 29th International Conference on VeryLarge Data Bases, VLDB 2003, Berlin, Germany, September 9-12, 2003, pages 898–909.Morgan Kaufmann, 2003. ISBN 0-12-722442-4. http://www.vldb.org/conf/2003/papers/S27P01.pdf.

[196] Gerome Miklau and Dan Suciu. Enabling secure data exchange. IEEE Data Eng. Bull., 27(1):34–41, 2004. ftp://ftp.research.microsoft.com/pub/debull/A04mar/suciu.ps.

[197] Gerome Miklau and Dan Suciu. Implementing a tamper-evident database system. In StephaneGrumbach, Liying Sui, and Victor Vianu, editors, Advances in Computer Science - ASIAN2005, Data Management on the Web, 10th Asian Computing Science Conference, Kunming,China, December 7-9, 2005, Proceedings, volume 3818 of Lecture Notes in Computer Science,pages 28–48. Springer, 2005. ISBN 3-540-30767-2. https://doi.org/10.1007/11596370_5.

[198] Gerome Miklau and Dan Suciu. A formal analysis of information disclosure in data exchange. J.Comput. Syst. Sci., 73(3):507–534, 2007. https://doi.org/10.1016/j.jcss.2006.10.004.

[199] Zarrin Montazeri, Amir Houmansadr, and Hossein Pishro-Nik. Achieving perfect loca-tion privacy in markov models using anonymization. In 2016 International Symposiumon Information Theory and Its Applications, ISITA 2016, Monterey, CA, USA, Octo-ber 30 - November 2, 2016, pages 355–359. IEEE, 2016. ISBN 978-4-88552-309-0. http:

//ieeexplore.ieee.org/document/7840445/.

[200] Zarrin Montazeri, Amir Houmansadr, and Hossein Pishro-Nik. Defining perfect locationprivacy using anonymization. In 2016 Annual Conference on Information Science and Systems,CISS 2016, Princeton, NJ, USA, March 16-18, 2016, pages 204–209. IEEE, 2016. ISBN978-1-4673-9457-4. https://doi.org/10.1109/CISS.2016.7460502.

[201] Zarrin Montazeri, Amir Houmansadr, and Hossein Pishro-Nik. Achieving perfect locationprivacy in wireless devices using anonymization. IEEE Trans. Information Forensics andSecurity, 12(11):2683–2698, 2017. https://doi.org/10.1109/TIFS.2017.2713341.

19

Sen. Doc. No. 20-074

[202] Shishir Nagaraja, Amir Houmansadr, Pratch Piyawongwisal, Vijit Singh, Pragya Agarwal,and Nikita Borisov. Stegobot: A covert social network botnet. In Filler et al. [75], pages299–313. ISBN 978-3-642-24177-2. https://doi.org/10.1007/978-3-642-24178-9_21.

[203] Milad Nasr, Alireza Bahramali, and Amir Houmansadr. Deepcorr: Strong flow correlationattacks on tor using deep learning. In Lie et al. [171], pages 1962–1976. ISBN 978-1-4503-5693-0.https://doi.org/10.1145/3243734.3243824.

[204] Milad Nasr, Sadegh Farhang, Amir Houmansadr, and Jens Grossklags. En-emy at the gateways: Censorship-resilient proxy distribution using game the-ory. In 26th Annual Network and Distributed System Security Symposium, NDSS2019, San Diego, California, USA, February 24-27, 2019. The Internet Soci-ety, 2019. ISBN 1-891562-55-X. https://www.ndss-symposium.org/ndss-paper/

enemy-at-the-gateways-censorship-resilient-proxy-distribution-using-game-theory/.

[205] Milad Nasr and Amir Houmansadr. GAME OF DECOYS: optimal decoy routing throughgame theory. In Weippl et al. [287], pages 1727–1738. ISBN 978-1-4503-4139-4. https:

//doi.org/10.1145/2976749.2978367.

[206] Milad Nasr, Amir Houmansadr, and Arya Mazumdar. Compressive traffic analysis: A newparadigm for scalable traffic analysis. In Thuraisingham et al. [276], pages 2053–2069. ISBN978-1-4503-4946-8. https://doi.org/10.1145/3133956.3134074.

[207] Milad Nasr, Reza Shokri, and Amir Houmansadr. Machine learning with membership privacyusing adversarial regularization. In Lie et al. [171], pages 634–646. ISBN 978-1-4503-5693-0.https://doi.org/10.1145/3243734.3243855.

[208] Milad Nasr, Hadi Zolfaghari, and Amir Houmansadr. The waterfall of liberty: Decoy routingcircumvention that resists routing attacks. In Thuraisingham et al. [276], pages 2037–2052.ISBN 978-1-4503-4946-8. https://doi.org/10.1145/3133956.3134075.

[209] Jennifer Neville and David D. Jensen. Dependency networks for relational data. In Proceedingsof the 4th IEEE International Conference on Data Mining (ICDM 2004), 1-4 November2004, Brighton, UK, pages 170–177. IEEE Computer Society, 2004. ISBN 0-7695-2142-8.https://doi.org/10.1109/ICDM.2004.10101.

[210] Jennifer Neville and David D. Jensen. Leveraging relational autocorrelation with latent groupmodels. In Proceedings of the 5th IEEE International Conference on Data Mining (ICDM2005), 27-30 November 2005, Houston, Texas, USA, pages 322–329. IEEE Computer Society,2005. ISBN 0-7695-2278-5. https://doi.org/10.1109/ICDM.2005.89.

[211] Jennifer Neville, David D. Jensen, Lisa Friedland, and Michael Hay. Learning relationalprobability trees. In Getoor et al. [86], pages 625–630. ISBN 1-58113-737-0. https://doi.

org/10.1145/956750.956830.

[212] Jennifer Neville, David D. Jensen, and Brian Gallagher. Simple estimators for relationalbayesian classifiers. In Proceedings of the 3rd IEEE International Conference on Data Mining(ICDM 2003), 19-22 December 2003, Melbourne, Florida, USA, pages 609–612. IEEE ComputerSociety, 2003. ISBN 0-7695-1978-4. https://doi.org/10.1109/ICDM.2003.1250989.

[213] Jennifer Neville, Ozgur Simsek, David D. Jensen, John Komoroske, Kelly Palmer, andHenry G. Goldberg. Using relational knowledge discovery to prevent securities fraud. In

20

Sen. Doc. No. 20-074

Robert Grossman, Roberto J. Bayardo, and Kristin P. Bennett, editors, Proceedings of theEleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,Chicago, Illinois, USA, August 21-24, 2005, pages 449–458. ACM, 2005. ISBN 1-59593-135-X.https://doi.org/10.1145/1081870.1081922.

[214] Rishab Nithyanand, Oleksii Starov, Phillipa Gill, Adva Zair, and Michael Schapira. Measuringand mitigating as-level adversaries against tor. In 23rd Annual Network and DistributedSystem Security Symposium, NDSS 2016, San Diego, California, USA, February 21-24, 2016.The Internet Society, 2016. http://wp.internetsociety.org/ndss/wp-content/uploads/sites/25/2017/09/measuring-mitigating-as-level-adversaries-against-tor.pdf.

[215] Gene Novark and Emery D. Berger. Dieharder: securing the heap. In Ehab Al-Shaer,Angelos D. Keromytis, and Vitaly Shmatikov, editors, Proceedings of the 17th ACM Conferenceon Computer and Communications Security, CCS 2010, Chicago, Illinois, USA, October 4-8,2010, pages 573–584. ACM, 2010. ISBN 978-1-4503-0245-6. https://doi.org/10.1145/

1866307.1866371.

[216] Gene Novark and Emery D. Berger. Dieharder: Securing the heap. In David Brumleyand Michal Zalewski, editors, 5th USENIX Workshop on Offensive Technologies, WOOT’11,August 8, 2011, San Francisco, CA, USA, Proceedings, pages 103–117. USENIX Association,2011. http://static.usenix.org/event/woot11/tech/final_files/Novark.pdf.

[217] Tim Oates and David D. Jensen. Large datasets lead to overly complex models: An explanationand a solution. In Rakesh Agrawal, Paul E. Stolorz, and Gregory Piatetsky-Shapiro, editors,Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining(KDD-98), New York City, New York, USA, August 27-31, 1998, pages 294–298. AAAI Press,1998. ISBN 1-57735-070-7. http://www.aaai.org/Library/KDD/1998/kdd98-052.php.

[218] Adam O’Neill. Definitional issues in functional encryption. IACR Cryptology ePrint Archive,2010:556, 2010. http://eprint.iacr.org/2010/556.

[219] Adam O’Neill. Stronger security notions for trapdoor functions and applications. PhD thesis,Georgia Institute of Technology, Atlanta, GA, USA, 2010. http://hdl.handle.net/1853/37109.

[220] Adam O’Neill, Chris Peikert, and Brent Waters. Bi-deniable public-key encryption. IACRCryptology ePrint Archive, 2011:352, 2011. http://eprint.iacr.org/2011/352.

[221] Adam O’Neill, Chris Peikert, and Brent Waters. Bi-deniable public-key encryption. InRogaway [238], pages 525–542. ISBN 978-3-642-22791-2. https://doi.org/10.1007/

978-3-642-22792-9_30.

[222] Fatma Ozcan, Georgia Koutrika, and Sam Madden, editors. Proceedings of the 2016 In-ternational Conference on Management of Data, SIGMOD Conference 2016, San Fran-cisco, CA, USA, June 26 - July 01, 2016. ACM, 2016. ISBN 978-1-4503-3531-7. https:

//doi.org/10.1145/2882903.

[223] Chris Piro, Clay Shields, and Brian Neil Levine. Detecting the Sybil Attack in Ad hoc Networks.In Proc. IEEE/ACM International Conference on Security and Privacy in CommunicationNetworks (SecureComm), pages 1–11, August 2006. http://forensics.umass.edu/pubs/

piro.securecomm2006.pdf.

21

Sen. Doc. No. 20-074

[224] George Provelengios, Chethan Ramesh, Shivukumar B. Patil, Ken Eguro, Russell Tessier,and Daniel Holcomb. Characterization of long wire data leakage in deep submicron fpgas. InProceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable GateArrays, FPGA ’19, pages 292–297. ACM, New York, NY, USA, 2019. ISBN 978-1-4503-6137-8.http://doi.acm.org/10.1145/3289602.3293923.

[225] Foster J. Provost, David D. Jensen, and Tim Oates. Efficient progressive sampling. InUsama M. Fayyad, Surajit Chaudhuri, and David Madigan, editors, Proceedings of theFifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,San Diego, CA, USA, August 15-18, 1999, pages 23–32. ACM, 1999. ISBN 1-58113-143-7.https://doi.org/10.1145/312129.312188.

[226] Swagatika Prusty, Brian Neil Levine, and Marc Liberatore. Forensic Investigation of theOneSwarm Anonymous Filesharing System. In Proc. ACM Conference on Computer &Communications Security (CCS), pages 201–214, October 2011. http://forensics.umass.

edu/pubs/prusty.ccs.2011.pdf.

[227] Amir Rahmati, Matthew Hicks, Daniel E. Holcomb, and Kevin Fu. Probable cause: Thedeanonymizing effects of approximate dram. In Proceedings of the 42Nd Annual InternationalSymposium on Computer Architecture, ISCA ’15, pages 604–615. ACM, New York, NY, USA,2015. ISBN 978-1-4503-3402-0. http://doi.acm.org/10.1145/2749469.2750419.

[228] Amir Rahmati, Mastooreh Salajegheh, Dan Holcomb, Jacob Sorber, Wayne P. Burleson,and Kevin Fu. Tardis: Time and remanence decay in sram to implement secure protocolson embedded devices without clocks. In Proceedings of the 21st USENIX Conference onSecurity Symposium, Security’12, page 36. USENIX Association, Berkeley, CA, USA, 2012.http://dl.acm.org/citation.cfm?id=2362793.2362829.

[229] Sundaresan Rajasekaran, Harpreet Singh Chawla, Zhen Ni, Neel Shah, Emery Berger, andTimothy Wood. CRIMES: using evidence to secure the cloud. In Paulo Ferreira and LiubaShrira, editors, Proceedings of the 19th International Middleware Conference, Middleware 2018,Rennes, France, December 10-14, 2018, pages 40–52. ACM, 2018. ISBN 978-1-4503-5702-9.https://doi.org/10.1145/3274808.3274812.

[230] C. Ramesh, S. B. Patil, S. N. Dhanuskodi, G. Provelengios, S. Pillement, D. Holcomb, andR. Tessier. Fpga side channel attacks without physical access. In 2018 IEEE 26th AnnualInternational Symposium on Field-Programmable Custom Computing Machines (FCCM),pages 45–52, April 2018. ISSN 2576-2621.

[231] Vibhor Rastogi, Michael Hay, Gerome Miklau, and Dan Suciu. Relationship privacy: outputperturbation for queries with joins. In Jan Paredaens and Jianwen Su, editors, Proceedings ofthe Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of DatabaseSystems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA, pages 107–116.ACM, 2009. ISBN 978-1-60558-553-6. https://doi.org/10.1145/1559795.1559812.

[232] Matthew J. Rattigan and David D. Jensen. Leveraging d-separation for relational data sets. InGeoffrey I. Webb, Bing Liu, Chengqi Zhang, Dimitrios Gunopulos, and Xindong Wu, editors,ICDM 2010, The 10th IEEE International Conference on Data Mining, Sydney, Australia,14-17 December 2010, pages 989–994. IEEE Computer Society, 2010. ISBN 978-0-7695-4256-0.https://doi.org/10.1109/ICDM.2010.142.

22

Sen. Doc. No. 20-074

[233] Matthew J. Rattigan, Marc E. Maier, and David D. Jensen. Using structure indices for efficientapproximation of network properties. In Tina Eliassi-Rad, Lyle H. Ungar, Mark Craven,and Dimitrios Gunopulos, editors, Proceedings of the Twelfth ACM SIGKDD InternationalConference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23,2006, pages 357–366. ACM, 2006. ISBN 1-59593-339-5. https://doi.org/10.1145/1150402.1150443.

[234] Matthew J. Rattigan, Marc E. Maier, David D. Jensen, Bin Wu, Xin Pei, Jianbin Tan, andYi Wang. Exploiting network structure for active inference in collective classification. InWorkshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM2007), October 28-31, 2007, Omaha, Nebraska, USA, pages 429–434. IEEE Computer Society,2007. ISBN 0-7695-3033-8. https://doi.org/10.1109/ICDMW.2007.124.

[235] Abbas Razaghpanah, Arian Akhavan Niaki, Narseo Vallina-Rodriguez, Srikanth Sundaresan,Johanna Amann, and Phillipa Gill. Studying TLS usage in android apps. In Proceedings ofthe 13th International Conference on emerging Networking EXperiments and Technologies,CoNEXT 2017, Incheon, Republic of Korea, December 12 - 15, 2017 [1], pages 350–362. ISBN978-1-4503-5422-6. https://doi.org/10.1145/3143361.3143400.

[236] Fatemeh Rezaei and Amir Houmansadr. Tagit: Tagging network flows using blind fingerprints.PoPETs, 2017(4):290–307, 2017. https://doi.org/10.1515/popets-2017-0050.

[237] Bruno F. Ribeiro, Weifeng Chen, Gerome Miklau, and Donald F. Towsley. Analyzing privacyin enterprise packet trace anonymization. In Proceedings of the Network and DistributedSystem Security Symposium, NDSS 2008, San Diego, California, USA, 10th February - 13thFebruary 2008. The Internet Society, 2008. http://www.isoc.org/isoc/conferences/ndss/08/papers/07_analyzing_privacy_enterprise.pdf.

[238] Phillip Rogaway, editor. Advances in Cryptology - CRYPTO 2011 - 31st Annual CryptologyConference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings, volume 6841 ofLecture Notes in Computer Science. Springer, 2011. ISBN 978-3-642-22791-2. https://doi.org/10.1007/978-3-642-22792-9.

[239] M. Rostami, Wayne Burleson, F. Koushanfar, and A. Juels. Balancing security and utilityin medical devices. In Proceedings of the 50th Annual ACM Design Automation Conference,May 2013.

[240] U. Ruhrmair, J. Solter, F. Sehnke, Xiaolin Xu, A. Mahmoud, V. Stoyanova, G. Dror, J. Schmid-huber, Wayne Burleson, and S. Devadas. Puf modeling attacks on simulated and silicon data.IEEE Transactions on Information Forensics and Security, 8(11):1876–1891, November 2013.ISSN 1556-6013.

[241] Ulrich Ruhrmair, Xiaolin Xu, Jan Solter, Ahmed Mahmoud, Mehrdad Majzoobi, FarinazKoushanfar, and Wayne Burleson. Efficient power and timing side channels for physicalunclonable functions. In Cryptographic Hardware and Embedded Systems (CHES), 2014.

[242] Amir Houman Sadr and Shahrokh Ghaemmaghami. Robustness enhancement of content-based watermarks using entropy masking effect. In Mauro Barni, Ingemar J. Cox, TonKalker, and Hyoung Joong Kim, editors, Digital Watermarking, 4th International Workshop,IWDW 2005, Siena, Italy, September 15-17, 2005, Proceedings, volume 3710 of LectureNotes in Computer Science, pages 444–458. Springer, 2005. ISBN 3-540-28768-X. https:

//doi.org/10.1007/11551492_34.

23

Sen. Doc. No. 20-074

[243] Amir Houman Sadr and Shahrokh Ghaemmaghami. A collusion-resistant video watermarkingscheme. In Jan Camenisch, Christian S. Collberg, Neil F. Johnson, and Phil Sallee, editors,Information Hiding, 8th International Workshop, IH 2006, Alexandria, VA, USA, July 10-12,2006. Revised Selcted Papers, volume 4437 of Lecture Notes in Computer Science, pages 343–354.Springer, 2006. ISBN 978-3-540-74123-7. https://doi.org/10.1007/978-3-540-74124-4_23.

[244] Semih Salihoglu, Wenchao Zhou, Rada Chirkova, Jun Yang, and Dan Suciu, editors. Proceedingsof the 2017 ACM International Conference on Management of Data, SIGMOD Conference2017, Chicago, IL, USA, May 14-19, 2017. ACM, 2017. ISBN 978-1-4503-4197-4. http:

//dl.acm.org/citation.cfm?id=3035918.

[245] Kimaya Sanzgiri, Bridget Dahill, Daniel LaFlamme, Brian Neil Levine, Clay Shields, andElizabeth Belding-Royer. Authenticated Routing for Ad hoc Networks. IEEE/ACM Journalof Selected Areas in Communications: Special issue on Wireless Ad hoc Networks (JSAC), 23(3):598–610, March 2005. http://forensics.umass.edu/pubs/aran_jsac05.pdf.

[246] Kimaya Sanzgiri, Bridget Dahill, Brian Neil Levine, Clay Shields, and Elizabeth Belding-Royer.A Secure Routing Protocol for Ad hoc Networks. In Proc. of IEEE International Conferenceon Network Protocols (ICNP), pages 78–89, November 2002. http://forensics.umass.edu/pubs/aran.icnp02.pdf.

[247] Ted E. Senator, Henry G. Goldberg, Alex Memory, William T. Young, Brad Rees, RobertPierce, Daniel Huang, Matthew Reardon, David A. Bader, Edmond Chow, Irfan A. Essa,Joshua Jones, Vinay Bettadapura, Duen Horng Chau, Oded Green, Oguz Kaya, AnitaZakrzewska, Erica Briscoe, Rudolph L. Mappus IV, Robert McColl, Lora Weiss, Thomas G.Dietterich, Alan Fern, Weng-Keen Wong, Shubhomoy Das, Andrew Emmott, Jed Irvine,Jay Yoon Lee, Danai Koutra, Christos Faloutsos, Daniel D. Corkill, Lisa Friedland, AmandaGentzel, and David D. Jensen. Detecting insider threats in a real corporate database ofcomputer usage activity. In Inderjit S. Dhillon, Yehuda Koren, Rayid Ghani, Ted E. Senator,Paul Bradley, Rajesh Parekh, Jingrui He, Robert L. Grossman, and Ramasamy Uthurusamy,editors, The 19th ACM SIGKDD International Conference on Knowledge Discovery and DataMining, KDD 2013, Chicago, IL, USA, August 11-14, 2013, pages 1393–1401. ACM, 2013.ISBN 978-1-4503-2174-7. https://doi.org/10.1145/2487575.2488213.

[248] Azadeh Sheikholeslami, Boulat A. Bash, Don Towsley, Dennis Goeckel, and Saikat Guha.Covert communication over classical-quantum channels. In IEEE International Symposium onInformation Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, pages 2064–2068. IEEE,2016. ISBN 978-1-5090-1806-2. https://doi.org/10.1109/ISIT.2016.7541662.

[249] Azadeh Sheikholeslami, Majid Ghaderi, Don Towsley, Boulat A. Bash, Saikat Guha, andDennis Goeckel. Multi-hop routing in covert wireless networks. IEEE Trans. WirelessCommunications, 17(6):3656–3669, 2018. https://doi.org/10.1109/TWC.2018.2812881.

[250] Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik, and Don Towsley. Physical layersecurity from inter-session interference in large wireless networks. In Albert G. Greenbergand Kazem Sohraby, editors, Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA,March 25-30, 2012, pages 1179–1187. IEEE, 2012. ISBN 978-1-4673-0773-4. https://doi.

org/10.1109/INFCOM.2012.6195477.

24

Sen. Doc. No. 20-074

[251] Clay Shields and Brian Neil Levine. A Protocol for Anonymous Communication Over theInternet. In Proc. ACM Conference on Computer and Communication Security (CCS), pages33–43, November 2000. http://doi.acm.org/10.1145/352600.352607.

[252] Rachee Singh, Hyungjoon Koo, Najmehalsadat Miramirkhani, Fahimeh Mirhaj, PhillipaGill, and Leman Akoglu. The politics of routing: Investigating the relationship between ASconnectivity and internet freedom. In Amir Houmansadr and Prateek Mittal, editors, 6thUSENIX Workshop on Free and Open Communications on the Internet, FOCI ’16, Austin, TX,USA, August 8, 2016. USENIX Association, 2016. https://www.usenix.org/conference/

foci16/workshop-program/presentation/singh.

[253] Rachee Singh, Rishab Nithyanand, Sadia Afroz, Paul Pearce, Michael Carl Tschantz,Phillipa Gill, and Vern Paxson. Characterizing the nature and dynamics of tor exit block-ing. In Engin Kirda and Thomas Ristenpart, editors, 26th USENIX Security Symposium,USENIX Security 2017, Vancouver, BC, Canada, August 16-18, 2017., pages 325–341.USENIX Association, 2017. https://www.usenix.org/conference/usenixsecurity17/

technical-sessions/presentation/singh.

[254] Rachee Singh, Rishab Nithyanand, Sadia Afroz, Paul Pearce, Michael Carl Tschantz, PhillipaGill, and Vern Paxson. Characterizing the nature and dynamics of tor exit blocking. In Pro-ceedings of the Applied Networking Research Workshop, ANRW 2018, Montreal, QC, Canada,July 16-16, 2018, page 23. ACM, 2018. https://doi.org/10.1145/3232755.3232786.

[255] Tamara V. Sobers, Boulat A. Bash, Dennis Goeckel, Saikat Guha, and Don Towsley. Covertcommunication with the help of an uninformed jammer achieves positive rate. In Michael B.Matthews, editor, 49th Asilomar Conference on Signals, Systems and Computers, ACSSC2015, Pacific Grove, CA, USA, November 8-11, 2015, pages 625–629. IEEE, 2015. ISBN978-1-4673-8576-3. https://doi.org/10.1109/ACSSC.2015.7421206.

[256] Tamara V. Sobers, Boulat A. Bash, Saikat Guha, Don Towsley, and Dennis Goeckel. Covertcommunication in the presence of an uninformed jammer. IEEE Trans. Wireless Communica-tions, 16(9):6193–6206, 2017. https://doi.org/10.1109/TWC.2017.2720736.

[257] Tamara V. Sobers, Boulat A. Bash, Saikat Guha, Don Towsley, and Dennis Goeckel. Covertcommunications on continuous-time channels in the presence of jamming. In Matthews[187], pages 1697–1701. ISBN 978-1-5386-1823-3. https://doi.org/10.1109/ACSSC.2017.

8335649.

[258] Ramin Soltani, Boulat A. Bash, Dennis Goeckel, Saikat Guha, and Don Towsley. Covertsingle-hop communication in a wireless network with distributed artificial noise generation.In 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton2014, Allerton Park & Retreat Center, Monticello, IL, USA, September 30 - October 3, 2014,pages 1078–1085. IEEE, 2014. https://doi.org/10.1109/ALLERTON.2014.7028575.

[259] Ramin Soltani, Dennis Goeckel, Don Towsley, Boulat A. Bash, and Saikat Guha. Covertwireless communication with artificial noise generation. IEEE Trans. Wireless Communications,17(11):7252–7267, 2018. https://doi.org/10.1109/TWC.2018.2865946.

[260] Ramin Soltani, Dennis Goeckel, Don Towsley, and Amir Houmansadr. Covert communica-tions on poisson packet channels. In 53rd Annual Allerton Conference on Communication,Control, and Computing, Allerton 2015, Allerton Park & Retreat Center, Monticello, IL,

25

Sen. Doc. No. 20-074

USA, September 29 - October 2, 2015, pages 1046–1052. IEEE, 2015. ISBN 978-1-5090-1824-6.https://doi.org/10.1109/ALLERTON.2015.7447124.

[261] Ramin Soltani, Dennis Goeckel, Don Towsley, and Amir Houmansadr. Covert communicationson renewal packet channels. In 54th Annual Allerton Conference on Communication, Control,and Computing, Allerton 2016, Monticello, IL, USA, September 27-30, 2016, pages 548–555.IEEE, 2016. ISBN 978-1-5090-4550-1. https://doi.org/10.1109/ALLERTON.2016.7852279.

[262] Ramin Soltani, Dennis Goeckel, Don Towsley, and Amir Houmansadr. Towards provablyinvisible network flow fingerprints. In Matthews [187], pages 258–262. ISBN 978-1-5386-1823-3.https://doi.org/10.1109/ACSSC.2017.8335179.

[263] Ramin Soltani, Dennis Goeckel, Don Towsley, and Amir Houmansadr. Fundamental limits ofcovert bit insertion in packets. In 56th Annual Allerton Conference on Communication, Control,and Computing, Allerton 2018, Monticello, IL, USA, October 2-5, 2018, pages 1065–1072.IEEE, 2018. ISBN 978-1-5386-6596-1. https://doi.org/10.1109/ALLERTON.2018.8635975.

[264] Hamed Soroush, Keen Sung, Erik Learned-Miller, Brian Neil Levine, and Marc Liberatore.Turning Off GPS is Not Enough: Cellular location leaks over the Internet. In Proc. PrivacyEnhancing Technologies Symposium (PETS), pages 103–122, July 2013. http://forensics.umass.edu/pubs/soroush.pets.2013.pdf.

[265] S.K. Srivathsa and Wayne Burleson. Subthreshold design of physical unclonable functions. InIEEE Subthreshold Microelectronics Conference, 2011.

[266] Patrick Stahlberg, Gerome Miklau, and Brian Neil Levine. Threats to Privacy in the ForensicAnalysis of Database Systems. In Proc. ACM Intl Conf. on Management of Data (SIGMOD),pages 91–102, June 2007. http://forensics.umass.edu/pubs/stahlberg07forensicDB.

pdf.

[267] Keen Sung, Joydeep Biswas, Erik Learned-Miller, Brian Neil Levine, and Marc Liberatore.Server-side traffic analysis reveals mobile location information over the Internet. ACMTransactions on Mobile Computing, 18(6):1407–1418, June 2019. http://forensics.cs.

umass.edu/pubs/sung.TMC.2018.pdf.

[268] Keen Sung, Brian Neil Levine, and Marc Liberatore. Location Privacy without CarrierCooperation. In Proc. IEEE Workshop on Mobile System Technologies (MoST), May 2014.http://forensics.umass.edu/pubs/Sung-MoST-2014.pdf.

[269] V. Suresh and Wayne Burleson. Reflex: Re-configurable logic for entropy extraction. In IEEESystem on Chip Conference (IEEE SOCC), 2014.

[270] Nazanin Takbiri, Dennis L. Goeckel, Amir Houmansadr, and Hossein Pishro-Nik. Asymptoticlimits of privacy in bayesian time series matching. In 53rd Annual Conference on InformationSciences and Systems, CISS 2019, Baltimore, MD, USA, March 20-22, 2019, pages 1–6. IEEE,2019. ISBN 978-1-7281-1151-3. https://doi.org/10.1109/CISS.2019.8692936.

[271] Nazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, and Hossein Pishro-Nik. Fundamentallimits of location privacy using anonymization. In 51st Annual Conference on InformationSciences and Systems, CISS 2017, Baltimore, MD, USA, March 22-24, 2017, pages 1–6. IEEE,2017. ISBN 978-1-5090-4780-2. https://doi.org/10.1109/CISS.2017.7926069.

26

Sen. Doc. No. 20-074

[272] Nazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, and Hossein Pishro-Nik. Limits oflocation privacy under anonymization and obfuscation. In 2017 IEEE International Symposiumon Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017, pages 764–768.IEEE, 2017. ISBN 978-1-5090-4096-4. https://doi.org/10.1109/ISIT.2017.8006631.

[273] Nazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, and Hossein Pishro-Nik. Privacyagainst statistical matching: Inter-user correlation. In 2018 IEEE International Symposiumon Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018, pages 1036–1040. IEEE,2018. ISBN 978-1-5386-4781-3. https://doi.org/10.1109/ISIT.2018.8437352.

[274] Nazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, and Hossein Pishro-Nik. Matchinganonymized and obfuscated time series to users’ profiles. IEEE Trans. Information Theory,65(2):724–741, 2019. https://doi.org/10.1109/TIT.2018.2873134.

[275] Wang-Chiew Tan, Giovanna Guerrini, Barbara Catania, and Anastasios Gounaris, editors.Joint 2013 EDBT/ICDT Conferences, ICDT ’13 Proceedings, Genoa, Italy, March 18-22, 2013.ACM, 2013. ISBN 978-1-4503-1598-2. http://dl.acm.org/citation.cfm?id=2448496.

[276] Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, editors. Proceedingsof the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017,Dallas, TX, USA, October 30 - November 03, 2017. ACM, 2017. ISBN 978-1-4503-4946-8.https://doi.org/10.1145/3133956.

[277] John Tuttle, Robert J. Walls, Erik Learned-Miller, and Brian Neil Levine. Reverse Engineeringfor Mobile Systems Forensics with Ares. In Proc. ACM Workshop on Insider Threats, October2010. http://forensics.umass.edu/pubs/tuttle.ares.2010.pdf.

[278] M. A. Usmani, S. Keshavarz, E. Matthews, L. Shannon, R. Tessier, and D. E. Holcomb.Efficient puf-based key generation in fpgas using per-device configuration. IEEE Transactionson Very Large Scale Integration (VLSI) Systems, 27(2):364–375, Feb 2019. ISSN 1063-8210.

[279] Saksham Varma, Robert J. Walls, Brian Lynn, and Brian Neil Levine. Efficient Smart PhoneForensics Based on Relevance Feedback. In Proc. ACM Workshop on Security and Privacy inSmartphones and Mobile Devices, pages 81–91, November 2014. http://forensics.umass.edu/pubs/varma.spsm.2014.pdf.

[280] Sudarshan Vasudevan, Dennis Goeckel, and Donald F. Towsley. Security-capacity trade-off inlarge wireless networks using keyless secrecy. In Nitin H. Vaidya, Christoph Lindemann, andJitendra Padhye, editors, Proceedings of the 11th ACM Interational Symposium on Mobile AdHoc Networking and Computing, MobiHoc 2010, Chicago, IL, USA, September 20-24, 2010,pages 21–30. ACM, 2010. ISBN 978-1-4503-0183-1. https://doi.org/10.1145/1860093.

1860097.

[281] A. Vijayakumar, V. C. Patil, D. E. Holcomb, C. Paar, and S. Kundu. Physical designobfuscation of hardware: A comprehensive investigation of device and logic-level techniques.IEEE Transactions on Information Forensics and Security, 12(1):64–77, Jan 2017. ISSN1556-6013.

[282] David A. Wagner, editor. Advances in Cryptology - CRYPTO 2008, 28th Annual InternationalCryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings, volume5157 of Lecture Notes in Computer Science. Springer, 2008. ISBN 978-3-540-85173-8. https://doi.org/10.1007/978-3-540-85174-5.

27

Sen. Doc. No. 20-074

[283] Robert J. Walls, Erik Learned-Miller, and Brian Neil Levine. Forensic Triage for Mobile Phoneswith DEC0DE. In Proc. USENIX Security Symposium, August 2011. http://forensics.

umass.edu/pubs/Walls.usenixSecurity.2011.pdf.

[284] Robert J. Walls, Brian Neil Levine, Marc Liberatore, and Clay Shields. Effective DigitalForensics Research is Investigator-Centric. In Proc. USENIX Workshop on Hot Topics inSecurity (HotSec), August 2011. http://forensics.umass.edu/pubs/Walls.hotsec.2011.pdf.

[285] Huiming Wang, Tongxing Zheng, Jinhong Yuan, Don Towsley, and Moon Ho Lee. Physicallayer security in heterogeneous cellular networks. IEEE Trans. Communications, 64(3):1204–1219, 2016. https://doi.org/10.1109/TCOMM.2016.2519402.

[286] Qiyan Wang, Xun Gong, Giang T. K. Nguyen, Amir Houmansadr, and Nikita Borisov.Censorspoofer: asymmetric communication using IP spoofing for censorship-resistant webbrowsing. In Ting Yu, George Danezis, and Virgil D. Gligor, editors, the ACM Conference onComputer and Communications Security, CCS’12, Raleigh, NC, USA, October 16-18, 2012,pages 121–132. ACM, 2012. ISBN 978-1-4503-1651-4. https://doi.org/10.1145/2382196.2382212.

[287] Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and ShaiHalevi, editors. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Commu-nications Security, Vienna, Austria, October 24-28, 2016. ACM, 2016. ISBN 978-1-4503-4139-4.http://dl.acm.org/citation.cfm?id=2976749.

[288] Janis Wolak, Marc Liberatore, and Brian Neil Levine. Measuring a year of child pornographytrafficking by US computers on a peer-to-peer network. Elsevier Child Abuse & Neglect, 38(2):347–356, February 2014. http://dx.doi.org/10.1016/j.chiabu.2013.10.018.

[289] Matthew Wright, Micah Adler, Brian Neil Levine, and Clay Shields. An Analysis of theDegradation of Anonymous Protocols. In Proc. ISOC Symposium Network and DistributedSystem Security (NDSS), pages 38–50, February 2002. http://forensics.umass.edu/pubs/wright.ndss01.pdf. Outstanding Paper Award.

[290] Matthew Wright, Micah Adler, Brian Neil Levine, and Clay Shields. Defending AnonymousCommunication Against Passive Logging Attacks. In Proc. IEEE Symposium on Secu-rity and Privacy (Oakland), pages 28–41, May 2003. http://forensics.umass.edu/pubs/wright-passive.pdf.

[291] Matthew Wright, Micah Adler, Brian Neil Levine, and Clay Shields. The Predecessor Attack:An Analysis of a Threat to Anonymous Communications Systems. ACM Transactionson Information and System Security (TISSEC), 4(7):489–522, November 2004. http://

forensics.umass.edu/pubs/wright-tissec.pdf.

[292] Matthew Wright, Micah Adler, Brian Neil Levine, and Clay Shields. Passive-Logging AttacksAgainst Anonymous Communications Systems. ACM Transactions on Information andSystem Security (TISSEC), 11(2):1–34, May 2008. http://forensics.umass.edu/pubs/

wright.tissec.2008.pdf.

[293] Sheng Xiao, Weibo Gong, Don Towsley, Qingquan Zhang, and Ting Zhu. Reliability analysisfor cryptographic key management. In IEEE International Conference on Communications,

28

Sen. Doc. No. 20-074

ICC 2014, Sydney, Australia, June 10-14, 2014, pages 999–1004. IEEE, 2014. https://doi.org/10.1109/ICC.2014.6883450.

[294] Sheng Xiao, Weibo Gong, and Donald F. Towsley. Secure wireless communication withdynamic secrets. In INFOCOM 2010. 29th IEEE International Conference on ComputerCommunications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA, pages 1568–1576. IEEE, 2010. ISBN 978-1-4244-5838-7.https://doi.org/10.1109/INFCOM.2010.5461974.

[295] X. Xu, Vikram Suresh, Raghavan Kumar, and Wayne Burleson. Post-silicon validation andcalibration of hardware security primitives. In IEEE Symposium on VLSI (ISVLSI), 2014.

[296] Sookhyun Yang, Jim Kurose, and Brian Neil Levine. Disambiguation of Residential Wired andWireless Access in a Forensic Setting. In Proc. IEEE INFOCOM Mini-Conference, page 5,April 2013. http://forensics.umass.edu/pubs/yang.infocom-mini.2013.pdf.

[297] Yin Yang, Zhenjie Zhang, Gerome Miklau, Marianne Winslett, and Xiaokui Xiao. Differentialprivacy in data publication and analysis. In K. Selcuk Candan, Yi Chen, Richard T. Snodgrass,Luis Gravano, and Ariel Fuxman, editors, Proceedings of the ACM SIGMOD InternationalConference on Management of Data, SIGMOD 2012, Scottsdale, AZ, USA, May 20-24, 2012,pages 601–606. ACM, 2012. ISBN 978-1-4503-1247-9. https://doi.org/10.1145/2213836.2213910.

[298] Cunxi Yu, Duo Liu, Xiangyu Zhang, and Daniel Holcomb. Incremental-SAT basedDe-camouflaging of logic circuits, 2017. Available: https://github.com/ycunxi/

Incremental-SAT-DeCam.

[299] Cunxi Yu, Xiangyu Zhang, Duo Liu, Maciej Ciesielski, and Daniel Holcomb. Incremental SAT-based reverse engineering of camouflaged logic circuits. IEEE Transactions on Computer-AidedDesign of Integrated Circuits and Systems, 2017.

[300] Matthew Yurkewych, Brian Neil Levine, and Arnold L. Rosenberg. On the Cost-Ineffectivenessof Redundancy in Commercial P2P Computing. In Proc. ACM Conference on Computer andCommunications Security (CCS), pages 280–288, November 2005. http://forensics.umass.edu/pubs/yurkewych.ccs.2005.pdf.

[301] Ali Zand, Amir Houmansadr, Giovanni Vigna, Richard A. Kemmerer, and ChristopherKruegel. Know your achilles’ heel: Automatic detection of network critical services. InProceedings of the 31st Annual Computer Security Applications Conference, Los Angeles,CA, USA, December 7-11, 2015, pages 41–50. ACM, 2015. ISBN 978-1-4503-3682-6. https://doi.org/10.1145/2818000.2818012.

[302] Chun Zhang, Brian DeCleene, James F. Kurose, and Donald F. Towsley. Comparison ofinter-area rekeying algorithms for secure wireless group communications. Perform. Eval., 49(1/4):1–20, 2002.

[303] Dan Zhang, Ryan McKenna, Ios Kotsogiannis, Michael Hay, Ashwin Machanavajjhala, andGerome Miklau. EKTELO: A framework for defining differentially-private computations.In Gautam Das, Christopher M. Jermaine, and Philip A. Bernstein, editors, Proceedingsof the 2018 International Conference on Management of Data, SIGMOD Conference 2018,Houston, TX, USA, June 10-15, 2018, pages 115–130. ACM, 2018. https://doi.org/10.

1145/3183713.3196921.

29

Sen. Doc. No. 20-074

[304] R Zhang, H Jiang, ZR Wang, P Lin, Y Zhuo, D Holcomb, DH Zhang, JJ Yang, and Q Xia.Nanoscale diffusive memristor crossbars as physical unclonable functions. Nanoscale, 10(6):2721–2726, 2018.

[305] Xiaolan Zhang, Jim Kurose, Brian Neil Levine, Don Towsley, and Honggang Zhang. Studyof a Bus-Based Disruption Tolerant Network: Mobility Modeling and Impact on Routing.In Proc. ACM Intl. Conf. on Mobile Computing and Networking (Mobicom), pages 195–206,September 2007. http://forensics.umass.edu/pubs/zhang.mobicom.2007.pdf.

[306] Yuankai Zhang, Adam O’Neill, Micah Sherr, and Wenchao Zhou. Privacy-preserving net-work provenance. PVLDB, 10(11):1550–1561, 2017. http://www.vldb.org/pvldb/vol10/

p1550-zhang.pdf.

[307] Wenrui Zhao, Yang Chen, Mostafa Ammar, Mark D. Corner, Brian Neil Levine, and EllenZegura. Capacity Enhancement using Throwboxes in DTNs. In Proceedings of IEEE Inter-national Conf on Mobile Ad hoc and Sensor Systems (MASS), pages 31–40, October 2006.http://forensics.umass.edu/pubs/mcorner/mass06.pdf.

[308] Yun Zhou, Brian Neil Levine, and W. Bruce Croft. Distributed Information RetrievalFor Disruption-Tolerant Mobile Networks. CIIR Technical Report IR-412, University ofMassachusetts Amherst, March 2005.

[309] Ting Zhu, Sheng Xiao, Yi Ping, Don Towsley, and Weibo Gong. A secure energy routingmechanism for sharing renewable energy in smart microgrid. In IEEE Second InternationalConference on Smart Grid Communications, SmartGridComm 2011, Brussels, Belgium,October 17-20, 2011, pages 143–148. IEEE, 2011. ISBN 978-1-4577-1704-8. https://doi.

org/10.1109/SmartGridComm.2011.6102307.

[310] Hadi Zolfaghari and Amir Houmansadr. Practical censorship evasion leveraging contentdelivery networks. In Weippl et al. [287], pages 1715–1726. ISBN 978-1-4503-4139-4. https://doi.org/10.1145/2976749.2978365.

[311] Saman A. Zonouz, Amir Houmansadr, and Parisa Haghani. Elimet: Security metric elicitationin power grid critical infrastructures by observing system administrators’ responsive behavior.In Robert S. Swarz, Philip Koopman, and Michel Cukier, editors, IEEE/IFIP InternationalConference on Dependable Systems and Networks, DSN 2012, Boston, MA, USA, June25-28, 2012, pages 1–12. IEEE Computer Society, 2012. ISBN 978-1-4673-1624-8. https:

//doi.org/10.1109/DSN.2012.6263941.

[312] Cliff C. Zou, Don Towsley, and Weibo Gong. Adaptive defense against various net-work attacks. In Dina Katabi and Balachander Krishnamurthy, editors, Steps to Reduc-ing Unwanted Traffic on the Internet Workshop, SRUTI’05, Cambridge, MA, USA, July7, 2005. USENIX Association, 2005. https://www.usenix.org/conference/sruti-05/

adaptive-defense-against-various-network-attacks.

[313] Cliff Changchun Zou, Nick G. Duffield, Donald F. Towsley, and Weibo Gong. Adaptive defenseagainst various network attacks. IEEE Journal on Selected Areas in Communications, 24(10):1877–1888, 2006. https://doi.org/10.1109/JSAC.2006.877137.

[314] Cliff Changchun Zou, Lixin Gao, Weibo Gong, and Donald F. Towsley. Monitoring andearly warning for internet worms. In Sushil Jajodia, Vijayalakshmi Atluri, and Trent Jaeger,

30

Sen. Doc. No. 20-074

editors, Proceedings of the 10th ACM Conference on Computer and Communications Security,CCS 2003, Washington, DC, USA, October 27-30, 2003, pages 190–199. ACM, 2003. ISBN1-58113-738-9. https://doi.org/10.1145/948109.948136.

[315] Cliff Changchun Zou, Weibo Gong, and Donald F. Towsley. Code red worm propagationmodeling and analysis. In Vijayalakshmi Atluri, editor, Proceedings of the 9th ACM Conferenceon Computer and Communications Security, CCS 2002, Washington, DC, USA, November18-22, 2002, pages 138–147. ACM, 2002. ISBN 1-58113-612-9. https://doi.org/10.1145/

586110.586130.

[316] Cliff Changchun Zou, Weibo Gong, and Donald F. Towsley. Worm propagation modeling andanalysis under dynamic quarantine defense. In Stuart Staniford and Stefan Savage, editors,Proceedings of the 2003 ACM Workshop on Rapid Malcode, WORM 2003, Washington,DC, USA, October 27, 2003, pages 51–60. ACM Press, 2003. ISBN 1-58113-785-0. https:

//doi.org/10.1145/948187.948197.

[317] Cliff Changchun Zou, Weibo Gong, Donald F. Towsley, and Lixin Gao. The monitoringand early detection of internet worms. IEEE/ACM Trans. Netw., 13(5):961–974, 2005.https://doi.org/10.1109/TNET.2005.857113.

[318] Cliff Changchun Zou, Donald F. Towsley, and Weibo Gong. Email worms modeling and defense.In Ronald P. Luijten, Luiz A. DaSilva, and Antonius P. J. Engbersen, editors, Proceedings ofthe International Conference On Computer Communications and Networks (ICCCN 2004),October 11-13, 2004, Chicago, IL, USA, pages 409–414. IEEE, 2004. ISBN 0-7803-8814-3.https://doi.org/10.1109/ICCCN.2004.1401687.

[319] Cliff Changchun Zou, Donald F. Towsley, and Weibo Gong. On the performance of internetworm scanning strategies. Perform. Eval., 63(7):700–723, 2006. https://doi.org/10.1016/j.peva.2005.07.032.

[320] Cliff Changchun Zou, Donald F. Towsley, and Weibo Gong. Modeling and simulation study ofthe propagation and defense of internet e-mail worms. IEEE Trans. Dependable Sec. Comput.,4(2):105–118, 2007. https://doi.org/10.1109/TDSC.2007.1001.

[321] Cliff Changchun Zou, Donald F. Towsley, Weibo Gong, and Songlin Cai. Routing worm: Afast, selective attack worm based on IP address information. In 19th Workshop on Parallel andDistributed Simulation, PADS 20055, Monterey, CA, USA, June 1-3, 2005, pages 199–206.IEEE Computer Society, 2005. ISBN 0-7695-2383-8. https://doi.org/10.1109/PADS.2005.24.

[322] Cliff Changchun Zou, Donald F. Towsley, Weibo Gong, and Songlin Cai. Advanced routingworm and its security challenges. Simulation, 82(1):75–85, 2006. https://doi.org/10.1177/0037549706065344.

31

Sen. Doc. No. 20-074

Cybersecurity Institute (CSI) – Review by Research Council

Recommendation:

The Research Council endorses granting permanent approval to the Cybersecurity Institute (CSI), which

is already operating on the University of Massachusetts Amherst campus. In consultation with the CSI

Director, VCRE, and Provost, we recommend that CSI be approved as a Center affiliated with the

College of Information and Computer Sciences (CICS), reporting to the CICS Dean, and following

established policies regarding the management and oversight of Centers. We recommend that the Faculty

Senate approve the Cybersecurity Institute name.

The members of the Research Council (RC) offer the following notes to explain our endorsement above:

1) Center vs. Institute a) The original proposal specified that CSI should be an Institute. However, RC reviewers noted that

CSI has operated and plans to continue operating effectively as a Center within CICS. Although

both Centers and Institutes may be interdisciplinary and can involve cooperation across colleges,

Centers are accountable to a single college and report to a Dean, while Institutes must report to

the VCRE because they are essentially cross-college and cannot be associated with any one

college. In this case, CSI operates within CICS, is led entirely by CICS faculty, uses an advisory

board identical to the advisory board for CICS, and is not supported by any Dean outside of CICS

or by the VCRE. Given an inquiry on this issue by RC reviewers, the CSI Director agreed that

CSI should operate as a Center.

b) We requested clarification from the VCRE and Provost, and both affirmed that CSI can report to

the Dean of CICS (as a Center) while maintaining the Institute title. The endorsement by the RC

above reflects our own belief that this arrangement is best for CSI and for the UMass research

community.

2) Instructional programs a) The proposal had described development and maintenance of instructional programs, as well as

revenue streams for CSI deriving from tuition on such programs. This is not permitted under the

Comprehensive Policy on Approval and Renewal of Centers and Institutes. The members of the

RC recommend clarifying that CSI may assist degree-granting units – such as CICS or the

College of Engineering (COE) – in offering or augmenting educational programs, but as a

research center CSI will not host or derive revenue directly from such programs. The CSI

Director has agreed that CSI will not host or derive revenue from instructional programs for

UMass credit.

The members of the RC offer the following suggestions to the CSI leadership:

1) Outreach and Strategic Planning

a) We recommend that CSI establish an Internal Advisory Board that includes representatives of

colleges or departments that are important partners in CSI’s endeavors. The CSI leadership can

deliver its Annual Report to this board, and also consult in the Strategic Planning process and

during 5-year reviews.

b) We appreciate that CSI already shares resources (including staff time, event coordination) with

the Center for Data Science (CDS) and recommend that CSI explore further institutional

collaboration (co-sponsored events, such as invited speakers, workshops, mixers, or mini-

conferences) with other related Institutes and Centers, such as the Institute for Applied Life

Sciences, the Computational Social Science Institute, and the Institute for Social Science

Research.

Sen. Doc. No. 20-074