Sciweavers

403 search results - page 45 / 81
» An algebra for commitment protocols
Sort
View
EUROCRYPT
2007
Springer
15 years 3 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
TIFS
2010
186views more  TIFS 2010»
14 years 10 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
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...
Guilin Wang
AICT
2007
IEEE
122views Communications» more  AICT 2007»
15 years 1 months ago
Towards Security Analyses of an Identity Federation Protocol for Web Services in Convergent Networks
— We describe a formal approach to the analysis of security aspects of an identity federation protocol for web services in convergent networks. This network protocol was proposed...
Maurice H. ter Beek, Corrado Moiso, Marinella Petr...
JAR
2006
97views more  JAR 2006»
14 years 11 months ago
Decidability Issues for Extended Ping-Pong Protocols
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
Hans Hüttel, Jirí Srba
ATAL
2005
Springer
15 years 5 months ago
Protocol synthesis with dialogue structure theory
Inspired by computational linguistic approaches to annotate the structures that occur in human dialogue, this paper describes a technique which encodes these structures as transfo...
Jarred McGinnis, David Robertson, Christopher Walt...