Share This Author
Fully Homomorphic Encryption over the Integers
- Marten van Dijk, Craig Gentry, S. Halevi, V. Vaikuntanathan
- Mathematics, Computer ScienceInternational Conference on the Theory and…
- 30 May 2010
A fully homomorphic encryption scheme, using only elementary modular arithmetic, that reduces the security of the scheme to finding an approximate integer gcd, and investigates the hardness of this task, building on earlier work of Howgrave-Graham.
Silicon physical random functions
- B. Gassend, D. Clarke, Marten van Dijk, S. Devadas
- Computer Science, MathematicsConference on Computer and Communications…
- 18 November 2002
It is argued that a complex integrated circuit can be viewed as a silicon PUF and a technique to identify and authenticate individual integrated circuits (ICs) is described.
Extracting secret keys from integrated circuits
- D. Lim, Jae W. Lee, B. Gassend, G. Suh, Marten van Dijk, S. Devadas
- Computer ScienceIEEE Transactions on Very Large Scale Integration…
- 1 October 2005
It is shown that arbiter-based PUFs are realizable and well suited to build key-cards that need to be resistant to physical attacks and to be identified securely and reliably over a practical range of environmental variations such as temperature and power supply voltage.
Path ORAM
- Emil Stefanov, Marten van Dijk, S. Devadas
- Computer Science, MathematicsIACR Cryptology ePrint Archive
- 23 February 2012
It is formally proved that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Ω (log2 N) bits, and is asymptotically better than the best-known ORAM schemes with small client storage.
AEGIS: architecture for tamper-evident and tamper-resistant processing
- G. Suh, D. Clarke, B. Gassend, Marten van Dijk, S. Devadas
- Computer ScienceInternational Conference on Supercomputing
- 23 June 2003
The architecture for a single-chip aegis processor which can be used to build computing systems secure against both physical and software attacks is described and preliminary simulation results indicate that the overhead of security mechanisms in aegIS is reasonable.
Efficient memory integrity verification and encryption for secure processors
- G. Suh, D. Clarke, B. Gassend, Marten van Dijk, S. Devadas
- Computer ScienceProceedings. 36th Annual IEEE/ACM International…
- 3 December 2003
New hardware mechanisms for memory integrity verification and encryption, which are two key primitives required in single-chip secure processors, are proposed.
FlipIt: The Game of “Stealthy Takeover”
- Marten van Dijk, A. Juels, Alina Oprea, R. Rivest
- Computer Science, MathematicsJournal of Cryptology
- 26 October 2012
A game-theoretic framework for modeling various computer security scenarios prevalent today, including targeted attacks, and proposes a two-player game between an attacker and defender called FlipIt or The Game of “Stealthy Takeover.”
Controlled physical random functions
- B. Gassend, D. Clarke, Marten van Dijk, S. Devadas
- Computer Science, Mathematics18th Annual Computer Security Applications…
- 9 December 2002
Controlled physical random functions (CPUFs) are introduced which are PUFs that can only be accessed via an algorithm that is physically bound to the PUF in an inseparable way.
Caches and hash trees for efficient memory integrity verification
- B. Gassend, G. Suh, D. Clarke, Marten van Dijk, S. Devadas
- Computer ScienceThe Ninth International Symposium on High…
- 8 February 2003
Simulations show that for the best of the methods, the performance overhead is less than 25%, a significant decrease from the 10/spl times/ overhead of a naive implementation.
Constants Count: Practical Improvements to Oblivious RAM
- Ling Ren, Christopher W. Fletcher, S. Devadas
- Computer Science, MathematicsUSENIX Security Symposium
- 12 August 2015
This paper proposes Ring ORAM, the most bandwidth-efficient ORAM scheme for the small client storage setting in both theory and practice, the first tree-based ORAM whose bandwidth is independent of the ORAM bucket size, a property that unlocks multiple performance improvements.
...
...