1612 search results - page 69 / 323 » About models of security protocols |
151
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
157
Voted
PKC
2010
Springer
15 years 7 months ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
104
Voted
IEEEHPCS
2010
15 years 2 months ago
2010
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
112
click to vote
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
132
Voted
MSWIM
2005
ACM
15 years 9 months ago
2005
ACM
Motivated by the tradeoff between security and efficiency performance parameters that has been imposed on all modern wireless security protocols, we designed a novel security syst...