Malte Schwarzkopf
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
Research Subjects
Malte Schwarzkopf has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Akshay Narayan
Brown University, Providence, Rhode Island, USA
2 shared publications - Andrew Crotty
Northwestern University, Evanston, IL, USA
2 shared publications - Artem Agvanian
Brown University, Providence, Rhode Island, USA
2 shared publications - Corinn Tiffany
Brown University, Providence, Rhode Island, USA
2 shared publications - Deepti Raghavan
Brown University, Providence, Rhode Island, USA
2 shared publications - Franco Solleza
Brown University, Providence, Rhode Island, USA
2 shared publications
Latest Publications
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 50-59
We Need to Talk About the Actual Guarantees of Rust-based Systems
Over the past decade, systems research has leveraged Rust to build systems that enforce valuable security and isolation guarantees over user-provided code in extensions. This paper identifies a common weakness in these Rust-based systems: extensions, even those that may be considered “safe,” may fail to uphold the language properties on which these systems rely. We present case studies where this mismatch breaks system guarantees and “safe” extensions corrupt kernel state in RedLeaf [35] and leak private data in Sesame [13]. As a path forward, we propose tooling to detect possible violations of system invariants in extension code. An early prototype static analysis tool suggests that this approach detects guarantee-breaking code with low false-positive rates.
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 50-59
Open AccessWe Need to Talk About the Actual Guarantees of Rust-based Systems
Over the past decade, systems research has leveraged Rust to build systems that enforce valuable security and isolation guarantees over user-provided code in extensions. This paper identifies a common weakness in these Rust-based systems: extensions, even those that may be considered “safe,” may fail to uphold the language properties on which these systems rely. We present case studies where this mismatch breaks system guarantees and “safe” extensions corrupt kernel state in RedLeaf [35] and leak private data in Sesame [13]. As a path forward, we propose tooling to detect possible violations of system invariants in extension code. An early prototype static analysis tool suggests that this approach detects guarantee-breaking code with low false-positive rates.
- Open Access
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 215-224
Towards Practically-Secure Tools for AI Agents
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 215-224
Open AccessTowards Practically-Secure Tools for AI Agents
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 512-528
Loom: Efficient Capture and Querying of High-Frequency Telemetry
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 512-528
Open AccessLoom: Efficient Capture and Querying of High-Frequency Telemetry
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 55-62
Kernel Extension DSLs Should Be Verifier-Safe!
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 55-62
Open AccessKernel Extension DSLs Should Be Verifier-Safe!
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 709-725
Sesame: Practical End-to-End Privacy Compliance with Policy Containers and Privacy Regions
Web applications are governed by privacy policies, but developers lack practical abstractions to ensure that their code actually abides by these policies. This leads to frequent oversights, bugs, and costly privacy violations. Sesame is a practical framework for end-to-end privacy policy enforcement. Sesame wraps data in policy containers that associate data with policies that govern its use. Policy containers force developers to use privacy regions when operating on the data, and Sesame combines sandboxing and a novel static analysis to prevent privacy regions from leaking data. Sesame enforces a policy check before externalizing data, and it supports custom I/O via reviewed, signed code. Experience with four web applications shows that Sesame's automated guarantees cover 95% of application code, with the remaining 5% needing manual review. Sesame achieves this with reasonable application developer effort and imposes 3--10% performance overhead (10--55% with sandboxes).
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 709-725
Open AccessSesame: Practical End-to-End Privacy Compliance with Policy Containers and Privacy Regions
Web applications are governed by privacy policies, but developers lack practical abstractions to ensure that their code actually abides by these policies. This leads to frequent oversights, bugs, and costly privacy violations. Sesame is a practical framework for end-to-end privacy policy enforcement. Sesame wraps data in policy containers that associate data with policies that govern its use. Policy containers force developers to use privacy regions when operating on the data, and Sesame combines sandboxing and a novel static analysis to prevent privacy regions from leaking data. Sesame enforces a policy check before externalizing data, and it supports custom I/O via reviewed, signed code. Experience with four web applications shows that Sesame's automated guarantees cover 95% of application code, with the remaining 5% needing manual review. Sesame achieves this with reasonable application developer effort and imposes 3--10% performance overhead (10--55% with sandboxes).
- Open Access
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 434-450
Edna: Disguising and Revealing User Data in Web Applications
Edna is a system that helps web applications allow users to remove their data without permanently losing their accounts, anonymize their old data, and selectively dissociate personal data from public profiles. Edna helps developers support these features while maintaining application functionality and referential integrity via disguising and revealing transformations. Disguising selectively renders user data inaccessible via encryption, and revealing enables the user to restore their data to the application. Edna's techniques allow transformations to compose in any order, e.g., deleting a previously anonymized user's account, or restoring an account back to an anonymized state. Experiments with Edna that add disguising and revealing transformations to three real-world applications show that Edna enables new privacy features in existing applications with low developer effort, is simpler than alternative approaches, and adds limited overhead to applications.
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 434-450
Open AccessEdna: Disguising and Revealing User Data in Web Applications
Edna is a system that helps web applications allow users to remove their data without permanently losing their accounts, anonymize their old data, and selectively dissociate personal data from public profiles. Edna helps developers support these features while maintaining application functionality and referential integrity via disguising and revealing transformations. Disguising selectively renders user data inaccessible via encryption, and revealing enables the user to restore their data to the application. Edna's techniques allow transformations to compose in any order, e.g., deleting a previously anonymized user's account, or restoring an account back to an anonymized state. Experiments with Edna that add disguising and revealing transformations to three real-world applications show that Edna enables new privacy features in existing applications with low developer effort, is simpler than alternative approaches, and adds limited overhead to applications.
- Open Access
- 22 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 127-134
Towards Increased Datacenter Efficiency with Soft Memory
Memory is the bottleneck resource in today's datacenters because it is inflexible: low-priority processes are routinely killed to free up resources during memory pressure. This wastes CPU cycles upon re-running killed jobs and incentivizes datacenter operators to run at low memory utilization for safety. This paper introduces soft memory, a software-level abstraction on top of standard primary storage that, under memory pressure, makes memory revocable for re-allocation elsewhere. We prototype soft memory with the Redis key-value store, and find that it has low overhead.
- 22 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 127-134
Open AccessTowards Increased Datacenter Efficiency with Soft Memory
Memory is the bottleneck resource in today's datacenters because it is inflexible: low-priority processes are routinely killed to free up resources during memory pressure. This wastes CPU cycles upon re-running killed jobs and incentivizes datacenter operators to run at low memory utilization for safety. This paper introduces soft memory, a software-level abstraction on top of standard primary storage that, under memory pressure, makes memory revocable for re-allocation elsewhere. We prototype soft memory with the Redis key-value store, and find that it has low overhead.
- Open Access
- 22 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 196-205
Unleashing True Utility Computing with Quicksand
Today's clouds are inefficient: their utilization of resources like CPUs, GPUs, memory, and storage is low. This inefficiency occurs because applications consume resources at variable rates and ratios, while clouds offer resources at fixed rates and ratios. This mismatch of offering and consumption styles prevents fully realizing the utility computing vision. We advocate for fungible applications, that is, applications that can distribute, scale, and migrate their consumption of different resources independently while fitting their availability across different servers (e.g., memory at one server, CPU at another). Our goal is to make use of resources even if they are transiently available on a server for only a few milliseconds. We are developing a framework called Quicksand for building such applications and unleashing the utility computing vision. Initial results using Quicksand to implement a DNN training pipeline are promising: Quicksand saturates resources that are imbalanced across machines or rapidly shift in quantity.
- 22 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 196-205
Open AccessUnleashing True Utility Computing with Quicksand
Today's clouds are inefficient: their utilization of resources like CPUs, GPUs, memory, and storage is low. This inefficiency occurs because applications consume resources at variable rates and ratios, while clouds offer resources at fixed rates and ratios. This mismatch of offering and consumption styles prevents fully realizing the utility computing vision. We advocate for fungible applications, that is, applications that can distribute, scale, and migrate their consumption of different resources independently while fitting their availability across different servers (e.g., memory at one server, CPU at another). Our goal is to make use of resources even if they are transiently available on a server for only a few milliseconds. We are developing a framework called Quicksand for building such applications and unleashing the utility computing vision. Initial results using Quicksand to implement a DNN training pipeline are promising: Quicksand saturates resources that are imbalanced across machines or rapidly shift in quantity.
- Open Access
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 168
Stream Processing in Production-to-Business Software
In order to support continuous queries over data streams, a plethora of suitable techniques as well as prototypes have been developed and evaluated in recent years. In particular, it is of utmost importance to confirm their necessity and feasibility in real-world applications. For that reason, we have successfully coupled our infrastructure for data stream processing (PIPES) with an industrial Production-to-Business software (i-Plant) dedicated to highly automated manufacturing processes.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 168
Open AccessStream Processing in Production-to-Business Software
In order to support continuous queries over data streams, a plethora of suitable techniques as well as prototypes have been developed and evaluated in recent years. In particular, it is of utmost importance to confirm their necessity and feasibility in real-world applications. For that reason, we have successfully coupled our infrastructure for data stream processing (PIPES) with an industrial Production-to-Business software (i-Plant) dedicated to highly automated manufacturing processes.