New England Security Day 2019 

March 22, 2019 8:30 A.M. -- 4:30 P.M. 

PROGRAM |POSTERS |REGISTRATION |VENUE | POLICY |ORGANIZERS

***Registration is now closed***

Important Dates:
Submissions due:           March 7, 2019 (extended) 
Notification:                    March 8, 2019
Registration deadline:    March 18, 2019 at 12:00 P.M.

ADVANCED REGISTRATION REQUIRED **CLOSED**
Registration fee: $10.00.  

Title: New England Security Day (NESD)

Location:  University of Massachusetts Amherst, UMass College of Information and Computer Sciences, located at the Computer Science Building, 140 Governors Dr., Amherst, MA 01003, Room 151. Click here to see campus map (the Computer Science Building is in quadrant B2 of the campus map). Parking information is below.

The goal of NESD is to bring together premier practitioners, researchers, students, and funding partners in security, in and around New England. NESD serves as an opportunity to share the latest advances, debate roadmaps and future directions, create new collaborations, and seek new opportunities.

Over 100 people are scheduled to attend, including researchers from: BAE Systems, BBN Technologies, Boston University, Brown University, Cigitas, Cisco, Colgate University, College of the Holy Cross, Cornell University, George Washington University, Guardian Project, Harvard University, IMDEA Software Institute, Keene State College, MIT, MIT Lincoln Laboratory, MITRE, New York University, Northeastern University, Robnett Consultants, RSA Labs, Stony Brook University, Tufts University, UMass Amherst, University of Connecticut, University of Vermont, Veracode, Worcester Polytechnic Institute, and Yale University.

Light breakfast and lunch will be provided. 


PROGRAM

REGISTRATION:  8:00-8:50                    

  • Registration, coffee, and light breakfast snacks


OPENING REMARKS: 8:50-9:00

  • Brian Levine (UMass Amherst)
     
  • Capt. Stephanie Helm (MassCyberCenter, Director)
     

Talks

SESSION 1: 9:00 - 10:15

  • MAPS: Scaling Privacy Compliance Analysis to a Million Apps
    Sebastian Zimmeck (Wesleyan University), Peter Story*, Daniel Smullen*, Abhilasha Ravichander*, Ziqi Wang*, Joel Reidenberg*, N. Cameron Russell*Norman Sadeh* (* CMU, * Fordham University)
     
  • Tracking Anonymized Bluetooth Devices
    Johannes K Becker, David Li and David Starobinski (Boston University)
     
  • Balancing Image Privacy and Usability with Thumbnail-Preserving Encryption
    Kimia Tajik (Oregon State University), Akshith Gunasekaran (Oregon State University), Rhea Dutta (Cornell University), Brandon Ellis (Oregon State University), Rakesh B. Bobba (Oregon State University), Mike Rosulek (Oregon State University), Charles V. Wright (Portland State University), Wu-Chi Feng (Portland State University)

BREAK 1: 10:15 - 10:45 

  • COFFEE
     

SESSION 2: 10:45-12:00 

  • On the Universally Composable Security of OpenStack
    Hoda Maleki (University of Connecticut), Kyle Hogan (MIT), Reza Rahaeimehr (University of Connecticut), Ran Canetti (Boston University), Martin van Dijk (University of Connecticut), Jason Hennessey (Boston University), Mayank Varia (Boston University), and Haibin Zhang (UMBC)
     
  • High-Level Information Fusion of Cyber-Security Expert Knowledge and Experimental Data
    Katarzyna Olejnik, Michael Atighetchi, Stephane Blais, Paulo Costa, Bo Yu, Thomas Eskridge, Adrian Granados, and David Myers (Raytheon BBN Technologies.)
     
  • Exploring and Mitigating Security Vulnerabilities of CAN-Bus
    Dinesh Mutyala and Sajal Bhatia (Sacred Heart University)
     

LUNCH AND POSTER SESSION: 12:00 - 1:30
 

