403 search results - page 37 / 81 » Secure Protocols with Asymmetric Trust |
JOC
2008
13 years 8 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
ESORICS
2010
Springer
13 years 9 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
JOC
2000
13 years 8 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Threshold cryptosystems and signature schemes give ways to distribute trust throughout a group and increase the availability of cryptographic systems. A standard approach in design...
WIMOB
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Most contemporary security mechanisms and protocols include exchange of random or time-variant nonces as an essential means of protection against replay and other threat...