Sciweavers

340 search results - page 6 / 68
» Computationally Private Information Retrieval with Polylogar...
Sort
View
AINA
2006
IEEE
14 years 23 days ago
Dual RSA Accumulators and Its Application for Private Revocation Check
This paper points out the privacy issue in the OCSP (Online Certificate Status Protocol), namely, the OCSP responder learns confidential information – who sends a message to w...
Hiroaki Kikuchi
WWW
2003
ACM
14 years 7 months ago
SHOCK: communicating with computational messages and automatic private profiles
A computationally enhanced message contains some embedded programmatic components that are interpreted and executed automatically upon receipt. Unlike ordinary text email or insta...
Rajan M. Lukose, Eytan Adar, Joshua R. Tyler, Caes...
ICALP
2007
Springer
14 years 26 days ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
ICDCN
2011
Springer
12 years 10 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
ORL
2006
98views more  ORL 2006»
13 years 6 months ago
The communication complexity of private value single-item auctions
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions--the Vickr...
Elena Grigorieva, P. Jean-Jacques Herings, Rudolf ...