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

Joseph I. Choi

dblp:202/2912 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0003-4048-8306ORCID · corroborated

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

Security and privacy · 8 · 3 first-author · 1 since 2021

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

Network and information security
3 papers
Web and mobile security · 38% Systems and software security · 28% Network security · 17%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer networks
1 paper
Internet architecture and protocols · 50% Wireless networking · 50%

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

TopicWeightPapersLastEvidence papers
Systems and software security
operating system security
0.412019
LBM: A Security Framework for Peripherals within the Linux Kernel · IEEE Symposium on Security and Privacy 2019
Operating systems › system security › operating system security
kernel security
0.412019
LBM: A Security Framework for Peripherals within the Linux Kernel · IEEE Symposium on Security and Privacy 2019
Web and mobile security › mobile security
android security
0.312018
ATtention Spanned: Comprehensive Vulnerability Analysis of AT Commands Within the Android Ecosystem · USENIX Security Symposium 2018
Web and mobile security
mobile security
0.312018
ATtention Spanned: Comprehensive Vulnerability Analysis of AT Commands Within the Android Ecosystem · USENIX Security Symposium 2018
Hardware security and side channels
trusted execution environments
0.312017
Securing ARP/NDP From the Ground Up · IEEE Trans. Inf. Forensics Secur. 2017
Systems and software security › operating system security
device driver security
0.112019
LBM: A Security Framework for Peripherals within the Linux Kernel · IEEE Symposium on Security and Privacy 2019
Internet architecture and protocols
IPv6
0.112017
Securing ARP/NDP From the Ground Up · IEEE Trans. Inf. Forensics Secur. 2017
Wireless networking › wireless network protocols
neighbor discovery protocol
0.112017
Securing ARP/NDP From the Ground Up · IEEE Trans. Inf. Forensics Secur. 2017

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

