53 search results - page 8 / 11 » The Exact Round Complexity of Secure Computation |
ACISP
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
IJISEC
2006
14 years 11 months ago
2006
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
102
click to vote
JOC
2008
14 years 11 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
105
click to vote
IACR
2011
13 years 11 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
DAM
2007
14 years 11 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...