111 search results - page 13 / 23 » Errors in Computational Complexity Proofs for Protocols |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
CRYPTO
1999
Springer
14 years 26 days ago
1999
Springer
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
ICDCS
2010
IEEE
13 years 6 months ago
2010
IEEE
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
CCS
2001
ACM
14 years 7 days ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
WCNC
2008
IEEE
14 years 3 months ago
2008
IEEE
Hybrid automatic repeat-request (HARQ) is critical to an IEEE 802.16e OFDMA network, as it can significantly improve the reliability of wireless link. However, as revealed by our...