EDBT 2026 Demo / reviewers in the wild / expert
Kidus Workneh
dblp:369/9312
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0002-9190-594XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 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
1 paper |
Hardware security and side channels · 50% Cryptographic primitives and cryptanalysis · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 62% Storage systems · 38% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels › memory integrity
memory integrity verification |
0.8 | 1 | 2024 | A Midsummer Night's Tree: Efficient and High Performance Secure SCM · ASPLOS (3) 2024 |
Cryptographic primitives and cryptanalysis › hash functions
merkle tree |
0.8 | 1 | 2024 | A Midsummer Night's Tree: Efficient and High Performance Secure SCM · ASPLOS (3) 2024 |
Memory systems
non-volatile memory |
0.8 | 1 | 2024 | A Midsummer Night's Tree: Efficient and High Performance Secure SCM · ASPLOS (3) 2024 |
Storage systems
crash consistency |
0.2 | 1 | 2024 | A Midsummer Night's Tree: Efficient and High Performance Secure SCM · ASPLOS (3) 2024 |
Storage systems
storage reliability |
0.2 | 1 | 2024 | A Midsummer Night's Tree: Efficient and High Performance Secure SCM · ASPLOS (3) 2024 |
Methods — techniques the papers use, named apart from their topics
bonsai merkle tree · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A Midsummer Night's Tree: Efficient and High Performance Secure SCMabstractSecure memory is a highly desirable property to prevent memory corruption-based attacks. The emergence of nonvolatile, storage class memory (SCM) devices presents new challenges for secure memory. Metadata for integrity verification, organized in a Bonsai Merkle Tree (BMT), is cached on-chip in volatile caches, and may be lost on a power failure. As a consequence, care is required to ensure that metadata updates are always propagated into SCM. To optimize metadata updates, state-of-the-art approaches propose lazy update crash consistent metadata schemes. However, few consider the implications of their optimizations on on-chip area, which leads to inefficient utilization of scarce on-chip space. In this paper, we propose A Midsummer Night's Tree (AMNT), a novel "tree within a tree" approach to provide crash consistent integrity with low run-time overhead while limiting on-chip area for security metadata. Our approach offloads the potential hardware complexity of our technique to software to keep area overheads low. Our proposed mechanism results in significant improvements (a 41% reduction in execution overhead on average versus the state-of-the-art) for in-memory storage applications while significantly reducing the required on-chip area to implement our protocol. Kidus Workneh, Jac McCarty, Joseph Izraelevitz, Tamara Silbergleit Lehman, R. Iris Bahar |
ASPLOS (3) | 2 |