Comparing information without leaking it
Communications of the ACM
Smart card-based agents for fair non-repudiation
Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel efficient (t,n) threshold proxy signature scheme
Information Sciences: an International Journal
Usable optimistic fair exchange
Computer Networks: The International Journal of Computer and Telecommunications Networking
An intensive survey of fair non-repudiation protocols
Computer Communications
Fairness in non-repudiation protocols
STM'11 Proceedings of the 7th international conference on Security and Trust Management
An Efficient and Practical (t, n) Threshold Proxy Signature Scheme with Known Signers
Fundamenta Informaticae
An efficient certified email protocol
ISC'07 Proceedings of the 10th international conference on Information Security
Secure peer-to-peer trading for multiplayer games
Proceedings of the 11th Annual Workshop on Network and Systems Support for Games
Fair private set intersection with a semi-trusted arbiter
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
| Hi-index | 754.85 |
Two parties, A and B, want to sign a contract C over a communication network. To do so, they must simultaneously exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in piece-by-piece manner. During such a protocol, one party or another may have a slight advantage; a fair protocol keeps this advantage within acceptable limits. A new protocol is proposed. It is fair in the sense that, at any stage in its execution, the conditional probability that one party cannot commit both parties to the contract given that the other party can, is close to zero. This is true even if A and B have vastly different computing powers and is proved under very weak cryptographic assumptions