Sciweavers

150 search results - page 21 / 30
» Oblivious Transfer Is Symmetric
Sort
View
NDSS
2008
IEEE
14 years 1 months ago
Usable PIR
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...
Peter Williams, Radu Sion
PET
2010
Springer
13 years 11 months ago
Collaborative, Privacy-Preserving Data Aggregation at Scale
Combining and analyzing data collected at multiple locations is critical for a wide variety of applications, such as detecting and diagnosing malicious attacks or computing an acc...
Benny Applebaum, Haakon Ringberg, Michael J. Freed...
TVCG
2010
165views more  TVCG 2010»
13 years 2 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin
TCC
2009
Springer
133views Cryptology» more  TCC 2009»
14 years 8 months ago
Composing Quantum Protocols in a Classical Environment
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...
Serge Fehr, Christian Schaffner
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 7 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth