This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen
In this paper we investigate techniques that allow for on-line updates to columnar databases, leaving intact their high read-only performance. Rather than keeping differential str...
— Knowledge of link capacities is essential, e.g., for ISPs to troubleshoot paths outside the boundaries of their networks. However, the vast majority of capacity measurement too...
We discuss the mapping of elementary ray tracing operations-acceleration structure traversal and primitive intersection--onto wide SIMD/SIMT machines. Our focus is on NVIDIA GPUs,...
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...