Skip to content

alexwang1116/Best-Paper-Awards-in-Computer-Science-since-1996

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

54 Commits
README.md
README.md
 
 

Repository files navigation

Best-Paper-Awards-in-Computer-Science-since-1996

  1. This is the website (https://jeffhuang.com/best_paper_awards.html) of best paper awards in some top computer science conferences since 1996.

  2. This is the website (https://www.usenix.org/conferences/best-papers) of USENIX conferences best paper.

  3. This is the website (https://www.acm.org/conferences/best-paper-awards) of the ACM Conferences Best Paper Awards.

Contents By Conference: MobiCom, SIGCOMM, INFOCOM, NSDI, CCS, ACL

MobiCom (the Annual International Conference on Mobile Computing and Networking)

The Annual International Conference on Mobile Computing and Networking (MobiCom) has been held every year since 1995. The conference serves as the premier international forum addressing networks, systems, algorithms, and applications that support the symbiosis of mobile computers and wireless networks. The conference covers all areas of mobile computing and mobile and wireless networking.

MobiCom conferences have been held in locations around the world:

Mobicom 2022 (/(%))

Best Paper Award

Mobicom 2021 (/(%))

Best Paper Award

mSAIL: Milligram-Scale Multi-Modal Sensor Platform for Monarch Butterfly Migration Tracking [Slides] [Video] [Code]
Inhee Lee (University of Pittsburgh); Roger Hsiao, Gordy Carichner, Chin-Wei Hsu, Mingyu Yang, Sara Shoouri, Katherine Ernst, and Tess Carichner (University of Michigan); Yuyang Li (University of Pittsburgh); Jaechan Lim (University of Michigan); Cole R. Julick (University of Nebraska-Lincoln); Eunseong Moon and Yi Sun (University of Michigan); Jamie Phillips (University of Delaware); Kristi L. Montooth (University of Nebraska-Lincoln); Delbert A. Green II, Hun-Seok Kim, and David Blaauw (University of Michigan)

Abstract:

Each fall, millions of monarch butterflies across the northern US and Canada migrate up to 4,000 km to overwinter in the exact same cluster of mountain peaks in central Mexico. To track monarchs precisely and study their navigation, a monarch tracker must obtain daily localization of the butterfly as it progresses on its 3-month journey. And, the tracker must perform this task while having a weight in the tens of milligram (mg) and measuring a few millimeters (mm) in size to avoid interfering with monarch's flight. This paper proposes mSAIL, 8 × 8 × 2.6 mm and 62 mg embedded system for monarch migration tracking, constructed using 8 prior custom-designed ICs providing solar energy harvesting, an ultra-low power processor, light/temperature sensors, power management, and a wireless transceiver, all integrated and 3D stacked on a micro PCB with an 8 × 8 mm printed antenna. The proposed system is designed to record and compress light and temperature data during the migration path while harvesting solar energy for energy autonomy, and wirelessly transmit the data at the overwintering site in Mexico, from which the daily location of the butterfly can be estimated using a deep learning-based localization algorithm. A 2-day trial experiment of mSAIL attached on a live butterfly in an outdoor botanical garden demonstrates the feasibility of individual butterfly localization and tracking.

Best Community Paper Award

Experience: developing a usable battery drain testing and diagnostic tool for the mobile industry [Slides] [Video]
Abhilash Jindal (IIT Delhi and Mobile Enerlytics); Y. Charlie Hu (Purdue University and Mobile Enerlytics)

Abstract:

In this paper, we report on our 6-year experience developing Eagle Tester (eTester for short) - a mobile battery drain testing and diagnostic tool. We show how eTester evolved from an "academic" prototype to a fully automated tool usable by the mobile industry. We first present the design of our initial research prototype and discuss 8 key requirements for a usable battery drain testing and diagnostic tool gathered from some of the most popular software vendors in the Android ecosystem. These requirements posed interesting scientific and engineering challenges such as how to accurately estimate battery drain without requiring a priori power modeling, work on unmodified devices, and automatically monitor code evolution to generate high-fidelity battery spike alerts with actionable insights. These requirements motivated a complete overhaul of the eTester design and led to the creation of a novel battery drain testing methodology. We show how the redesigned eTester was used to effortlessly find battery bugs in some of the most popular Android apps with hundreds of millions of users, such as Netflix and CNN. We are open-sourcing eTester to encourage further research in battery diagnosis and to empower developers to write battery-efficient mobile software.

Mobicom 2020 (62/384(16%))

Best Paper Award

Hummingbird: Energy Efficient GPS Receiver for Small Satellites [Slides] [Video]
Sujay Narayana, R Venkatesha Prasad, Vijay S Rao (TU Delft); Luca Mottola (Politecnico di Milano, Italy and RI.SE SICS Sweden); T Venkata Prabhakar (IISc, India)

Abstract:

Global Positioning System is a widely adopted localization technique. With the increasing demand for small satellites, the need for a low-power GPS for satellites is also increasing. To enable many state-of-the-art applications, the exact position of the satellites is necessary. However, building low-power GPS receivers which operate in low earth orbit pose significant challenges. This is mainly due to the high speed (~7.8km/s) of small satellites. While duty-cycling the receiver is a possible solution, the high relative Doppler shift between the GPS satellites and the small satellite contributes to the increase in Time To First Fix (TTFF), thus increasing the energy consumption. Further, if the GPS receiver is tumbling along with the small satellite on which it is mounted, longer TTFF may lead to no GPS fix due to disorientation of the receiver antenna. In this paper, we elucidate the design of a low-cost, low-power GPS receiver for small satellite applications. We also propose an energy optimization algorithm called F3 to improve the TTFF which is the main contributor to the energy consumption during cold start. With simulations and in-orbit evaluation from a launched nanosatellite with our μGPS and high-end GPS simulators, we show that up to 96.16% of energy savings (consuming only ~ 1/25th energy compared to the state of the art) can be achieved using our algorithm without compromising much (~10m) on the navigation accuracy. The TTFF achieved is at most 33s.

M-Cube: A Millimeter-Wave Massive MIMO Software Radiov [Slides] [Video] [Web]
Renjie Zhao, Timothy Woodford, Teng Wei, Kun Qian, Xinyu Zhang (University of California San Diego)

Abstract:

Millimeter-wave (mmWave) technologies represent a cornerstone for emerging wireless network infrastructure, and for RF sensing systems in security, health, and automotive domains. Through a MIMO array of phased arrays with hundreds of antenna elements, mmWave can boost wireless bit-rate to 100+~Gbps, and potentially achieve near-vision sensing resolution. However, lack of an experimental platform has been impeding research in this field. This paper fills the gap with M^3M (M-Cube), the first mmWave massive MIMO software radio. M^3M features a fully reconfigurable array of phased arrays, with up to 8 RF chains and 288 antenna elements. Despite the orders of magnitude larger antenna arrays, its cost is orders of magnitude lower, even when compared with state-of-the-art single RF chain mmWave software radios. The key design principle behind M^3M is to hijack a low-cost commodity 802.11ad radio, separate the control path and data path inside, regenerate the phased array control signals, and recreate the data signals using a programmable baseband. Extensive experiments have demonstrated the effectiveness of the M^3M design, and its usefulness for research in mmWave massive MIMO communication and sensing.

Honourable Mention Award

Sniffing Visible Light Communication Through Walls [Slides] [Video]
Minhao Cui, Yuda Feng (University of Massachusetts Amherst); Qing Wang (Delft University of Technology); Jie Xiong (University of Massachusetts Amherst)

Abstract:

Visible light communication (VLC) is gaining a significant amount of interest as a new paradigm to meet rapidly increasing demands on wireless capacity required by a digitalized world. VLC is considered as a secure wireless communication scheme because VLC signals can be easily constrained within physical boundaries. In this paper, for the first time, we show that VLC is not as secure as people thought: VLC can be sniffed through walls! The key principle behind this is that in VLC transmissions, a VLC transmitter not only emits visible light signals but also leaks out 'side channel RF signals'. The leaked RF signals can be sniffed by a receiver to decode the VLC transmissions even the receiver is blocked (e.g., by walls) from the VLC transmitter. In this work, we establish a theoretical model to quantify the amplitude of the leaked RF signal and verify the model with comprehensive experiments. We design and implement a VLC sniffing system including receiver coil design, signal processing and frame decoding, spanning across hardware and software. Field studies show that with a cheap receiver design, our system can simultaneously sniff transmissions from multiple VLC transmitters 6.4 meters away with a 14 cm concrete wall in between, where the distance exceeds the communication range of most state-of-the-art VLC systems. By simply twining a wired earphone on the arm, we can sniff the VLC transmission 1.9 meters away.

Mobicom 2019 (55/290(18.9%))

Best Paper Award

eBP: A Wearable System For Frequent and Comfortable Blood Pressure Monitoring From User’s Ear [Slides] [Video] [Web]
Nam Bui, Nhat Pham, Jessica Jacqueline Barnitz, Phuc Nguyen, Hoang Truong, Taeho Kim, Anh Nguyen, Zhanan Zou, Nicholas Farrow, Jianliang Xiao (University of Colorado Boulder); Robin Deterding (Children's Hospital Colorado); Thang Dinh (Virginia Commonwealth University); Tam Vu (University of Colorado Boulder)

FLUID: Flexible User Interface Distribution for Ubiquitous Multi-device Interaction [Slides] [Video] [Web]
Sangeun Oh, Ahyeon Kim, Sunjae Lee, Kilho Lee, Dae R. Jeong (KAIST); Steven Y. Ko (University at Buffalo, The State University of New York); Insik Shin (KAIST)

Best Community Paper Award

HealthSense: Software-defined Mobile-based Clinical Trials [Slides] [Video] [Web]
Aidan Curtis, Amruta Pai, Jian Cao (Rice University); Nidal Moukaddam (Baylor College of Medicine); Ashutosh Sabharwal (Rice University)

Best Paper Honorable Mention

Towards Low Cost Soil Sensing Using Wi-Fi [Slides] [Video] [Web]
Jian Ding (Rice University); Ranveer Chandra (Microsoft)

Mobicom 2018 (42/187(22.2%))

Best Paper Award

SkyCore: Moving Core to the Edge for Untethered and Reliable UAV-based LTE networks [Slides] [Video]
Mehrdad Moradi (University of Michigan); Karthik Sundaresan (NEC Labs); Eugene Chai (NEC Labs); Sampath Rangarajan (NEC Labs); Z. Morley Mao (University of Michigan)

Best Community Paper Award

One Billion Apples' Secret Sauce: Recipe for the Apple Wireless Direct Link Ad hoc Protocol [Slides] [Video]
Milan Stute (Technische Universität Darmstadt); David Kreitschmann (Technische Universität Darmstadt); Matthias Hollick (Technische Universität Darmstadt)

Mobicom 2017 (35/186(19%))

Best Paper Award

WEBee: Physical-Layer Cross-Technology Communication via Emulation [Slides] [Video] [Web]
Zhijun Li (University of Minnesota & Harbin Institute of Technology), Tian He (University of Minnesota)

Best Community Paper Award

The Tick Programmable Low-Latency SDR System [Slides] [Video] [Web]
Haoyang Wu (Peking University), Tao Wang (Peking University), Zengwen Yuan, Chunyi Peng (Purdue University), Zhiwei Li (Peking University), Zhaowei Tan (University of California, Los Angeles), Boyan Ding (Peking University), Xiaoguang Li (Peking University), Yuanjie Li (University of California, Los Angeles), Jun Liu (Peking University), Songwu Lu (University of California, Los Angeles)

Mobicom 2016 (32/226(14.2%))

Best Paper Award

Best Community Paper Award

MobileInsight: Extracting and Analyzing Cellular Network Information on Smartphones [Slides] [Video] [Web]
Yuanjie Li (University of California, Los Angeles), Chunyi Peng (The Ohio State University), Zengwen Yuan (University of California, Los Angeles), Jiayao Li (University of California, Los Angeles), Haotian Deng (The Ohio State University), Tao Wang (Peking University)

Best Video Award

The DarkLight Rises: Visible Light Communication in the Dark [Slides] [Video] [Web]
Zhao Tian (Dartmouth College), Kevin Wright (Dartmouth College) Xia Zhou (Dartmouth College)

Mobicom 2015 (38/207(18%))

Best Paper Award

CAreDroid: Adaptation Framework for Android Context Aware Applications [Slides] [Video]
Salma Elmalaki (University of California, Los Angeles), Lucas Wanner (University of California, Los Angeles), Mani Srivastava (University of California, Los Angeles)

Best Community Paper Award

CAreDroid: Adaptation Framework for Android Context Aware Applications [Slides] [Video]
Salma Elmalaki (University of California, Los Angeles), Lucas Wanner (University of California, Los Angeles), Mani Srivastava (University of California, Los Angeles)

Best Video Award

Human Sensing Using Visible Light Communication [Slides] [Video] [Web]
Tianxing Li (Dartmouth College), Chuankai An (Dartmouth College), Zhao Tian (Dartmouth College), Andrew T. Campbell (Dartmouth College), Xia Zhou (Dartmouth College)

Mobicom 2014 (36/220(16%))

Best Paper Award

Tagoram: Real-Time Tracking of Mobile RFID Tags to High Precision Using COTS Devices [Slides] [Video]
Lei Yang (Tsinghua University), Yekui Chen (Tsinghua University); Xiang-Yang Li (Tsinghua University, Illinois Institute of Technology); Chaowei Xiao (Tsinghua University); Mo Li (Nanyang Technological Univ.); Yunhao Liu (Tsinghua University)

Mobicom 2013 (28/207(14%))

Best Paper Award

Whole-Home Gesture Recognition Using Wireless Signals [Slides] [Video] [Web]
Qifan Pu, Sidhant Gupta, Shyam Gollakota, and Shwetak Patel.

Mobicom 2012 (32/212(15%))

Best Paper Award

Distinguishing Users with Capacitative Touch Communication [Slides] [Video]
Tam Vu (Rutgers University, USA), Akash Baid (Rutgers University, USA), Simon Gao (Rutgers University, USA), Marco Gruteser (Rutgers University, USA), Richard Howard (Rutgers University, USA), Janne Lindqvist (Rutgers University, USA), Predag Spasojevic (Rutgers University, USA) and Jeffrey Walling (Rutgers University, USA)

Mobicom 2011 (29/214(14%))

Best Paper Award

Mobicom 2010 (33/233(14%))

Best Paper Award

The κ factor: inferring protocol performance using inter-link reception correlation [Slides]
Kannan Srinivasan (Stanford University), Mayank Jain (Stanford University), Jung Il Choi (Stanford University), Tahir Azim (Stanford University), Edward S. Kim (University of Southern California), Philip Levis (Stanford University), and Bhaskar Krishnamachari (University of Southern California)

Mobicom 2009 (30/282(11%))

Best Paper Award

CENTAUR: Realizing the Full Potential of Centralized WLANs through a Hybrid Data Path
Vivek Shrivastava(University of Wisconsin), Nabeel Ahmed (University of Waterloo), Shravan Rayanchu (University of Wisconsin), Suman Banerjee (University of Wisconsin), Srinivasan Keshav (University of Waterloo), Konstantina Papagiannaki (Intel Labs), and Arunesh Mishra (Google Inc.)

Mobicom 2008 (31/264(12%))

Best Paper Award

Assessment of Urban-Scale Wireless Networks with a Small Number of Measurements [Slides]
Joshua Robinson (Rice University), Ram Swaminathan (HP Labs), and Edward W. Knightly (Rice University)

Mobicom 2007 (26/233(11%))

Best Student Paper Award

Crossing Over the Bounded Domain: From Exponential to Power-law Inter-meeting Time in MANET [Slides]
Han Cai and Do Young Eun (North Carolina State University)

Mobicom 2006 (35/298(12%))

Best Student Paper Award

A Measurement Study of Vehicular Internet Access Using In Situ Wi-Fi Networks
Vladimir Bychkovsky, Bret Hull, Allen K. Miu, Hari Balakrishnan, Samuel Madden (Massachusetts Institute of Technology, USA)

Mobicom 2005 (23/224(10%))

Best Student Paper Award

Architecture and Evaluation of an Unplanned 802.11b Mesh Network
John Bicket, Daniel Aguayo, Sanjit Biswas, and Robert Morris (Massachusetts Institute of Technology, USA)

Mobicom 2004 (26/326(8%))

Best Student Paper Award

MobiDesk: Mobile Virtual Desktop Computing [Slides]
Ricardo A. Baratto, Shaya Potter, Gong Su, Jason Nieh (Columbia University, USA)

Mobicom 2003 (27/281(10%))

Best Student Paper Award

A Receiver-Centric Transport Protocol for Mobile Hosts with Heterogeneous Wireless Interfaces
Hung-Yun Hsieh, Kyu-Han Kim, Yujie Zhu, and Raghupathy Sivakumar (Georgia Tech, USA)

Mobicom 2002 (26/364(7%))

Best Student Paper Award

Zero-Interaction Authentication [Slides] [Video]
Mark Corner and Brian Noble (University of Michigan, USA)

Mobicom 2001 (30/281(11%))

Best Student Paper Award

Exposure In Wireless Ad Hoc Sensor Networks [Slides]
Seapahn Meguerdichian (University of California, Los Angeles), Farinaz Koushanfar (University of California, Berkeley), Gang Qu (University of Maryland), Miodrag Potkonjak (University of California, Los Angeles)

Mobicom 2000 (28/226(12%))

Best Student Paper Award

A Unified Header Compression Framework for Low-Bandwidth Links
Jeremy Lilley, Jason Yang, Hari Balakrishnan (MIT, USA) and Srinivasan Seshan (IBM T.J. Watson Research Center, USA)

Mobicom 1999 (28/170(16%))

Best Student Paper Award

LeZi-Update: An Information-Theoretic Approach to Track Mobile Users in PCS Networks
Amiya Bhattacharya and Sajal K. Das (University of North Texas, USA)

Mobicom 1998 (27/147(18%))

Best Student Paper Award

Location-Aided Routing (LAR) in Mobile Ad-Hoc Networks
Young-Bae Ko and Nitin H. Vaidya (Texas A&M University, USA)

Mobicom 1997 (26/101(26%))

Best Student Paper Award

Composable Ad-Hoc Mobile Services for Universal Interaction
Todd D. Hodes, Randy H. Katz, Edouard Servan-Scheriber and Lawrence Rowe (University of California, Berkeley, USA)

Mobicom 1996 (18/90(20%))

Best Student Paper Award

Low-loss TCP/IP Header Compression for Wireless Networks
Mikael Degermark, Mathias Engan, Bjorn Nordgren and Stephen Pink (Lulea University and the Swedish Insitute of Computer Science, Sweden)

Mobicom 1995 (20/79(25%))

Best Student Paper Award

Improving TCP/IP Performance over Wireless Networks [Slides] [Video]
Hari Balakrishnan, Srinivasan Seshan, Elan Amir and Randy H. Katz (University of California, Berkeley, USA)

SIGCOMM (the Annual Conference of the Special Interest Group on Data Communication)

SIGCOMM is the flagship annual conference of the Special Interest Group on Data Communication (SIGCOMM), a vital special interest group of the Association for Computing Machinery (ACM).

Previous SIGCOMM Conferences:

Recent SIGCOMM Best Paper Award Winners

http://www.sigcomm.org/awards/best-paper-award

SIGCOMM 2022

Best Paper Award

Software-Defined Network Assimilation: Bridging the Last Mile Towards Centralized Network Configuration Management with NAssim [Slides] [Video] [Dataset]
Huangxun Chen (Huawei Theory Lab), Yukai Miao (University of New South Wales), Li Chen (Zhongguancun Laboratory), Haifeng Sun (Beijing University of Posts and Telecommunications), Hong Xu (The Chinese University of Hong Kong), Libin Liu (Shandong Computer Science Center), Gong Zhang (Huawei Theory Lab), Wei Wang (HKUST(Guangzhou))

Abstract:

On-boarding new devices into an existing SDN network is a pain for network operations (NetOps) teams, because much expert effort is required to bridge the gap between the configuration models of the new devices and the unified data model in the SDN controller. In this work, we present an assistant framework NAssim, to help NetOps accelerate the process of assimilating a new device into a SDN network. Our solution features a unified parser framework to parse diverse device user manuals into preliminary configuration models, a rigorous validator that confirm the correctness of the models via formal syntax analysis, model hierarchy validation and empirical data validation, and a deep-learning-based mapping algorithm that uses state-of-the-art neural language processing techniques to produce human-comprehensible recommended mapping between the validated configuration model and the one in the SDN controller. In all, NAssim liberates the NetOps from most tedious tasks by learning directly from devices' manuals to produce data models which are comprehensible by both the SDN controller and human experts. Our evaluation shows, NAssim can accelerate the assimilation process by 9.1x. In this process, we also identify and correct 243 errors in four mainstream vendors' device manuals, and release a validated and expert-curated dataset of parsed manual corpus for future research.

SIGCOMM 2021

Best Paper Award

Seven Years in the Life of Hypergiants’ Off-Nets [Slides] [Web] [Video] [Code] [Dataset]
Petros Gigis (UCL), Matt Calder (Microsoft; Columbia University), Lefteris Manassakis (FORTH-ICS), George Nomikos (FORTH-ICS; Lancaster University), Vasileios Kotronis (FORTH-ICS), Xenofontas Dimitropoulos (FORTH-ICS; University of Crete), Ethan Katz-Bassett (Columbia University), Georgios Smaragdakis (TU Delft)

Abstract:

Content Hypergiants deliver the vast majority of Internet traffic to end users. In recent years, some have invested heavily in deploying services and servers inside end-user networks. With several dozen Hypergiants and thousands of servers deployed inside networks, these off-net (meaning outside the Hypergiant networks) deployments change the structure of the Internet. Previous efforts to study them have relied on proprietary data or specialized per-Hypergiant measurement techniques that neither scale nor generalize, providing a limited view of content delivery on today’s Internet.

In this paper, we develop a generic and easy to implement methodology to measure the expansion of Hypergiants’ off-nets. Our key observation is that Hypergiants increasingly encrypt their traffic to protect their customers’ privacy. Thus, we can analyze publicly available Internet-wide scans of port 443 and retrieve TLS certificates to discover which IP addresses host Hypergiant certificates in order to infer the networks hosting off-nets for the corresponding Hypergiants. Our results show that the number of networks hosting Hypergiant off-nets has tripled from 2013 to 2021, reaching 4.5k networks. The largest Hypergiants dominate these deployments, with almost all of these networks hosting an off-net for at least one — and increasingly two or more — of Google, Netflix, Facebook, or Akamai. These four Hypergiants have off-nets within networks that provide access to a significant fraction of end user population.

SIGCOMM 2020

Best Paper Award

Routing on Multiple Optimality Criteria [Slides] [Video]
João Luís Sobrinho, Miguel Alves Ferreira (Instituto de Telecomunicações Instituto Superior Técnico, Universidade de Lisboa)

Swift: Delay is Simple and Effective for Congestion Control in the Datacenter [Slides] [Video]
Gautam Kumar, Nandita Dukkipati, Keon Jang (MPI-SWS), Hassan M. G. Wassel, Xian Wu, Behnam Montazeri, Yaogong Wang, Kevin Springborn, Christopher Alfeld, Michael Ryan, David Wetherall, Amin Vahdat (Google)

SIGCOMM 2019

Best Paper Award

Underwater Backscatter Networking [Web] [Slides] [Video] [Presentation Video]
Junsu Jang (MIT Media Lab) and Fadel Adib (MIT Media Lab)

SIGCOMM 2018

Best Paper Award

Inferring Persistent Interdomain Congestion [Web] [Slides] [Video]
Amogh Dhamdhere (CAIDA, USA), David D. Clark (MIT, USA), Alexander Gamero-Garrido (CAIDA, USA), Matthew Luckie (Waikato, New Zealand), Ricky K. P. Mok, Gautam Akiwate, Kabir Gogia (CAIDA, USA), Vaibhav Bajpai (TU Munich, Germany), Alex C. Snoeren (UCSD, USA), kc claffy (CAIDA, USA)

SIGCOMM 2017

Best Paper Award

Re-architecting datacenter networks and stacks for low latency and high performance [Slides] [Video]
Mark Handley (University College London), Costin Raiciu, Alexandru Agache, and Andrei Voinescu (University Politehnica of Bucharest), and Andrew Moore, Gianni Antichi, and Marcin Wójcik (University of Cambridge)

Language-directed hardware design for network performance monitoring [Web] [Slides] [Video]
Srinivas Narayana, Anirudh Sivaraman, Vikram Nathan, and Prateesh Goyal (MIT CSAIL), Venkat Arun (IIT Guwahati), Mohammad Alizadeh (MIT CSAIL), Vimalkumar Jeyakumar (Cisco Tetration Analytics), and Changhoon Kim (Barefoot Networks)

SIGCOMM 2016

Best Paper Award

Inter-Technology Backscatter: Towards Internet Connectivity for Implanted Devices [Slides] [Video]
Vikram Iyer, Vamsi Talla, Bryce Kellogg, Shyam Gollakota and Josh Smith (University of Washington)

Don't Mind the Gap: Bridging Network-wide Objectives and Device-level Configurations [Web] [Slides] [Video]
Ryan Beckett (Princeton University), Ratul Mahajan (Microsoft), Todd Millstein (University of California, Los Angeles), Jitendra Padhye (Microsoft), David Walker (Princeton University)

Eliminating Channel Feedback in Next-Generation Cellular Networks [Slides] [Video]
Deepak Vasisht (MIT), Swarun Kumar (CMU), Hariharan Rahul (MIT), Dina Katabi (MIT)

SIGCOMM 2015

Best Paper Award

Central Control Over Distributed Routing [Web] [Slides] [Video]
Stefano Vissicchio (UCLouvain), Olivier Tilmans (UCLouvain), Laurent Vanbever (ETH Zürich), Jennifer Rexford (Princeton University)

Best Student Paper Award

Rollback Recovery for Middleboxes [Slides] [Video]
Justine Sherry (UC Berkeley), Peter Gao (UC Berkeley), Soumya Basu (UC Berkeley), Aurojit Panda (UC Berkeley), Arvind Krishnamurthy (University of Washington), Christian Macciocco (Intel Research), Maziar Manesh (Intel Research), Joao Martins (NEC Labs), Sylvia Ratnasamy (UC Berkeley), Luigi Rizzo (University of Pisa), Scott Shenker (UC Berkeley and ICSI).

SIGCOMM 2014

Best Paper Award

Balancing Accountability and Privacy in the Network [Slides] [Video]
David Naylor (Carnegie Mellon University); Matthew K. Mukerjee (Carnegie Mellon University); Peter Steenkiste (Carnegie Mellon University)

CONGA: Distributed Congestion-Aware Load Balancing for Datacenters [Slides] [Video]
Mohammad Alizadeh (Cisco); Tom Edsall (Cisco); Sarang Dharmapurikar (Cisco); Ramanan Vaidyanathan (Cisco); Kevin Chu (Cisco); Andy Fingerhut (Google); Terry Lam (Cisco); Francis Matus (Cisco); Rong Pan (Cisco); Navindra Yadav (Cisco); George Varghese (Microsoft)

SIGCOMM 2013

Best Paper Award

Ambient Backscatter: Wireless Communication out of Thin Air [Slides] [Video]
Vincent Liu, Aaron Parks, Vamsi Talla, Shyam Gollakota, David Wetherall, and Josh Smith

### SIGCOMM 2012

Best Paper Award

Multi-Resource Fair Queueing for Packet Processing [Slides] [Video]
Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica

SIGCOMM 2011

Best Paper Award

They Can Hear Your Heartbeats: Non-Invasive Security for Implanted Medical Devices [Slides] [Video]
Shyam Gollakota, Haitham Hassanieh, Ben Ransford, Dina Katabi (MIT), and Kevin Fu

SIGCOMM 2010

Best Paper Award

Efficient Error Estimating Coding: Feasibility and Applications [Slides] [Video]
Binbin Chen, Zling Zhou, Yuda Zho, and Haifeng Yu

SIGCOMM 2009

Best Paper Award

White Space Networking with Wi-Fi like Connectivity [Slides] [Video]
Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda, Rohan Murthy, and Matt Welsh

SIGCOMM 2008

Best Paper Award

ZigZag Decoding: Combating Hidden Terminals in Wireless Networks [Slides] [Video]
Shyam Gollakota and Dina Katabi

INFOCOM (IEEE International Conference on Computer Communications)

IEEE INFOCOM is a top ranked conference on networking in the research community. It is a major conference venue for researchers to present and exchange significant and innovative contributions and ideas in the field of networking and closely related areas. IEEE INFOCOM covers both theoretical and systems research.

Past Conferences:

INFOCOM 2020

Best Paper Award

Push the Limit of Acoustic Gesture Recognition [Slides] [Video]
Yanwen Wang, Jiaxing Shen, and Yuanqing Zheng, The Hong Kong Polytechnic University, Hongkong, China

On the Power of Randomization for Scheduling Real-Time Traffic in Wireless Networks [Slides] [Video]
Christos Tsanikidis and Javad Ghaderi, Columbia University, USA

Reducing the Service Function Chain Backup Cost over the Edge and Cloud by a Self-Adapting Scheme [Slides] [Video]
Xiaojun Shang, Yaodong Huang, Zhenhua Liu, Yuanyuan Yang, Stony Brook University, USA

INFOCOM 2019

Best Paper Award

RF-Mehndi: A Fingertip Profiled RF Identifier [Slides] [Video]
Cui Zhao (Xi'an Jiaotong University, P.R. China); Zhenjiang Li (City University of Hong Kong, Hong Kong); Han Ding (Xi'an Jiaotong University, P.R. China); Jinsong Han (Zhejiang University & Institute of Cyber Security Research, P.R. China); Wei Xi (Xi'an Jiaotong University, P.R. China); Ting Liu (Xi'an Jiaotong University, PRC, P.R. China); Ruowei Gui (Xi'an Jiaotong University, P.R. China)

Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels [Slides] [Video]
Guocong Quan, Jian Tan and Atilla Eryilmaz (The Ohio State University, USA)

Combinatorial Sleeping Bandits with Fairness Constraints [Slides] [Video]
Fengjiao Li (Temple University, USA); Jia Liu (Iowa State University, USA); Bo Ji (Temple University, USA)

INFOCOM 2018

Best Paper Award

Understanding Ethereum via Graph Analysis [Slides] [Video]
Ting Chen (University of Electronic Science and Technology of China (UESTC), P.R. China); Yuxiao Zhu (School of Management, Guangdong University of Technology, P.R. China); Zihao Li (University of Electronic Science and Technology of China (UESTC), P.R. China); Jiachi Chen (The Hong Kong Polytechnic University, Hong Kong); Xiaoqi Li (The Hong Kong Polytechnic University, Hong Kong); Xiapu Luo (The Hong Kong Polytechnic University, Hong Kong); Xiaodong Lin (Wilfrid Laurier University, Canada); Xiaosong Zhang (University of Electronic Science and Technology of China, P.R. China)

WiFED: WiFi Friendly Energy Delivery with Distributed Beamforming [Slides] [Video]
Subhramoy Mohanti (Northeastern University, USA); Elif Bozkaya (Istanbul Technical University & National Defense University Naval Academy, Turkey); M. Yousof Naderi (Northeastern University, USA); Berk Canberk (Istanbul Technical University, Turkey); Kaushik Chowdhury (Northeastern University, USA)

Optimizing Age of Information in Wireless Networks with Throughput Constraints [Slides] [Video]
Igor Kadota (Massachusetts Institute of Technology, USA); Abhishek Sinha (Massachusetts Institute of Technology, USA); Eytan Modiano (MIT, USA)

INFOCOM 2017

Best Paper Award

One Step at a Time: Optimizing SDN Upgrades in ISP Networks [Slides] [Video]
Konstantinos Poularakis (Yale University, USA); George Iosifidis (Trinity College Dublin and CONNECT, Ireland & Yale University, USA); Georgios Smaragdakis (MIT and TU Berlin); Leandros Tassiulas (Yale University, USA)

Best Paper Runners up Awards

A Parity Check Analog Decoder for Molecular Communication Based on Biological Circuits [Slides] [Video]
Alessio Marcone (Politecnico di Milano, Italy); Massimiliano Pierobon (University of Nebraska­ Lincoln, USA); Maurizio Magarini (Politecnico di Milano, Italy)

DyMo: Dynamic Monitoring of Large Scale LTE-Multicast Systems [Slides] [Video]
Yigal Bejerano (Bell­Labs, Alcatel­Lucent, USA); Chandru Raman (Mobile Networks, Nokia, USA); Chun­Nam Yu (Bell Labs, Nokia, USA); Varun Gupta and Craig Gutterman (Columbia University, USA); Tomas Young and Hugo Infante (Mobile Networks, Nokia, USA); Yousef Abdelmalek (Verizon Wireless, USA); Gil Zussman (Columbia University, USA)

INFOCOM 2016

Best Paper Award

Heavy-Ball: A New Approach to Tame Delay and Convergence in Wireless Network Optimization [Slides] [Video]
Jia Liu and Atilla Eryilmaz (Ohio State University, USA); Ness B. Shroff (The Ohio State University, USA); Elizabeth Serena Bentley (AFRL, USA)

Best Paper Award Runner-up

FLIP the (Flow) Table: Fast LIghtweight Policy-preserving SDN Updates [Slides] [Video]
Stefano Vissicchio (Universit Catholique de Louvain, Belgium); Luca Cittadini (Roma Tre University, Italy)

INFOCOM 2015

Best Paper Award

The Power of Slightly More than One Sample in Randomized Load Balancing [Slides] [Video]
Lei Ying (Arizona State University, USA); lhttps://sites.google.com/a/illinois.edu/srikant/ (University of Illinois at Urbana-Champaign, USA); Xiaohan Kang (Arizona State University, USA)

Best Paper Award Runner-up

On the Efficiency of Social Recommender Networks [Slides] [Video]
Felix Ming Fai Wong, Zhenming Liu, Mung Chiang (Princeton University, USA)

INFOCOM 2014

Best Paper Award

Joint Static and Dynamic Traffic Scheduling in Data Center Networks [Slides] [Video]
Zizhong Cao (Polytechnic Institute of New York University, USA), M. Kodialam (Bell Labs, Alcatel-Lucent, USA), T. V. Lakshman (Bell Labs, Alcatel-Lucent, USA)

Performance Evaluation and Asymptotics for Content Delivery Networks [Slides] [Video]
Virag Shah (The University of Texas at Austin, USA), Gustavo de Veciana (The University of Texas at Austin, USA)

Best Paper Award Runner-up

A Social Group Utility Maximization Framework with Applications in Database Assisted Spectrum Access [Slides] [Video]
Xu Chen (Arizona State University, USA), Xiaowen Gong (Arizona State University, USA), Lei Yang (Arizona State University, USA), Junshan Zhang (Arizona State University, USA)

INFOCOM 2013

Best Paper Award

On the Steady-State of Cache Networks [Slides] [Video]
Elisha Rosensweig (CloudBand, Alcatel-Lucent, Israel), Daniel Menasche (Federal University of Rio de Janeiro, Brazil), Jim Kurose (University of Massachusetts at Amherst, USA)

Best Paper Award Runner-up

Distributed Cross-Layer Optimization in Wireless Networks: A Second-Order Approach [Slides] [Video]
Jia Liu (Ohio State University, USA), Cathy Xia (Ohio-State University, USA), Ness B. Shroff (The Ohio State University, USA), Hanif Sherali (Virginia Tech, USA)

On Finding an Optimal TCAM Encoding Scheme for Packet Classification [Slides] [Video]
Ori Rottenstreich (Technion, Israel), Isaac Keslassy (Technion, Israel), Avinatan Hassidim (Google, Israel), Haim Kaplan (Tel-Aviv University, Israel), Ely Porat (Bar Ilan University, Israel)

INFOCOM 2012

Best Paper Award

Multi-Resource Allocation: Fairness-Efficiency Tradeoffs in a Unifying Framework [Slides] [Video]
Carlee Joe-Wong (Princeton University, USA), Soumya Sen (Princeton University, USA), Tian Lan (George Washington University, USA), Mung Chiang (Princeton University, USA)

Best Paper Award Runner-up

Upward Max Min Fairness [Slides] [Video]
Emilie Danna (Google, USA), Avinatan Hassidim (Google, Israel), Haim Kaplan (Tel-Aviv University, Israel), Alok Kumar (Google, USA), Yishay Mansour (Tel-Aviv University, Israel), Danny Raz (Technion, Israel), Michal Segalov (Google, Israel)

INFOCOM 2011

Best Paper Award

Dynamic right-sizing for power-proportional data centers [Slides] [Video]
Minghong Lin (California Institute of Technology), Adam Wierman (California Institute of Technology), Lachlan L. H. Andrew (Swinburne University of Technology), Eno Thereska (Microsoft Research)

NSDI (USENIX Symposium on Networked Systems Design and Implementation)

NSDI focuses on the design principles, implementation, and practical evaluation of networked and distributed systems. Our goal is to bring together researchers from across the networking and systems community to foster a broad approach to addressing overlapping research challenges.

PAST NSDI SYMPOSIA:
  • 2022 19th NSDI, April 4, 2022–April 6, 2022 | Renton, WA, United States
  • 2021 18th NSDI, April 12, 2021–April 14, 2021 | Boston, MA, United States
  • 2020 17th NSDI, February 25, 2020–February 27, 2020 | Santa Clara, CA, United States
  • 2019 16th NSDI, February 26, 2019–February 28, 2019 | Boston, MA, United States
  • 2018 15th NSDI, April 9, 2018–April 11, 2018 | Renton, WA, United States
  • 2017 14th NSDI, March 27, 2017–March 29, 2017 | Boston, MA, United States
  • 2016 13th NSDI, March 16, 2016–March 18, 2016 | Santa Clara, CA, United States
  • 2015 12th NSDI, May 4, 2015–May 6, 2015 | Oakland, CA, United States
  • 2014 11th NSDI, April 2, 2014–April 4, 2014 | Seattle, WA, United States
  • 2013 10th NSDI, April 2, 2013–April 5, 2013 | Lombard, IL, United States
  • 2012 9th NSDI, April 25, 2012–April 27, 2012 | San Jose, CA, United States
  • 2011 8th NSDI, March 30, 2011–April 1, 2011 | Boston, MA, United States
  • 2010 7th NSDI, April 28, 2010–April 30, 2010 | San Jose, CA, United States
  • 2009 6th NSDI, April 22, 2009–April 24, 2009 | Boston, MA , United States
  • 2008 5th NSDI, April 16, 2008–April 18, 2008 | San Francisco, CA, United States
  • 2007 4th NSDI, April 11, 2007–April 13, 2007 | Cambridge, MA, United States
  • 2006 3rd NSDI, May 8, 2006–May 10, 2006 | San Jose, CA, United States
  • 2005 2nd NSDI, May 2, 2005–May 4, 2005 | Boston, MA, United States
  • 2004 1st NSDI, March 29, 2004–March 31, 2004 | San Francisco, CA, United States

Recent NSDI Best Paper Award:

https://www.usenix.org/conferences/best-papers?taxonomy_vocabulary_1_tid=&title_1=NSDI

NSDI '22

Best Paper Award:

Graham: Synchronizing Clocks by Leveraging Local Clock Properties [Slides] [Video]
Ali Najafi, Meta; Michael Wei, VMware Research

Abstract:

High performance, strongly consistent applications are beginning to require scalable sub-microsecond clock synchronization. State-of-the-art clock synchronization focuses on improving accuracy or frequency of synchronization, ignoring the properties of the local clock: lost of connectivity to the remote clock means synchronization failure.

Our system, Graham, leverages the fact that the local clock still keeps time even when connectivity is lost and builds a failure model using the characteristics of the local clock and the desired synchronization accuracy. Graham characterizes the local clock using commodity sensors present in nearly every server and leverages this data to further improve clock accuracy, increasing the tolerance of Graham to failures. Graham reduces the clock drift of a commodity server by up to 2000×, reducing the maximum assumed drift in most situations from 200ppm to 100ppb.

Community Award:

Learning to Communicate Effectively Between Battery-free Devices [Web] [Slides] [Video] [Code]
Kai Geissdoerfer, TU Dresden; Marco Zimmerling, TU Dresden

Abstract:

Successful wireless communication requires that sender and receiver are operational at the same time. This requirement is difficult to satisfy in battery-free networks, where the energy harvested from ambient sources varies across time and space and is often too weak to continuously power the devices. We present Bonito, the first connection protocol for battery-free systems that enables reliable and efficient bi-directional communication between intermittently powered nodes. We collect and analyze real-world energy-harvesting traces from five diverse scenarios involving solar panels and piezoelectric harvesters, and find that the nodes' charging times approximately follow well-known distributions. Bonito learns a model of these distributions online and adapts the nodes' wake-up times so that sender and receiver are operational at the same time, enabling successful communication. Experiments with battery-free prototype nodes built from off-the-shelf hardware components demonstrate that our design improves the average throughput by 10-80× compared with the state of the art.

Packet Order Matters! Improving Application Performance by Deliberately Delaying Packets [Slides] [Video]
Hamid Ghasemirahni, KTH Royal Institute of Technology; Tom Barbette, KTH Royal Institute of Technology; Georgios P. Katsikas, KTH Royal Institute of Technology; Alireza Farshin, KTH Royal Institute of Technology; Amir Roozbeh, KTH Royal Institute of Technology and Ericsson Research; Massimo Girondi, KTH Royal Institute of Technology; Marco Chiesa, KTH Royal Institute of Technology; Gerald Q. Maguire Jr., KTH Royal Institute of Technology; Dejan Kostić, KTH Royal Institute of Technology

Abstract:

Data centers increasingly deploy commodity servers with high-speed network interfaces to enable low-latency communication. However, achieving low latency at high data rates crucially depends on how the incoming traffic interacts with the system's caches. When packets that need to be processed in the same way are consecutive, i.e., exhibit high temporal and spatial locality, caches deliver great benefits.

In this paper, we systematically study the impact of temporal and spatial traffic locality on the performance of commodity servers equipped with high-speed network interfaces. Our results show that (i) the performance of a variety of widely deployed applications degrade substantially with even the slightest lack of traffic locality, and (ii) a traffic trace from our organization reveals poor traffic locality as networking protocols, drivers, and the underlying switching/routing fabric spread packets out in time (reducing locality). To address these issues, we built Reframer, a software solution that deliberately delays packets and reorders them to increase traffic locality. Despite introducing μs-scale delays of some packets, we show that Reframer increases the throughput of a network service chain by up to 84% and reduces the flow completion time of a web server by 11% while improving its throughput by 20%.

NSDI '21

Best Paper Award:

ATP: In-network Aggregation for Multi-tenant Learning [Slides] [Video]
ChonLam Lao, Tsinghua University; Yanfang Le, University of Wisconsin-Madison; Kshiteej Mahajan, University of Wisconsin-Madison; Yixi Chen, Tsinghua University; Wenfei Wu, Tsinghua University; Aditya Akella, University of Wisconsin–Madison; Michael Swift, University of Wisconsin-Madison

Abstract:

Distributed deep neural network training (DT) systems are widely deployed in clusters where the network is shared across multiple tenants, i.e., multiple DT jobs. Each DT job computes and aggregates gradients. Recent advances in hardware accelerators have shifted the the performance bottleneck of training from computation to communication. To speed up DT jobs' communication, we propose ATP, a service for in-network aggregation aimed at modern multi-rack, multi-job DT settings. ATP uses emerging programmable switch hardware to support in-network aggregation at multiple rack switches in a cluster to speedup DT jobs. ATP performs decentralized, dynamic, best-effort aggregation, enables efficient and equitable sharing of limited switch resources across simultaneously running DT jobs, and gracefully accommodates heavy contention for switch resources. ATP outperforms existing systems accelerating training throughput by up to 38% - 66% in a cluster shared by multiple DT jobs.

Community Award:

Segcache: a memory-efficient and scalable in-memory key-value cache for small objects [Slides] [Video]
Juncheng Yang, Carnegie Mellon University; Yao Yue, Twitter; Rashmi Vinayak, Carnegie Mellon University

Abstract:

Modern web applications heavily rely on in-memory key-value caches to deliver low-latency, high-throughput services. In-memory caches store small objects of size in the range of 10s to 1000s of bytes, and use TTLs widely for data freshness and implicit delete. Current solutions have relatively large per-object metadata and cannot remove expired objects promptly without incurring a high overhead. We present Segcache, which uses a segment-structured design that stores data in fixed-size segments with three key features: (1) it groups objects with similar creation and expiration time into the segments for efficient expiration and eviction, (2) it approximates some and lifts most per-object metadata into the shared segment header and shared information slot in the hash table for object metadata reduction, and (3) it performs segment-level bulk expiration and eviction with tiny critical sections for high scalability. Evaluation using production traces shows that Segcache uses 22-60% less memory than state-of-the-art designs for a variety of workloads. Segcache simultaneously delivers high throughput, up to 40% better than Memcached on a single thread. It exhibits close-to-linear scalability, providing a close to 8× speedup over Memcached with 24 threads.

NSDI '20

AmphiLight: Direct Air-Water Communication with Laser Light [Slides] [Video]
Charles J. Carver, Department of Computer Science, Dartmouth College; Zhao Tian, Department of Computer Science, Dartmouth College; Hongyong Zhang, Thayer School of Engineering, Dartmouth College; Kofi M. Odame, Thayer School of Engineering, Dartmouth College; Alberto Quattrini Li, Department of Computer Science, Dartmouth College; Xia Zhou, Department of Computer Science, Dartmouth College

Learning in situ: a randomized experiment in video streaming [Slides] [Video]
Francis Y. Yan, Stanford University; Hudson Ayers, Stanford University; Chenzhi Zhu, Tsinghua University; Sadjad Fouladi, Stanford University; James Hong, Stanford University; Keyi Zhang, Stanford University; Philip Levis, Stanford University; Keith Winstein, Stanford University

Understanding, Detecting and Localizing Partial Failures in Large System Software [Slides] [Video]
Chang Lou, Johns Hopkins University; Peng Huang, Johns Hopkins University; Scott Smith, Johns Hopkins University

NSDI '19

Datacenter RPCs can be General and Fast [Slides] [Video]
Anuj Kalia, Carnegie Mellon University; Michael Kaminsky, Intel Labs; David Andersen, Carnegie Mellon University

Scaling Community Cellular Networks with CommunityCellularManager [Slides] [Video]
Shaddi Hasan, UC Berkeley; Mary Claire Barela, University of the Philippines, Diliman; Matthew Johnson, University of Washington; Eric Brewer, UC Berkeley; Kurtis Heimerl, University of Washington

Understanding Lifecycle Management Complexity of Datacenter Topologies [Slides] [Video]
Mingyang Zhang, University of Southern California; Radhika Niranjan Mysore, VMware Research; Sucha Supittayapornpong, University of Southern California; Ramesh Govindan, University of Southern California

NSDI '18

NetChain: Scale-Free Sub-RTT Coordination [Slides] [Video]
Xin Jin, Johns Hopkins University; Xiaozhou Li, Barefoot Networks; Haoyu Zhang, Princeton University; Nate Foster, Cornell; Jeongkeun Lee, Barefoot Networks; Robert Soulé, Università della Svizzera italiana; Changhoon Kim, Barefoot Networks; Ion Stoica, UC Berkeley

Stateless Datacenter Load-balancing with Beamer [Slides] [Video]
Vladimir Olteanu, University Politehnica of Bucharest; Alexandru Agache, University Politehnica of Bucharest; Andrei Voinescu, University Politehnica of Bucharest; Costin Raiciu, University Politehnica of Bucharest

NSDI '17

mOS: A Reusable Networking Stack for Flow Monitoring Middleboxes [Slides] [Video]
Muhammad Asim Jamshed, Korea Advanced Institute of Science and Technology (KAIST); YoungGyoun Moon, Korea Advanced Institute of Science and Technology (KAIST); Donghwi Kim, Korea Advanced Institute of Science and Technology (KAIST); Dongsu Han, Korea Advanced Institute of Science and Technology (KAIST); KyoungSoo Park, Korea Advanced Institute of Science and Technology (KAIST)

The Design, Implementation, and Deployment of a System to Transparently Compress Hundreds of Petabytes of Image Files for a File-Storage Service [Slides] [Video]
Daniel Reiter Horn, Dropbox Inc.; Ken Elkabany, Dropbox Inc.; Chris Lesniewski-Lass, Dropbox; Keith Winstein, Stanford University

NSDI '16

An Industrial-Scale Software Defined Internet Exchange Point [Slides] [Video]
Arpit Gupta, Princeton University; Robert MacDavid, Princeton University; Rudiger Birkner, ETH Zürich; Marco Canini, Université catholique de Louvain; Nick Feamster, Princeton University ; Jennifer Rexford, Princeton University; Laurent Vanbever, ETH Zürich

Passive Wi-Fi: Bringing Low Power to Wi-Fi Transmissions [Slides] [Video]
Bryce Kellogg, University of Washington; Vamsi Talla, University of Washington; Shyamnath Gollakota, University of Washington; Joshua R. Smith, University of Washington

PhyCloak: Obfuscating Sensing from Communication Signals [Slides] [Video]
Yue Qiao, The Ohio State University; Ouyang Zhang, The Ohio State University; Wenjie Zhou, The Ohio State University; Kannan Srinivasan, The Ohio State University; Anish Arora, The Ohio State University

NSDI '15

The Design and Implementation of Open vSwitch [Slides] [Video]
Ben Pfaff, VMware, Inc.; Justin Pettit, VMware, Inc.; Teemu Koponen, VMware, Inc.; Ethan Jackson, VMware, Inc.; Andy Zhou, VMware, Inc.; Jarno Rajahalme, VMware, Inc.; Jesse Gross, VMware, Inc.; Alex Wang, VMware, Inc.; Joe Stringer, VMware, Inc.; Pravin Shelar, VMware, Inc.; Keith Amidon, VMware, Inc.; Martín Casado, VMware, Inc.

Designing Distributed Systems Using Approximate Synchrony in Data Center Networks [Slides] [Video]
Dan R. K. Ports, University of Washington; Jialin Li, University of Washington; Vincent Liu, University of Washington; Naveen Kr. Sharma, University of Washington; Arvind Krishnamurthy, University of Washington

Queues Don’t Matter When You Can JUMP Them! [Slides] [Video]
Matthew P. Grosvenor, University of Cambridge; Malte Schwarzkopf, University of Cambridge; Ionel Gog, University of Cambridge; Robert N. M. Watson, University of Cambridge; Andrew W. Moore, University of Cambridge; Steven Hand, University of Cambridge; Jon Crowcroft, University of Cambridge

CCS (ACM Conference on Computer and Communications Security)

The ACM Conference on Computer and Communications Security (CCS) is the flagship annual conference of the Special Interest Group on Security, Audit and Control (SIGSAC) of the Association for Computing Machinery (ACM).

Previous CCS Conferences:
  • 29th CCS 2022 in Los Angeles, CA, USA. November 7-11, 2022.
  • 28th CCS 2021 in Virtual Event. November 15-19, 2021. General Chair: Yongdae Kim and Jong Kim, Program Chairs: Giovanni Vigna and Elaine Shi
  • 27th CCS 2020 in Virtual Event. November 09-13, 2020. General Chair: Jay Ligatti and Xinming Ou, Program Chairs: Jonathan Katz and Giovanni Vigna
  • 26th CCS 2019 in London, UK. November 11-15, 2019. General Chair: Lorenzo Cavallaro and Johannes Kinder, Program Chairs: XiaoFeng Wang and Jonathan Katz
  • 25th CCS 2018 in Toronto, Canada. October 15-19, 2018. General Chair: David Lie and Mohammad Mannan, Program Chairs: Michael Backes and XiaoFeng Wang
  • 24th CCS 2017 in Dallas, TX, USA. October 30-November 3, 2017. General Chair: Bhavani Thuraisingham, Program Chairs: David Evans, Tal Malkin and Dongyan Xu
  • 23rd CCS 2016 in Vienna, Austria. October 24-28, 2016. General Chairs: Edgar Weippl and Stefan Katzenbeisser, Program Chairs: Christopher Kruegel, Andrew Myers and Shai Halevi
  • 22nd CCS 2015 in Denver, CO, USA. October 12-16, 2015. General Chair: Indrajit Ray, Program Chairs: Ninghui Li and Christopher Kruegel
  • 21st CCS 2014 in Scottsdale, AZ, USA. November 3-7, 2014. General Chair: Gail-Joon Ahn, Program Chairs: Moti Yung and Ninghui Li
  • 20th CCS 2013 in Berlin, Germany. November 4-8, 2013. General Chair: Ahmad-Reza Sadeghi, Program Chairs: Virgil Gligor and Moti Yung
  • 19th CCS 2012 in Raleigh, NC, USA. October 16-18, 2012. General Chair: Ting Yu, Program Chairs: George Danezis and Virgil Gligor
  • 18th CCS 2011 in Chicago, IL, USA. October 17-21, 2011. General Chair: Yan Chen, Program Chairs: George Danezis and Vitaly Shmatikov
  • 17th CCS 2010 in Chicago, IL, USA. October 04-08, 2010. General Chair: Ehab Al-Shaer, Program Chairs: Angelos D. Keromytis and Vitaly Shmatikov
  • 16th CCS 2009 in Chicago, IL, USA. November 9-13, 2009. General Chair: Ehab Al-Shaer, Program Chairs: Angelos D. Keromytis and Somesh Jha
  • 15th CCS 2008 in Alexandria, VA, USA. October 27-31, 2008. General Chair: Peng Ning, Program Chairs: Paul Syverson and Somesh Jha
  • 14th CCS 2007 in Alexandria, VA, USA. October 29-November 2,, 2007. General Chair: Peng Ning, Program Chairs (Research Track): Sabrina De Capitani di Vimercati and Paul Syverson , Program Chair (Industry Track): Peter Dinsmore
  • 13th CCS 2006 in Alexandria, VA, USA. October 30-November 3, 2006. General Chair: Ari Juels, Program Chairs (Research Track): Rebecca Wright and Sabrina De Capitani di Vimercati , Program Chair (Industry Track): Patrick McDaniel
  • 12th CCS 2005 in Alexandria, VA, USA. November 7-11, 2005. General Chair: Vijay Atluri, Program Chair (Research Track): Catherine Meadows, Program Chair (Industry Track): Ari Juels
  • 11th CCS 2004 in Washington, DC, USA. October 25-29, 2004. General Chair: Vijay Atluri, Program Chair (Research Track): Birgit Pfitzmann, Program Chair (Industry Track): Patrick McDaniel
  • 10th CCS 2003 in Washington, DC, USA. October 27-30, 2003.
  • 9th CCS 2002 in Washington, DC, USA. November 17-21, 2002.
  • 8th CCS 2001 in in Philadelphia, PA, USA. November 5-8, 2001.
  • 7th CCS 2000 in Athens, Greece. November 1-4, 2000.
  • 6th CCS 1999 in Singapore. November 1-4, 1999.
  • 5th CCS 1998 in San Francisco, CA, USA. November 2-5, 1998.
  • 4th CCS 1997 in Zurich, Switzerland. April 2-4, 1997.
  • 3rd CCS 1996 in New Delhi, India. March 14-16, 1996.
  • 2nd CCS 1994 in Fairfax, VA, USA. November 2-4, 1994.
  • 1st CCS 1993 in Fairfax, VA, USA. November 3-5, 1993.

Recent CCS Best Paper Award Winners:

https://sigsac.org/ccs/CCS_awards/ccs-bestpaper.html

CCS 2022

Best Paper Award

CCS 2021

Best Paper Award

XSinator.com: From a Formal Model to the Automatic Evaluation of Cross-Site Leaks in Web Browsers [Web] [Slides] [Video] [Code]
Lukas Knittel (Ruhr University Bochum); Christian Mainka (Ruhr University Bochum); Marcus Niemietz (Niederrhein University of Applied Sciences); Dominik Trevor Noß (Ruhr University Bochum); Jörg Schwenk (Ruhr University Bochum)

Abstract:

Cross-Site Leaks (XS-Leaks) describe a client-side bug that allows an attacker to collect side-channel information from a cross-origin HTTP resource. They are a significant threat to Internet privacy since simply visiting a web page may reveal if the victim is a drug addict or leak a sexual orientation. Numerous different attack vectors, as well as mitigation strategies, have been proposed, but a clear and systematic understanding of XS-Leak' root causes is still missing. Recently, Sudhodanan et al. gave a first overview of XS-Leak at NDSS 2020. We build on their work by presenting the first formal model for XS-Leaks. Our comprehensive analysis of known XS-Leaks reveals that all of them fit into this new model. With the help of this formal approach, we (1) systematically searched for new XS-Leak attack classes, (2) implemented XSinator.com, a tool to automatically evaluate if a given web browser is vulnerable to XS-Leaks, and (3) systematically evaluated mitigations for XS-Leaks. We found 14 new attack classes, evaluated the resilience of 56 different browser/OS combinations against a total of 34 XS-Leaks, and propose a completely novel methodology to mitigate XS-Leaks.

One Glitch to Rule Them All: Fault Injection Attacks Against AMD’s Secure Encrypted Virtualization [Slides] [Video] [Code]
Robert Buhren (Technische Universität Berlin - SECT); Hans-Niklas Jacob (Technische Universität Berlin - SECT); Thilo Krachenfels (Technische Universität Berlin - SECT); Jean-Pierre Seifert (Technische Universität Berlin - SECT & Fraunhofer SIT)

Abstract:

AMD Secure Encrypted Virtualization (SEV) offers protection mechanisms for virtual machines in untrusted environments through memory and register encryption. To separate security-sensitive operations from software executing on the main x86 cores, SEV leverages the AMD Secure Processor (AMD-SP). This paper introduces a new approach to attack SEV-protected virtual machines (VMs) by targeting the AMD-SP. We present a voltage glitching attack that allows an attacker to execute custom payloads on the AMD-SPs of all microarchitectures that support SEV currently on the market (Zen 1, Zen 2, and Zen 3). The presented methods allow us to deploy a custom SEV firmware on the AMD-SP, which enables an adversary to decrypt a VM's memory. Furthermore, using our approach, we can extract endorsement keys of SEV-enabled CPUs, which allows us to fake attestation reports or to pose as a valid target for VM migration without requiring physical access to the target host. Moreover, we reverse-engineered the Versioned Chip Endorsement Key (VCEK) mechanism introduced with SEV Secure Nested Paging (SEV-SNP). The VCEK binds the endorsement keys to the firmware version of TCB components relevant for SEV. Building on the ability to extract the endorsement keys, we show how to derive valid VCEKs for arbitrary firmware versions. With our findings, we prove that SEV cannot adequately protect confidential data in cloud environments from insider attackers, such as rogue administrators, on currently available CPUs.

On the Renyi Differential Privacy of the Shuffle Model [Slides] [Video]
Antonious M. Girgis (University of California, Los Angeles); Deepesh Data (University of California, Los Angeles); Suhas Diggavi (University of California Los Angeles, USA); Ananda Theertha Suresh (Google Research); Peter Kairouz (Google Research)

Abstract:

The central question studied in this paper is Rényi Differential Privacy (RDP) guarantees for general discrete local randomizers in the shuffle privacy model. In the shuffle model, each of the n clients randomizes its response using a local differentially private (LDP) mechanism and the untrusted server only receives a random permutation (shuffle) of the client responses without association to each client. The principal result in this paper is the first direct RDP bounds for general discrete local randomization in the shuffle privacy model, and we develop new analysis techniques for deriving our results which could be of independent interest. In applications, such an RDP guarantee is most useful when we use it for composing several private interactions. We numerically demonstrate that, for important regimes, with composition our bound yields an improvement in privacy guarantee by a factor of $8\times$ over the state-of-the-art approximate Differential Privacy (DP) guarantee (with standard composition) for shuffle models. Moreover, combining with Poisson subsampling, our result leads to at least $10\times$ improvement over subsampled approximate DP with standard composition.

On the (In)Security of ElGamal in OpenPGP [Slides] [Video]
Luca De Feo (IBM Research Europe - Zurich); Bertram Poettering (IBM Research Europe - Zurich); Alessandro Sorniotti (IBM Research Europe - Zurich)

Abstract:

Roughly four decades ago, Taher ElGamal put forward what is today one of the most widely known and best understood public key encryption schemes. ElGamal encryption has been used in many different contexts, chiefly among them by the OpenPGP standard. Despite its simplicity, or perhaps because of it, in reality there is a large degree of ambiguity on several key aspects of the cipher. Each library in the OpenPGP ecosystem seems to have implemented a slightly different "flavour" of ElGamal encryption. While --taken in isolation-- each implementation may be secure, we reveal that in the interoperable world of OpenPGP, unforeseen cross-configuration attacks become possible. Concretely, we propose different such attacks and show their practical efficacy by recovering plaintexts and even secret keys.

V-Shuttle: Scalable and Semantics-Aware Hypervisor Virtual Device Fuzzing [Slides] [Video] [Code]
Gaoning Pan (Zhejiang University & Ant Group); Xingwei Lin (Ant Group); Xuhong Zhang (Zhejiang University & Binjiang Institute of Zhejiang University); Yongkang Jia (Zhejiang University); Shouling Ji (Zhejiang University & Binjiang Institute of Zhejiang University); Chunming Wu (Zhejiang University); Xinlei Ying (Ant Group); Jiashui Wang (Ant Group); Yanjun Wu (Institute of Software, Chinese Academy of Sciences)

Abstract:

With the wide application and deployment of cloud computing in enterprises, virtualization developers and security researchers are paying more attention to cloud computing security. The core component of cloud computing products is the hypervisor, which is also known as the virtual machine monitor (VMM) that can isolate multiple virtual machines in one host machine. However, compromising the hypervisor can lead to virtual machine escape and the elevation of privilege, allowing attackers to gain the permission of code execution in the host. Therefore, the security analysis and vulnerability detection of the hypervisor are critical for cloud computing enterprises. Importantly, virtual devices expose many interfaces to a guest user for communication, making virtual devices the most vulnerable part of a hypervisor. However, applying fuzzing to the virtual devices of a hypervisor is challenging because the data structures transferred by DMA are constructed in a nested form according to protocol specifications. Failure to understand the protocol of the virtual devices will make the fuzzing process stuck in the initial fuzzing stage, resulting in inefficient fuzzing.

In this paper, we propose a new framework called V-Shuttle to conduct hypervisor fuzzing, which performs scalable and semantics-aware hypervisor fuzzing. To address the above challenges, we first design a DMA redirection mechanism to significantly reduce the manual efforts to reconstruct virtual devices' protocol structures and make the fuzzing environment setup automated and scalable. Furthermore, we put forward a new fuzzing mutation scheduling mechanism called seedpool to make the virtual device fuzzing process semantics-aware and speed up the fuzzing process to achieve high coverage. Extensive evaluation on QEMU and VirtualBox, two of the most popular hypervisor platforms among the world, shows that V-Shuttle can efficiently reproduce existing vulnerabilities and find new vulnerabilities. We further carried out a long-term fuzzing campaign in QEMU/KVM and VirtualBox with V-Shuttle. In total, we discovered 35 new bugs with 17 CVEs assigned.

ACL (Annual Meeting of the Association for Computational Linguistics)

The Association for Computational Linguistics (ACL) is the premier international scientific and professional society for people working on computational problems involving human language, a field often referred to as either computational linguistics or natural language processing (NLP). The association was founded in 1962, originally named the Association for Machine Translation and Computational Linguistics (AMTCL), and became the ACL in 1968. Activities of the ACL include the holding of an annual meeting each summer and the sponsoring of the journal Computational Linguistics, published by MIT Press; this conference and journal are the leading publications of the field. For more information, see: https://www.aclweb.org/.

ACL 2018 (56th Annual Meeting of the Association for Computational Linguistics) Best Papers

Best Long Papers

Best Short Papers

About

This is the best paper awards in computer science conference.

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

2 forks
Report repository

Releases

No releases published

Packages

No packages published