SESSION 3: 1:30 - 2:45

  • Hardness of Decoding Random Linear Codes in the Exponent
    Luke Demerest, Benjamin Fuller and Alexander Russell (University of Connecticut)
     
  • Automatic Detection and Repair of Transition-Based Leakage in Software Binaries
    Konstantinos Athanasiou, Adam Ding, Yunsi Fei and Thomas Wahl (Northeastern University)
     
  • A Random Number Generator Built from Repurposed Hardware in Embedded Systems
    Jacob Grycel and Robert Walls (Worcester Polytechnic Institute)
     

BREAK 2: 1:30 - 2:45 

  • COFFEE and SNACKS

SESSION 4: 3:15 - 4:30

  • Trusted Computing Base for Blockchain Infrastructures
    Thomas Hardjono (Massachusetts Institute of Technology)
     
  • Image Data Publication with Differential Privacy
    Liyue Fan (University at Albany, SUNY)
     
  • Software Fairness
    Yuriy Brun and Alexandra Meliou (University of Massachusetts Amherst)

 

CLOSING REMARKS: 4:30 - 4:35

  • Amir Houmansadr (UMass Amherst)

 

POSTERS

  • Inferring Application Flows in Multiplexed Environments
    Paul Vines and Brian Decleene (BAE Systems)
     
  • Wireless Attacks on Aircraft Landing Systems
    Harshad Sathaye, Aanjhan Ranganathan and Guevara Noubir (Northeastern University)
     
  • Optimal Power Adaptation in Covert Communication with an Uninformed Jammer
    Ke Li, Patrick Kelly and Dennis Goeckel (UMass Amherst)
     
  • Exploiting Asymmetries in the Design of Privacy Mechanisms
    Nazanin Takbiri, Amir Houmansadr, Dennis Goeckel and Hossein Pishro-Nik (UMass Amherst)
     
  • MassBrowser: Unblocking the Web for the Masses, By the Masses
    Milad Nasr, Hadi Zolfaghari and Amir Houmansadr (UMass Amherst)
     
  • Heterogeneous Private Information Retrieval
    Hamid Mozaffari and Amir Houmansadr (UMass Amherst)
     
  • A "SIMPL" Transition
    Srinivasa Varadan Ramanujam and Wayne Burleson (UMass Amherst)
     
  • Secure RL Methods for Adversarial Settings
    Pinar Ozisik, Phil Thomas (UMass Amherst)
     
  • Quantifying the mobile location privacy gained through the use of burner identities
    Keen Sung, Mariyeh Zhaleva*, Brian Levine (UMass Amherst, *University at Albany)
     
  • China's Tor-Resilient Infrastructure
    Arun Dunna and Phillipa Gill (UMass Amherst) 
     
  • Grinding Attacks on Proof-of-Stake Blockchains
    Saad Quader (University of Connecticut)
     
  • DOCSDN: Dynamic and Optimal Configuration of Software-Defined Networks
    Timothy Curry, Devon Callahan, Benjamin Fuller and Laurent Michel (University of Connecticut)
     
  • Non-malleable Digital Lockers for Efficiently Sampleable Distributions
    Peter Fenteany and Benjamin Fuller (University of Connecticut)
     
  • Combining Clock and Voltage Noise Countermeasures Against Power Side-Channel Analysis
    Jacqueline Lagasse and Christopher Bartoli (UMass Amherst)
     
  • Ektelo: A Framework for Defining Differentially-Private Computations
    Dan Zhang, Ryan McKenna, Ios Kotsogiannis, Michael Hay (Colgate), Ashwin Machanavajjhala and Gerome Miklau (UMass Amherst) 
     
  • BGP hijacking classification
    Shinyoung Cho, *Romain Fontugne, Kenjiro Cho, Alberto Dainotti and *Phillipa Gill (*SUNY Stony Brook, *UMass Amherst)
     
  • Understanding, Detecting, and Mitigating DNS DDoS Attacks
    Benjamin Toll, Partha Pal, Nathaniel Soule, Cody Doucette and Regan Broderick-Sander (University of Connecticut) 
     
  • Problem-based Learning for Cybersecurity Education using Open Cyber Range
    Mandar Shivapurkar and Sajal Bhatia (Sacred Heart University) 
     
  • Comprehensive Privacy Analysis of Deep Learning
    Milad Nasr, *Reza Shokri and Amir Houmansadr (UMass Amherst, *National University of Singapore)
     
  • Estimating IoT population using DNS requests
    Arian Niaki, **Bill Marczak, *Nicholas Weaver and Phillipa Gill (UMass Amherst, *ICSI, **Citizen Lab)

 

  • If you are a poster author, note that we will have easels for everyone to use. No need to bring your own. We will also have 2'x3' posterboard and clips for you to use. Please make your poster that size. If you want to make it larger, you'll need to bring your own posterboard.

