Sciweavers

71 search results - page 13 / 15
» Round-Optimal Secure Two-Party Computation
Sort
View
EUROPKI
2006
Springer
13 years 10 months ago
On the Resilience of Key Agreement Protocols to Key Compromise Impersonation
Abstract. Key agreement protocols are a fundamental building block for ensuring authenticated and private communications between two parties over an insecure network. This paper fo...
Maurizio Adriano Strangio
WWW
2005
ACM
14 years 7 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
TIFS
2010
186views more  TIFS 2010»
13 years 4 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
EUROCRYPT
2009
Springer
14 years 6 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
CCS
2005
ACM
13 years 11 months ago
Automated trust negotiation using cryptographic credentials
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
Jiangtao Li, Ninghui Li, William H. Winsborough