150 search results - page 25 / 30 » Oblivious Transfer Is Symmetric |
EUROPAR
2008
Springer
13 years 9 months ago
2008
Springer
Setting up generic and fully transparent distributed services for clusters implies complex and tedious kernel developments. More flexible approaches such as user-space libraries ar...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of ...
SPAA
2004
ACM
14 years 27 days ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
ACISP
2004
Springer
14 years 27 days ago
2004
Springer
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...