Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Perfect Ambiguous Optimistic Fair Exchange, Yang Wang, Man Ho Allen Au, Willy Susilo
Perfect Ambiguous Optimistic Fair Exchange, Yang Wang, Man Ho Allen Au, Willy Susilo
Faculty of Informatics - Papers (Archive)
Protocol for fair exchange of digital signatures is essential in many applications including contract signing, electronic commerce, or even peer-to-peer file sharing. In such a protocol, two parties, Alice and Bob, would like to exchange digital signatures on some messages in a fair way. It is known that a trusted arbitrator is necessary in the realization of such a protocol. We identify that in some scenarios, it is required that prior to the completion of the protocol, no observer should be able to tell whether Alice and Bob are conducting such an exchange. Consider the following scenario in which Apple …
Efficient Fair Conditional Payments For Outsourcing Computations, Xiaofeng Chen, Jin Li, Willy Susilo
Efficient Fair Conditional Payments For Outsourcing Computations, Xiaofeng Chen, Jin Li, Willy Susilo
Faculty of Informatics - Papers (Archive)
The outsourcing computations in distributed environments suffer from the trust problems between the outsourcer and the workers. All existing solutions only assume the rational lazybut- honest workers. In this paper, we first introduce the rational lazy-and-partially-dishonest workers in the outsourcing computation model. In addition, we propose a new fair conditional payment scheme for outsourcing computation that is only based on traditional electronic cash systems. The proposed construction uses a semitrusted third party T to achieve the fairness and efficiency. However, is only involved in the protocol in the exceptional case, namely in the case of disputes. Moreover, since neither the …
A New Efficient Optimistic Fair Exchange Protocol Without Random Oracles, Qiong Huang, Guomin Yang, Duncan S Wong, Willy Susilo
A New Efficient Optimistic Fair Exchange Protocol Without Random Oracles, Qiong Huang, Guomin Yang, Duncan S Wong, Willy Susilo
Faculty of Informatics - Papers (Archive)
Optimistic fair exchange (OFE) is a kind of protocols to solve the problem of fair exchange between two parties. Most of the previous work on this topic are provably secure in the random oracle model. In this work, we propose a new construction of OFE from another cryptographic primitive, called time capsule signature. The construction is efficient and brings almost no overhead other than the primitive itself. The security of our new construction is based on that of the underlying primitive without relying on the random oracle heuristic. Applying our generic construction to the time capsule signature scheme recently proposed …
Fairness And Capacity Analysis Of Opportunistic Feedback Protocol With Proportional Fair Or Maximum Throughput Scheduling, Hang Li, Qinghua Guo, Licai Fang, Defeng (David) Huang
Fairness And Capacity Analysis Of Opportunistic Feedback Protocol With Proportional Fair Or Maximum Throughput Scheduling, Hang Li, Qinghua Guo, Licai Fang, Defeng (David) Huang
Faculty of Engineering and Information Sciences - Papers: Part A
An opportunistic feedback protocol with maximum throughput (MT) scheduling has been proposed in the literature to achieve multiuser diversity for the downlink transmission of a wireless system, and its system capacity has been analyzed with the assumption that the received signal-to-noise ratios (SNRs) for the users are independent and identically distributed. In this paper, fairness and capacity performances of the opportunistic feedback protocol are analyzed for SNRs with independent but not necessarily identical distributions. In addition to MT scheduling, we also analyze the fairness and capacity performances for proportional fair (PF) scheduling. Compared with MT scheduling, numerical results demonstrate that …