most citedProving the Absence of Microarchitectural Timing Channels

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing cs.PLShow all

1 paper · 1 filter

cs.PL2024

Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms (Extended Version)

Pengbo Yan, Toby Murray, Olga Ohrimenko +2

We consider the problem of how to verify the security of probabilistic oblivious algorithms formally and systematically. Unfortunately, prior program logics fail to support a numbe…