1816 search results - page 27 / 364 » Trace oblivious computation |
CANS
2011
Springer
12 years 9 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
SCN
2008
Springer
13 years 9 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
RT
2000
Springer
14 years 1 months ago
2000
Springer
We present a novel technique for ray tracing geometry represented by points. Our approach makes it possible to render high quality ray traced images with global illumination using ...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
DAC
1999
ACM
14 years 10 months ago
1999
ACM
Abstract We present a novel approach to performance optimization by integrating retiming and resynthesis. The approach is oblivious of register boundaries during resynthesis. In ad...