Sciweavers

59 search results - page 11 / 12
» Universality and Tolerance
Sort
View
IACR
2011
196views more  IACR 2011»
12 years 9 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
WWW
2006
ACM
14 years 10 months ago
Analysis of WWW traffic in Cambodia and Ghana
In this paper we present an analysis of HTTP traffic captured from Internet caf?es and kiosks from two different developing countries ? Cambodia and Ghana. This paper has two main...
Bowei Du, Michael J. Demmer, Eric A. Brewer
SC
2009
ACM
14 years 4 months ago
FALCON: a system for reliable checkpoint recovery in shared grid environments
In Fine-Grained Cycle Sharing (FGCS) systems, machine owners voluntarily share their unused CPU cycles with guest jobs, as long as the performance degradation is tolerable. For gu...
Tanzima Zerin Islam, Saurabh Bagchi, Rudolf Eigenm...
TAPIA
2009
ACM
14 years 2 months ago
Research experiences for undergraduates: autonomic computing research at FIU
According to Computing Research Association, during each year between 2003 and 2007, fewer than 3% of the US’s Ph.D.s graduates in computer science and computer engineering were...
Masoud Milani, Seyed Masoud Sadjadi, Raju Rangaswa...
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger