872 search results - page 77 / 175 » Extreme lower probabilities |
126
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
91
Voted
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
124
click to vote
CRYPTO
2010
Springer
15 years 1 months ago
2010
Springer
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...
132
click to vote
ECCC
2011
14 years 7 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
112
Voted
OPODIS
2007
15 years 2 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....