output
19992026
most citedranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R

3.5k citations

Showing 2019 · cs.CRShow all

5 papers · 2 filters

cs.CR2019★ 14 cited

JackHammer: Efficient Rowhammer on Heterogeneous FPGA-CPU Platforms

Zane Weissman, Thore Tiemann, Daniel Moghimi +3

After years of development, FPGAs are finally making an appearance on multi-tenant cloud servers. These heterogeneous FPGA-CPU architectures break common assumptions about isolatio…

cs.CR2019★ 24 cited

TPM-FAIL: TPM meets Timing and Lattice Attacks

Daniel Moghimi, Berk Sunar, Thomas Eisenbarth +1

Trusted Platform Module (TPM) serves as a hardware-based root of trust that protects cryptographic keys from privileged system and physical adversaries. In this work, we perform a…

cs.CR2019★ 3 cited

Differential privacy with partial knowledge

Damien Desfontaines, Esfandiar Mohammadi, Elisabeth Krahmer +1

Differential privacy offers formal quantitative guarantees for algorithms over datasets, but it assumes attackers that know and can influence all but one record in the database. Th…

cs.CR2019★ 26 cited

RELOAD+REFRESH: Abusing Cache Replacement Policies to Perform Stealthy Cache Attacks

Samira Briongos, Pedro Malagón, José M. Moya +1

Caches have become the prime method for unintended information extraction across logical isolation boundaries. Even Spectre and Meltdown rely on the cache side channel, as it provi…

cs.CR2019★ 41 cited

SPOILER: Speculative Load Hazards Boost Rowhammer and Cache Attacks

Saad Islam, Ahmad Moghimi, Ida Bruhns +4

Modern microarchitectures incorporate optimization techniques such as speculative loads and store forwarding to improve the memory bottleneck. The processor executes the load specu…