Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Customers are usually passive in an electronic commerce transaction. Based on a new two times concurrent signature, this article presents a fair electronic payment (E-payment) pro...
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...