REGISTRATION AND CALL FOR PRESENTATIONS AND POSTERS

We would also like to invite you to submit presentation proposals. We are interested in all presentations that concern research on computer security. NESD presentations do not need to be about polished or complete results. Proposals for presentations of preliminary work, progress reports on ongoing projects, useful lessons from research that has failed, and tool demos are also welcomed at NESD. For submissions, please use  https://easychair.org/conferences/?conf=nesd19.  Deadline is March 7, 2019 (extended). You will be notified via email by March 8, 2019.

There are 12 slots for presentations in the schedule. If we have more presentation proposals than slots, we will select presentations based on the diversity of the participants' talks, and appeal to a broad audience.

Each slot is 25 minutes long. However, we would like to use an unconventional slot structure. Each speaker will be given 15 minutes to present their material (strict). Then for 5 minutes, members of the audience will form groups of 3-5 people, discuss the talk, filter and form questions. The last 5 minutes of each slot will involve Q&A between the speaker and the audience. This structure encourages members of the audience to interact with each other and exchange opinions, and clarify their understanding of the talk. It is especially beneficial for students as it will allow them to interact with senior researchers. Moreover, the quality of questions filtered up to the speaker is improved.

We invite you to submit a poster proposal as well. Like the talks, posters should concern security and can report on ongoing work. Posters will be displayed all day around the workshop space; there is no particular poster session. We have limited space for posters, and we'll follow the same selection process that we have for presentations. For submissions, please use https://easychair.org/conferences/?conf=nesd19.   Deadline is March 7, 2019 (extended). You need to submit only a couple paragraphs and not the presentation itselt; similarly, we do not need the poster until the day of the event.

VENUE (AND TRAVEL INFORMATION)

NESD will be held in Room 151 on the ground floor, at the UMass College of Information and Computer Sciences, located at Computer Science Building, 140 Governors Dr., Amherst, MA 01003.

PARKING: Park is available at the Campus Center Parking Garage. Use "1 Campus Center Way" for your GPS. (Campus Center Way is accessed from Commonwealth Avenue.)   

IMPORTANT: When you enter the parking garage, you will be issued a gate ticket. TAKE YOUR TICKET WITH YOU (do not leave it in your car). When you check in for NESD, you will be given a parking coupon.  At the end of your visit, when you return to the parking garage, but before you return to your car, stop at a garage paystation.  There you will enter your gate ticket for validation, and scan your parking coupon. Attendees will be charged a parking fee of $6.50 with discounted parking coupon. Your validated gate ticket will allow you to drive out of the garage.

Accommodations

A block of rooms, at a discounted rate, have been reserved at Hotel UMass for Thursday, March 21st ($129*). Please contact the hotel directly at 877-822-2110 on or before February 21, 2019 to secure your reservation (Group Code: CSM19C).  

*There are applicable fees, currently 6%, plus $1.00 per room, per night.

ANTI-HARASSMENT POLICY

The open exchange of ideas and the freedom of thought and expression are central to the aims and goals of NESD; these require an environment that recognizes the inherent worth of every person and group, that fosters dignity, understanding, and mutual respect, and that embraces diversity. For these reasons, NESD is dedicated to providing a harassment-free experience, and implements the ACM policy against harassment.Participants violating these standards may be sanctioned or expelled from NESD, at the discretion of the organizing committee members.

A useful related resource is the Geek Feminism Wiki, which includes models for public announcements and guidance for conference staff. If you hear an inappropriate remark, intended or misjudged, we encourage you not to stay silent. You may find this list of comebacks to be useful.

ORGANIZERS

Amir Houmansadr, UMass Amherst
Brian Levine, UMass Amherst
Cristina Nita-Rotaru, Northeastern University

 

NESD 2019 is supported in part by National Science Foundation award DGE-1565521.