978 search results - page 49 / 196 » Knowledge, Probability, and Adversaries |
195
click to vote
ESORICS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
185
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
200
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
174
click to vote
CSFW
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...