50 search results - page 4 / 10 » On the Computational Complexity of Coin Flipping |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
ICDCS
2007
IEEE
14 years 1 months ago
2007
IEEE
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that ...
IPL
2006
13 years 7 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
ICALP
2003
Springer
14 years 24 days 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...