1401 search results - page 29 / 281 » Randomness in Interactive Proofs |
RSA
2000
14 years 9 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
RSA
2010
14 years 8 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
109
click to vote
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
CTRSA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
61
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper presents an improved analysis of a structured dimension-reduction map called the subsampled randomized Hadamard transform. This argument demonstrates that the map preser...