5476 search results - page 120 / 1096 » Resettably Secure Computation |
135
click to vote
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
138
click to vote
ESORICS
2009
Springer
16 years 4 months ago
2009
Springer
We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this...
137
click to vote
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
152
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
104
click to vote
SAC
2008
ACM
15 years 3 months ago
2008
ACM
How humans behave when faced with a disaster, natural or man-made, can be exploited automatically by news-aware malicious software. We introduce weather worms, worms that can auto...