Sciweavers

14 search results - page 2 / 3
» On fairness in simulatability-based cryptographic systems
Sort
View
ICDCS
2006
IEEE
13 years 11 months ago
Fast data access over asymmetric channels using fair and secure bandwidth sharing
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg...
USS
2010
13 years 2 months ago
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic pro...
Sarah Meiklejohn, C. Christopher Erway, Alptekin K...
WWW
2005
ACM
14 years 5 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 3 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
IANDC
2007
152views more  IANDC 2007»
13 years 4 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner