Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amund Bergland Kvalsvik

dblp:332/3222 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0007-7112-865XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-author · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 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
3 papers
Hardware security and side channels · 94% Systems and software security · 6%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Processor architecture and microarchitecture · 77% Memory systems · 23%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
speculative execution
1.322023
ReCon: Efficient Detection, Management, and Use of Non-Speculative Information Leakage · MICRO 2023
Doppelganger Loads: A Safe, Complexity-Effective Optimization for Secure Speculation Schemes · ISCA 2023
Hardware security and side channels
microarchitectural side channel
0.712023
Doppelganger Loads: A Safe, Complexity-Effective Optimization for Secure Speculation Schemes · ISCA 2023
Hardware security and side channels › secure speculation
speculative side-channel defense
0.712023
Doppelganger Loads: A Safe, Complexity-Effective Optimization for Secure Speculation Schemes · ISCA 2023
Memory systems › memory access optimization
memory-level parallelism
0.712023
ReCon: Efficient Detection, Management, and Use of Non-Speculative Information Leakage · MICRO 2023
Processor architecture and microarchitecture › speculative execution
secure speculation
0.712023
Doppelganger Loads: A Safe, Complexity-Effective Optimization for Secure Speculation Schemes · ISCA 2023
Processor architecture and microarchitecture › out-of-order execution
out-of-order processor
0.312025
ShadowBinding: Realizing Effective Microarchitectures for In-Core Secure Speculation Schemes · MICRO 2025
Hardware security and side channels
side-channel countermeasures
0.212023
ReCon: Efficient Detection, Management, and Use of Non-Speculative Information Leakage · MICRO 2023
Systems and software security › information flow tracking
taint analysis
0.212023
ReCon: Efficient Detection, Management, and Use of Non-Speculative Information Leakage · MICRO 2023

Methods — techniques the papers use, named apart from their topics

speculative taint tracking · 1.7RTL evaluation · 1.7IPC analysis · 1.7
YearPublicationVenuePosition
2025 ShadowBinding: Realizing Effective Microarchitectures for In-Core Secure Speculation Schemes
abstract
Secure speculation schemes have shown great promise in the war against speculative side-channel attacks and will be a key building block for developing secure, high-performance architectures moving forward.As the field matures, the need for rigorous microarchitectures, and corresponding performance and cost analysis, become critical for evaluating secure schemes and for enabling their future adoption.In ShadowBinding, we present effective microarchitectures for two state-of-the-art secure schemes, uncovering and mitigating fundamental microarchitectural limitations within the analyzed schemes, and providing important design characteristics.We uncover that Speculative Taint Tracking's (STT's) rename-based taint computation must be completed in a single cycle, creating an expensive dependency chain that limits performance for wider processor cores.We also introduce a novel microarchitectural approach for STT, named STT-Issue, which, by delaying the taint computation to the issue stage, eliminates the dependency chain, achieving better instructions per cycle (IPC), timing, area, and performance results.Through a comprehensive evaluation of our STT and Non-Speculative Data Access (NDA) microarchitectural designs on the RISC-V Berkeley Out-of-Order Machine, we find that the IPC impact of in-core secure schemes is higher than previously estimated, close to 20% for the highest performance core.With insights into timing from our RTL evaluation, the performance loss, created by the combined impact of IPC and timing, becomes even greater, at 35%, 27%, and 22% for STT-Rename, STT-Issue, and NDA, respectively.If these trends were to hold for leading processor core designs, the performance impact would be well over 30%, even for the bestperforming scheme.Through these findings, research sentiments that Spectre can be solved by in-core secure schemes at low-performance costs are challenged.ShadowBinding serves as a call to arms for a more indepth evaluation of secure speculation schemes and further work on in-core methods and optimizations, which can help mitigate the high performance cost of current state-of-the-art schemes without requiring extensive and expensive modifications.
Amund Bergland Kvalsvik, Magnus Själander
MICRO1
2023 Doppelganger Loads: A Safe, Complexity-Effective Optimization for Secure Speculation Schemes
abstract
Speculative side-channel attacks have forced computer architects to rethink speculative execution. Effectively preventing microarchitectural state from leaking sensitive information will be a key requirement in future processor design.
Amund Bergland Kvalsvik, Pavlos Aimoniotis, Stefanos Kaxiras, Magnus Själander
ISCA1
2023 ReCon: Efficient Detection, Management, and Use of Non-Speculative Information Leakage
abstract
In a speculative side-channel attack, a secret is improperly accessed and then leaked by passing it to a transmitter instruction. Several proposed defenses effectively close this security hole by either delaying the secret from being loaded or propagated, or by delaying dependent transmitters (e.g., loads) from executing when fed with tainted input derived from an earlier speculative load. This results in a loss of memory-level parallelism and performance.
Pavlos Aimoniotis, Amund Bergland Kvalsvik, Magnus Själander, Stefanos Kaxiras
MICRO2