100 search results - page 19 / 20 » Alice and Bob |
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present the first positive obfuscation result for a traditional cryptographic functionality. This positive result stands in contrast to well-known negative impossibil...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—The success of future P2P applications ultimately depends on whether users will contribute their bandwidth, CPU and storage resources to a larger community. In this paper, we pr...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...