eBPF packet filtering · 0.8trusted platform module attestation · 0.6formal logic · 0.6
YearPublicationVenuePosition
2021 Brittle Features of Device Authentication
Washington Garcia, Animesh Chhotaray, Joseph I. Choi, Suman Kalyan Adari, Kevin R. B. Butler, Somesh Jha
CODASPY3
2019 A Hybrid Approach to Secure Function Evaluation using SGX
abstract
A protocol for two-party secure function evaluation (2P-SFE) aims to allow the parties to learn the output of function f of their private inputs, while leaking nothing more. In a sense, such a protocol realizes a trusted oracle that computes f and returns the result to both parties. There have been tremendous strides in efficiency over the past ten years, yet 2P-SFE protocols remain impractical for most real-time, online computations, particularly on modestly provisioned devices. Intel's Software Guard Extensions (SGX) provides hardware-protected execution environments, called enclaves, that may be viewed as trusted computation oracles. While SGX provides native CPU speed for secure computation, previous side-channel and micro-architecture attacks have demonstrated how security guarantees of enclaves can be compromised. In this paper, we explore a balanced approach to 2P-SFE on SGX-enabled processors by constructing a protocol for evaluating f relative to a partitioning of f. This approach alleviates the burden of trust on the enclave by allowing the protocol designer to choose which components should be evaluated within the enclave, and which via standard cryptographic techniques. We describe SGX-enabled SFE protocols (modeling the enclave as an oracle), and formalize the strongest-possible notion of 2P-SFE for our setting. We prove our protocol meets this notion when properly realized. We implement the protocol and apply it to two practical problems: privacy-preserving queries to a database, and a version of Dijkstra's algorithm for privacy-preserving navigation. Our evaluation shows that our SGX-enabled SFE scheme enjoys a 38x increase in performance over garbled-circuit-based SFE. Finally, we justify modeling of the enclave as an oracle by implementing protections against known side-channels.
Joseph I. Choi, Jing (Dave) Tian, Grant Hernandez, Christopher Patton, Benjamin Mood, Thomas Shrimpton, Kevin R. B. Butler, Patrick Traynor
AsiaCCS1
2019 A Practical Intel SGX Setting for Linux Containers in the Cloud
abstract
With close to native performance, Linux containers are becoming the de facto platform for cloud computing. While various solutions have been proposed to secure applications and containers in the cloud environment by leveraging Intel SGX, most cloud operators do not yet offer SGX as a service. This is likely due to a number of security, scalability, and usability concerns coming from both cloud providers and users. Cloud operators worry about the security guarantees of unofficial SDKs, limited support for remote attestation within containers, limited physical memory for the Enclave Page Cache (EPC) making it difficult to support hundreds of enclaves, and potential DoS attacks against EPC by malicious users. Meanwhile, end users need to worry about careful program partitioning to reduce the TCB and adapting legacy applications to use SGX. We note that most of these concerns are the result of an incomplete infrastructure, from the OS to the application layer. We address these concerns with lxcsgx, which allows SGX applications to run inside containers while also: enabling SGX remote attestation for containerized applications, enforcing EPC memory usage control on a per-container basis, providing a general software TPM using SGX to augment legacy applications, and supporting partitioning with a GCC plugin. We then retrofit Nginx/OpenSSL and Memcached using the software TPM and SGX partitioning to defend against known and potential attacks. Thanks to the small EPC footprint of each enclave, we are able to run up to 100 containerized Memcached instances without EPC swapping. Our evaluation shows the overhead introduced by lxcsgx is less than 6.9% for simple SGX applications, 9.5% for Nginx/OpenSSL, and 20.9% for containerized Memcached.
Jing (Dave) Tian, Joseph I. Choi, Grant Hernandez, Patrick Traynor, Kevin R. B. Butler
CODASPY2
2019 LBM: A Security Framework for Peripherals within the Linux Kernel
abstract
Modern computer peripherals are diverse in their capabilities and functionality, ranging from keyboards and printers to smartphones and external GPUs. In recent years, peripherals increasingly connect over a small number of standardized communication protocols, including USB, Bluetooth, and NFC. The host operating system is responsible for managing these devices; however, malicious peripherals can request additional functionality from the OS resulting in system compromise, or can craft data packets to exploit vulnerabilities within OS software stacks. Defenses against malicious peripherals to date only partially cover the peripheral attack surface and are limited to specific protocols (e.g., USB). In this paper, we propose Linux (e)BPF Modules (LBM), a general security framework that provides a unified API for enforcing protection against malicious peripherals within the Linux kernel. LBM leverages the eBPF packet filtering mechanism for performance and extensibility and we provide a high-level language to facilitate the development of powerful filtering functionality. We demonstrate how LBM can provide host protection against malicious USB, Bluetooth, and NFC devices; we also instantiate and unify existing defenses under the LBM framework. Our evaluation shows that the overhead introduced by LBM is within 1 μs per packet in most cases, application and system overhead is negligible, and LBM outperforms other state-of-the-art solutions. To our knowledge, LBM is the first security framework designed to provide comprehensive protection against malicious peripherals within the Linux kernel.
Jing (Dave) Tian, Grant Hernandez, Joseph I. Choi, Vanessa Frost, Peter C. Johnson 0001, Kevin R. B. Butler
IEEE Symposium on Security and Privacy3
2019 Enclave-based privacy-preserving localization: poster
abstract
In cooperative spectrum sensing, multiple sensors work together to perform tasks such as localizing a target transmitter. However, the exchange of spectrum measurements leads to exposure of the physical location of participating sensors. Furthermore, in some cases, the sensitive characteristics of all participants can be revealed through the compromise of any one sensor. Accordingly, without guarantees about how data will be handled, there is little reason for such devices to work together. In this work, we protect the location of sensors cooperating in spectrum sensing by processing measurements within attestable containers, or enclaves. We use the enclave as a building block for new privacy-preserving particle filter protocols. We instantiate this enclave using Intel Software Guard Extensions (SGX) and investigate how the inclusion of enclaves impacts sensor privacy, carefully enumerating the different threats present in centralized and decentralized architectures. We show that enclave-based particle filter protocols incur minimal overhead (adding 16 milliseconds of processing to the measurement processing function versus unprotected computation), whereas cryptographically-based approaches suffer from multiple orders of magnitude greater costs. Our work demonstrates that enclaves can be effectively deployed in a decentralized architecture while dramatically improving current data handling techniques.
Joseph I. Choi, Jing (Dave) Tian, Tyler Ward, Kevin R. B. Butler, Patrick Traynor, John M. Shea, Tan F. Wong
WiSec1
2019 Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities
abstract
When two or more parties need to compute a common result while safeguarding their sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled circuits. The traditional enabler of SMC is cryptography, but the significant number of cryptographic operations required results in these techniques being impractical for most real-time, online computations. Trusted execution environments (TEEs) provide hardware-enforced isolation of code and data in use, making them promising candidates for making SMC more tractable. This paper revisits the history of improvements to SMC over the years and considers the possibility of coupling trusted hardware with SMC. This paper also addresses three open challenges: (1) defeating malicious adversaries, (2) mobile-friendly TEE-supported SMC, and (3) a more general coupling of trusted hardware and privacy-preserving computation.
Joseph I. Choi, Kevin R. B. Butler
Secur. Commun. Networks1
2018 ATtention Spanned: Comprehensive Vulnerability Analysis of AT Commands Within the Android Ecosystem
Jing (Dave) Tian, Grant Hernandez, Joseph I. Choi, Vanessa Frost, Christie Ruales, Patrick Traynor, Hayawardh Vijayakumar, Lee Harrison, Amir Rahmati, Michael Grace, Kevin R. B. Butler
USENIX Security Symposium3
2017 Securing ARP/NDP From the Ground Up
abstract
The basis for all IPv4 network communication is the address resolution protocol (ARP), which maps an IP address to a device's media access control identifier. ARP has long been recognized as vulnerable to spoofing and other attacks, and past proposals to secure the protocol have often involved in modifying the basic protocol. Similarly, neighbor discovery protocol (NDP) is the basis for all IPv6 network communication, yet suffers from the same vulnerabilities as ARP. This paper introduces arpsec, a secure ARP/RARP protocol suite which does not require protocol modification, enables continual verification of the identity of the target (respondent) machine by introducing an address binding repository derived using a formal logic that bases additions to a host's ARP cache on a set of operational rules and properties, utilizes the trusted platform module (TPM), a commodity component now present in the vast majority of modern computers, to augment the logic-prover-derived assurance when needed, with TPM-facilitated attestations of system state achieved at viably low-processing cost, and supports IPv6 NDP (ndpsec) by extension of our previous work. Using commodity TPMs as our attestation base, we show that arpsec incurs an overhead ranging from 7% to 15.4% over the standard Linux ARP implementation, a comparable overhead against the standard Linux NDP implementation, and provides a first step towards a formally secure and trustworthy networking stack for both IPv4 and IPv6.
Jing (Dave) Tian, Kevin R. B. Butler, Joseph I. Choi, Patrick D. McDaniel, Padma Krishnaswamy
IEEE Trans. Inf. Forensics Secur.3