100 search results - page 9 / 20 » Alice and Bob |
NDSS
2006
IEEE
14 years 1 months ago
2006
IEEE
In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather tha...
FC
2005
Springer
14 years 1 months ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
ICMCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
IMA
2001
Springer
14 years 2 days ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...