Marten van Dijk

Publications
Influence

Fully Homomorphic Encryption over the Integers

Marten van Dijk, C. Gentry, S. Halevi, V. Vaikuntanathan
Computer Science, Mathematics
EUROCRYPT
30 May 2010

We construct a simple fully homomorphic encryption scheme from a “bootstrappable” somewhat homomorphic scheme. Expand

1,491
129
PDF

Path ORAM

E. Stefanov, Marten van Dijk, +4 authors S. Devadas
Computer Science
IACR Cryptol. ePrint Arch.
23 February 2012

We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Expand

Silicon physical random functions

B. Gassend, D. Clarke, Marten van Dijk, S. Devadas
Computer Science
CCS '02
18 November 2002

We introduce the notion of a Physical Random Function (PUF). Expand

1,268
110
PDF

Extracting secret keys from integrated circuits

D. Lim, J. Lee, B. Gassend, G. Suh, Marten van Dijk, S. Devadas
Engineering, Computer Science
IEEE Transactions on Very Large Scale Integration…
1 October 2005

Modern cryptographic protocols are based on the premise that only authorized participants can obtain secret keys and access to information systems. However, various kinds of tampering methods have… Expand

AEGIS: architecture for tamper-evident and tamper-resistant processing

G. Suh, D. Clarke, B. Gassend, Marten van Dijk, S. Devadas
Computer Science
23 June 2003

We describe the architecture for a single-chip aegis processor which can be used to build computing systems secure against both physical and software attacks. Expand

FlipIt: The Game of “Stealthy Takeover”

Marten van Dijk, A. Juels, Alina Oprea, R. Rivest
Computer Science, Business
Journal of Cryptology
1 October 2013

We introduce a game-theoretic framework for modeling various computer security scenarios prevalent today, including targeted attacks. Expand

Caches and hash trees for efficient memory integrity verification

B. Gassend, G. Suh, D. Clarke, Marten van Dijk, S. Devadas
Computer Science
The Ninth International Symposium on High…
8 February 2003

We study the hardware cost of implementing hash-tree based verification of untrusted external memory by a high performance processor. Expand

Controlled physical random functions

B. Gassend, D. Clarke, Marten van Dijk, S. Devadas
Computer Science
18th Annual Computer Security Applications…
2002

We introduce controlled physical random functions (CPUFs) which are PUFs that can only be accessed via an algorithm that is physically bound to the PUF in an inseparable way. Expand

AEGIS: architecture for tamper-evident and tamper-resistant processing

G. Suh, D. Clarke, B. Gassend, Marten van Dijk, S. Devadas
Computer Science
ICS
2003

We describe the architecture for a single-chip aegis processor which can be used to build computing systems secure against both physical and software attacks. Expand

Constants Count: Practical Improvements to Oblivious RAM

Ling Ren, Christopher W. Fletcher, +4 authors S. Devadas
Computer Science
USENIX Security Symposium
12 August 2015

Ring ORAM is the first tree-based ORAM whose bandwidth is independent of the ORAM bucket size, a property that unlocks multiple performance improvements. Expand

Recommended Authors