Sciweavers

100 search results - page 11 / 20
» Alice and Bob
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 2 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
SAINT
2005
IEEE
14 years 1 months ago
A User-Oriented Presence Synthesizing System for Facilitating On-Line Communication
This paper shows a user-oriented presence synthesizing system, where a user can control not only what she publishes to each buddy but what she sees by synthesizing her buddies’ ...
Masato Kawada, Nodoka Mimura, Hiroyuki Morikawa, T...
ACSAC
2004
IEEE
13 years 11 months ago
Open-Source Applications of TCPA Hardware
How can Alice trust computation occurring at Bob's computer? Since it exists and is becoming ubiquitous, the current-generation TCPA/TCG hardware might enable a solution. Whe...
John Marchesini, Sean W. Smith, Omen Wild, Joshua ...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro