250 search results - page 21 / 50 » A Round and Communication Efficient Secure Ranking Protocol |
113
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
136
click to vote
ISW
2010
Springer
14 years 11 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
123
click to vote
IPL
2006
15 years 1 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
145
click to vote
PEWASUN
2004
ACM
15 years 7 months ago
2004
ACM
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location i...
140
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...