156 search results - page 7 / 32 » On the Round Complexity of Covert Computation |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
FSE
2007
Springer
14 years 1 months ago
2007
Springer
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article5 is to sophisticate and improve Wang’s attack by using algebraic tech...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
CANS
2010
Springer
13 years 5 months ago
2010
Springer
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
CIG
2006
IEEE
14 years 1 months ago
2006
IEEE
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...