156 search results - page 11 / 32 » On the Round Complexity of Covert Computation |
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
200
click to vote
ASIACRYPT
2011
Springer
13 years 11 months ago
2011
Springer
Since Rijndael was chosen as the Advanced Encryption Standard, improving upon 7-round attacks on the 128-bit key variant or upon 8-round attacks on the 192/256-bit key variants has...
ASAP
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose a digit-recurrence algorithm for division in real and complex number domains using a variable radix. The objective of the approach is to simplify the prescaling of the ...
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
The increasing size and complexity of high-performance applications have motivated a new round of innovation related to configuration, build, and launch of applications for large ...
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...