310 search results - page 28 / 62 » An Efficient Protocol for Fair Secure Two-Party Computation |
ASIACRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...
SEC
2001
14 years 11 months ago
2001
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
EUC
2007
Springer
15 years 1 months ago
2007
Springer
Traditional cryptographic primitives are not supported on low-cost RFID tags since, at most, 4K gates can be devoted to securityrelated tasks. Despite this, there are a vast number...
111
click to vote
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
IJNSEC
2008
14 years 9 months ago
2008
In this paper, we first present a concrete formal protocol design approach, which is based on authentication tests, to create an Efficient and Secure Internet Key Exchange (ESIKE)...