Steven Seiden
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
Steven Seiden has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Ibrahim Baggili
Baggili(i) Truth (BiT) Lab, Division of Computer Science and Engineering, Louisiana State University, Baton Rouge, LA, USA
2 shared publications - Andrew M. Webb
Louisiana State University, USA
1 shared publication - Caroline Zhang
Department of Computer Science, Duke University, Durham, North Carolina, USA
1 shared publication Daniel S. Hirschberg
Department of Information and Computer Science, University of California, Irvine, CA 92717, USA
1 shared publication- Elias Bou-Harb
Louisiana State University
1 shared publication - Emily Wenger
Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina, USA
1 shared publication
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7306-7308
Improving Transparency and Accountability in AI Data Use
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7306-7308
Open AccessImproving Transparency and Accountability in AI Data Use
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6998-7012
Identifying AI Web Scrapers Using Canary Tokens
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6998-7012
Open AccessIdentifying AI Web Scrapers Using Canary Tokens
- Open Access
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Don't, Stop, Drop, Pause: Forensics of CONtainer CheckPOINTs (ConPoint)
In the rapidly evolving landscape of cloud computing, containerization technologies such as Docker and Kubernetes have become instrumental in deploying, scaling, and managing applications. However, these containers pose unique challenges for memory forensics due to their ephemeral nature. As memory forensics is a crucial aspect of incident response, our work combats these challenges by developing a deeper understanding of the containers, leading to the development of a novel, scalable tool for container memory forensics. Through experimental and computational analyses, our work investigates the forensic capabilities of container checkpoints, which capture a container’s state at a specific moment in time. We introduce ConPoint, a tool created for the collection of these checkpoints. We focused on three primary research questions: What is the most forensically sound approach for checkpointing a container’s memory and filesystem?, How long does the volatile memory evidence reside in memory?, and How long does the checkpoint process take on average to complete? Our approach successfully captured checkpoints and retrieved artifacts generated at runtime from container checkpoints. We found that digital evidence in a container’s volatile memory can persist during idle states, yet gradually diminishes over time and is entirely lost when the container shuts down. Our experiments determined the average time for checkpointing a container to be 0.537 seconds by acquiring a total of (n = 45) checkpoints from containers running different databases. The proposed work demonstrates the pragmatic feasibility of implementing checkpointing as an overarching strategy for container memory forensics and incident response.
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessDon't, Stop, Drop, Pause: Forensics of CONtainer CheckPOINTs (ConPoint)
In the rapidly evolving landscape of cloud computing, containerization technologies such as Docker and Kubernetes have become instrumental in deploying, scaling, and managing applications. However, these containers pose unique challenges for memory forensics due to their ephemeral nature. As memory forensics is a crucial aspect of incident response, our work combats these challenges by developing a deeper understanding of the containers, leading to the development of a novel, scalable tool for container memory forensics. Through experimental and computational analyses, our work investigates the forensic capabilities of container checkpoints, which capture a container’s state at a specific moment in time. We introduce ConPoint, a tool created for the collection of these checkpoints. We focused on three primary research questions: What is the most forensically sound approach for checkpointing a container’s memory and filesystem?, How long does the volatile memory evidence reside in memory?, and How long does the checkpoint process take on average to complete? Our approach successfully captured checkpoints and retrieved artifacts generated at runtime from container checkpoints. We found that digital evidence in a container’s volatile memory can persist during idle states, yet gradually diminishes over time and is entirely lost when the container shuts down. Our experiments determined the average time for checkpointing a container to be 0.537 seconds by acquiring a total of (n = 45) checkpoints from containers running different databases. The proposed work demonstrates the pragmatic feasibility of implementing checkpointing as an overarching strategy for container memory forensics and incident response.
- Open Access
- 10 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-10
On the Application of Synthetic Media to Penetration Testing
- 10 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessOn the Application of Synthetic Media to Penetration Testing
- 1 September 1994
- Published by Elsevier in Information Processing Letters
- Vol. 51 (6) , 283-288
Finding succinct ordered minimal perfect hash functions
- 1 September 1994
- Published by Elsevier in Information Processing Letters
- Vol. 51 (6) , 283-288
Finding succinct ordered minimal perfect hash functions