1401 search results - page 119 / 281 » Randomness in Interactive Proofs |
123
click to vote
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
127
click to vote
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
126
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
125
Voted
PE
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
177
Voted
MA
2011
Springer
14 years 10 months ago
2011
Springer
: By combining the findings of two recent, seminal papers by Nualart, Peccati and Tudor, we get that the convergence in law of any sequence of vector-valued multiple integrals Fn ...