CryptoDB
Berk Sunar
Publications
Year
Venue
Title
2020
TCHES
JackHammer: Efficient Rowhammer on Heterogeneous FPGA-CPU Platforms
📺
Abstract
After years of development, FPGAs are finally making an appearance on multi-tenant cloud servers. Heterogeneous FPGA-CPU microarchitectures require reassessment of common assumptions about isolation and security boundaries, as they introduce new attack vectors and vulnerabilities. In this work, we analyze the memory and cache subsystem and study Rowhammer and cache attacks enabled by two proposed heterogeneous FPGA-CPU platforms from Intel: the Arria 10 GX with an integrated FPGA-CPU platform, and the Arria 10 GX PAC expansion card which connects the FPGA to the CPU via the PCIe interface. We demonstrate JackHammer, a novel, efficient, and stealthy Rowhammer from the FPGA to the host’s main memory. Our results indicate that a malicious FPGA can perform twice as fast as a typical Rowhammer from the CPU on the same system and causes around four times as many bit flips as the CPU attack. We demonstrate the efficacy of JackHammer from the FPGA through a realistic fault attack on the WolfSSL RSA signing implementation that reliably causes a fault after an average of fifty-eight RSA signatures, 25% faster than a CPU Rowhammer. In some scenarios our JackHammer attack produces faulty signatures more than three times more often and almost three times faster than a conventional CPU Rowhammer. Finally, we systematically analyze new cache attacks in these environments following demonstration of a cache covert channel across FPGA and CPU.
2018
PKC
Fully Homomorphic Encryption from the Finite Field Isomorphism Problem
Abstract
If q is a prime and n is a positive integer then any two finite fields of order $$q^n$$qn are isomorphic. Elements of these fields can be thought of as polynomials with coefficients chosen modulo q, and a notion of length can be associated to these polynomials. A non-trivial isomorphism between the fields, in general, does not preserve this length, and a short element in one field will usually have an image in the other field with coefficients appearing to be randomly and uniformly distributed modulo q. This key feature allows us to create a new family of cryptographic constructions based on the difficulty of recovering a secret isomorphism between two finite fields. In this paper we describe a fully homomorphic encryption scheme based on this new hard problem.
2005
CHES
Program Committees
- PKC 2020
- CHES 2016
- CHES 2009
- CHES 2008
- CHES 2007
- CHES 2006
- CHES 2005 (Program chair)
- CHES 2003
- CHES 2002
Coauthors
- Frederik Armknecht (1)
- Evan Custodio (1)
- David Cyganski (1)
- Aykutlu Dana (1)
- Yarkin Doröz (2)
- Thomas Eisenbarth (2)
- Berk Gülmezoglu (1)
- Ghaith Hammouri (1)
- Jeffrey Hoffstein (1)
- Mehmet Sinan Inci (1)
- Gorka Irazoqui (1)
- Roel Maes (1)
- Daniel Moghimi (1)
- Erdinç Öztürk (2)
- Christof Paar (1)
- Jill Pipher (1)
- Jean-Jacques Quisquater (1)
- Ahmad-Reza Sadeghi (1)
- Erkay Savas (2)
- Joseph H. Silverman (1)
- Berk Sunar (9)
- Thore Tiemann (1)
- Pim Tuyls (1)
- Zane Weissman (1)
- William Whyte (1)
- Zhenfei Zhang (1)