Zack McKevitt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Zack McKevitt has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ange-Thierry Ishimwe
University of Colorado Boulder, Boulder, USA
2 shared publications - Tamara Silbergleit Lehman
Electrical, Computer and Energy Engineering Department, University of Colorado Boulder, Boulder, CO, USA
2 shared publications - Joseph Izraelevitz
University of Colorado, Boulder, USA
1 shared publication - Kidus Workneh
University of Colorado, Boulder, Boulder, USA
1 shared publication - Phaedra Sophia Curlin
University of Colorado Boulder, Boulder, United States
1 shared publication - Ruth Iris Bahar
Department of Computer Science, Colorado School of Mines, Golden, CO, United States
1 shared publication
Latest Publications
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 67-80
SSMR: Statically Detecting Speculation Safe Memory Regions to Mitigate Transient Execution Attacks
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 67-80
Open AccessSSMR: Statically Detecting Speculation Safe Memory Regions to Mitigate Transient Execution Attacks
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (1) , 33-36
Baobab Merkle Tree for Efficient Secure Memory
Secure memory is a natural solution to hardware vulnerabilities in memory, but it faces fundamental challenges of performance and memory overheads. While significant work has gone into optimizing the protocol for performance, far less work has gone into optimizing its memory overhead. In this work, we propose the Baobab Merkle Tree, in which counters are memoized in an on-chip table. The Baobab Merkle Tree reduces spatial overhead of a Bonsai Merkle Tree by 2-4X without incurring performance overhead.
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (1) , 33-36
Baobab Merkle Tree for Efficient Secure Memory
Secure memory is a natural solution to hardware vulnerabilities in memory, but it faces fundamental challenges of performance and memory overheads. While significant work has gone into optimizing the protocol for performance, far less work has gone into optimizing its memory overhead. In this work, we propose the Baobab Merkle Tree, in which counters are memoized in an on-chip table. The Baobab Merkle Tree reduces spatial overhead of a Bonsai Merkle Tree by 2-4X without incurring performance overhead.