1401 search results - page 40 / 281 » Randomness in Interactive Proofs |
FSS
2006
14 years 9 months ago
2006
In this paper, we shall present strong laws of large numbers (SLLN's) for independent (not necessary identically distributed) fuzzy set-valued random variables whose base spa...
RSA
2010
14 years 4 months ago
2010
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
87
Voted
TIT
2010
14 years 4 months ago
2010
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
ACNS
2006
Springer
15 years 3 months ago
2006
Springer
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient t...
103
click to vote
RSA
2010
14 years 8 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...