Efficiency of optimistic fair exchange using trusted devices

Authors:
Mohammad Torabi Dashti
Affiliations:
ETH Zürich, Switzerland, Zuerich, Switzerland
Venue:
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
Year:
2012

Citing 14
Cited 0

Reasoning about knowledge

Reasoning about knowledge
Atomicity in electronic commerce

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Optimal efficiency of optimistic contract signing

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fairness in electronic commerce

Fairness in electronic commerce
Using Smart Cards for Fair Exchange

WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Simple and fast optimistic protocols for fair electronic exchange

Proceedings of the twenty-second annual symposium on Principles of distributed computing
A Family of Trusted Third Party Based Fair-Exchange Protocols

IEEE Transactions on Dependable and Secure Computing
Introduction to Reliable Distributed Programming

Introduction to Reliable Distributed Programming
Digital-ticket-controlled digital ticket circulation

SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
Minimal Message Complexity of Asynchronous Multi-party Contract Signing

CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
Handbook of Financial Cryptography and Security

Handbook of Financial Cryptography and Security
TrustedPals: secure multiparty computation implemented with smart cards

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Tracing traitors

IEEE Transactions on Information Theory
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficiency of asynchronous optimistic fair exchange using trusted devices is studied. It is shown that three messages in the optimistic subprotocol are sufficient and necessary for exchanging idempotent items. When exchanging nonidempotent items, however, three messages in the optimistic subprotocol are sufficient only under the assumption that trusted devices have unbounded storage capacity. This assumption is often not satisfiable in practice. It is then proved that exchanging nonidempotent items using trusted devices with a bounded storage capacity requires exactly four messages in the optimistic subprotocol.