Sciweavers

1816 search results - page 7 / 364
» Trace oblivious computation
Sort
View
CSR
2006
Springer
13 years 11 months ago
Weighted Logics for Traces
Abstract. We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series wi...
Ingmar Meinecke
ACMMSP
2006
ACM
232views Hardware» more  ACMMSP 2006»
14 years 3 months ago
Implicit and explicit optimizations for stencil computations
Stencil-based kernels constitute the core of many scientific applications on block-structured grids. Unfortunately, these codes achieve a low fraction of peak performance, due pr...
Shoaib Kamil, Kaushik Datta, Samuel Williams, Leon...
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 10 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
FOCS
2009
IEEE
14 years 4 months ago
Oblivious Routing for the Lp-norm
Matthias Englert, Harald Räcke