13 search results - page 2 / 3 » Alice and Bob: Reconciling Formal Models and Implementation |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
SPC
2005
Springer
13 years 10 months ago
2005
Springer
Alice first meets Bob in an entertainment shop, then, they wish to share multimedia content, but Do they know what are trustworthy users? How do they share such information in a s...
DRM
2003
Springer
13 years 10 months ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
KESAMSTA
2010
Springer
13 years 3 months ago
2010
Springer
A variety of business interactions in open environments can be captured in terms of creation and manipulation of social commitments among the agents. Such interactions include B2B ...