860 search results - page 24 / 172 » Completeness in two-party secure computation: a computationa... |
166
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
156
click to vote
WETICE
2007
IEEE
16 years 10 days ago
2007
IEEE
The design and promotion of electronic patient summaries as an instrument to facilitate the pervasive delivery of healthcare is emerging as a key technology in eHealth solutions. ...
173
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
169
click to vote
TIFS
2010
15 years 4 months ago
2010
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
154
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...