Matthew Denton
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Matthew Denton has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Akshay Rampuria
Department of Computer Science, Stanford University, Stanford, CA 94305, USA
1 shared publication - Alexander Potapenko
Google, Munich, Germany
1 shared publication - Anunay Kulshrestha
Department of Computer Science, Stanford University, Stanford, CA 94305, USA
1 shared publication - Ashwin Sreenivas
Department of Computer Science, Stanford University, Stanford, CA 94305, USA
1 shared publication - Chris Kennelly
Google, New York, NY, USA
1 shared publication - Christian Holler
Mozilla Corporation, Bonn, Germany
1 shared publication
Latest Publications
- Open Access
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 168-177
GWP-ASan: Sampling-Based Detection of Memory-Safety Bugs in Production
Despite the recent advances in pre-production bug detection, heap-use-after-free and heap-buffer-overflow bugs remain the primary problem for security, reliability, and developer productivity for applications written in C or C++, across all major software ecosystems. Memory-safe languages solve this problem when they are used, but the existing code bases consisting of billions of lines of C and C++ continue to grow, and we need additional bug detection mechanisms. This paper describes a family of tools that detect these two classes of memory-safety bugs, while running in production, at near-zero overhead. These tools combine page-granular guarded allocation and low-rate sampling. In other words, we added an "if" statement to a 36-year-old idea and made it work at scale. We describe the basic algorithm, several of its variants and implementations, and the results of multi-year deployments across mobile, desktop, and server applications.
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 168-177
Open AccessGWP-ASan: Sampling-Based Detection of Memory-Safety Bugs in Production
Despite the recent advances in pre-production bug detection, heap-use-after-free and heap-buffer-overflow bugs remain the primary problem for security, reliability, and developer productivity for applications written in C or C++, across all major software ecosystems. Memory-safe languages solve this problem when they are used, but the existing code bases consisting of billions of lines of C and C++ continue to grow, and we need additional bug detection mechanisms. This paper describes a family of tools that detect these two classes of memory-safety bugs, while running in production, at near-zero overhead. These tools combine page-granular guarded allocation and low-rate sampling. In other words, we added an "if" statement to a 36-year-old idea and made it work at scale. We describe the basic algorithm, several of its variants and implementations, and the results of multi-year deployments across mobile, desktop, and server applications.
- Open Access
- 12 December 2017
- Published by MDPI AG in Cryptography
- Vol. 1 (3) , 25
Cryptographically Secure Multiparty Computation and Distributed Auctions Using Homomorphic Encryption
We introduce a robust framework that allows for cryptographically secure multiparty computations, such as distributed private value auctions. The security is guaranteed by two-sided authentication of all network connections, homomorphically encrypted bids, and the publication of zero-knowledge proofs of every computation. This also allows a non-participant verifier to verify the result of any such computation using only the information broadcasted on the network by each individual bidder. Building on previous work on such systems, we design and implement an extensible framework that puts the described ideas to practice. Apart from the actual implementation of the framework, our biggest contribution is the level of protection we are able to guarantee from attacks described in previous work. In order to provide guidance to users of the library, we analyze the use of zero knowledge proofs in ensuring the correct behavior of each node in a computation. We also describe the usage of the library to perform a private-value distributed auction, as well as the other challenges in implementing the protocol, such as auction registration and certificate distribution. Finally, we provide performance statistics on our implementation of the auction.
- 12 December 2017
- Published by MDPI AG in Cryptography
- Vol. 1 (3) , 25
Open AccessCryptographically Secure Multiparty Computation and Distributed Auctions Using Homomorphic Encryption
We introduce a robust framework that allows for cryptographically secure multiparty computations, such as distributed private value auctions. The security is guaranteed by two-sided authentication of all network connections, homomorphically encrypted bids, and the publication of zero-knowledge proofs of every computation. This also allows a non-participant verifier to verify the result of any such computation using only the information broadcasted on the network by each individual bidder. Building on previous work on such systems, we design and implement an extensible framework that puts the described ideas to practice. Apart from the actual implementation of the framework, our biggest contribution is the level of protection we are able to guarantee from attacks described in previous work. In order to provide guidance to users of the library, we analyze the use of zero knowledge proofs in ensuring the correct behavior of each node in a computation. We also describe the usage of the library to perform a private-value distributed auction, as well as the other challenges in implementing the protocol, such as auction registration and certificate distribution. Finally, we provide performance statistics on our implementation of the auction.