Sciweavers

100 search results - page 5 / 20
» Alice and Bob
Sort
View
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
15 years 6 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
DAGSTUHL
2004
15 years 1 months ago
The communication complexity of the Exact-N Problem revisited
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
William I. Gasarch, James Glenn, Andrey Utis
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 12 months ago
Generalized Secure Distributed Source Coding with Side Information
In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not...
Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Rez...
CCS
2009
ACM
16 years 11 days ago
Conditional proxy re-encryption secure against chosen-ciphertext attack
In a proxy re-encryption (PRE) scheme [4], a proxy, authorized by Alice, transforms messages encrypted under Alice's public key into encryptions under Bob's public key w...
Jian Weng, Robert H. Deng, Xuhua Ding, Cheng-Kang ...
FSTTCS
2009
Springer
15 years 6 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...