Fairness in non-repudiation protocols

Authors:
Wojciech Jamroga;Sjouke Mauw;Matthijs Melissen
Affiliations:
Computer Science and Communication, University of Luxembourg, Luxembourg;Computer Science and Communication, University of Luxembourg, Luxembourg;Computer Science and Communication, University of Luxembourg, Luxembourg
Venue:
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Year:
2011

Citing 20
Cited 0

Receipt-free secret-ballot elections (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Avoiding loss of fairness owing to failures in fair data exchange systems

Decision Support Systems
Alternating-time temporal logic

Journal of the ACM (JACM)
Abuse-Free Multi-party Contract Signing

Proceedings of the 13th International Symposium on Distributed Computing
A Multi-party Optimistic Non-repudiation Protocol

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
MOCHA: Modularity in Model Checking

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Intensional specifications of security protocols

CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
A Hierarchy of Authentication Specifications

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
An Efficient Non-repudiation Protocol

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A game-based verification of non-repudiation and fair exchange protocols

Journal of Computer Security - IFIP 2000
Coercion-Resistance and Receipt-Freeness in Electronic Voting

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Formal Analysis of Multiparty Contract Signing

Journal of Automated Reasoning
Injective synchronisation: an extension of the authentication hierarchy

Theoretical Computer Science - Automated reasoning for security protocol analysis
Agents that Know How to Play

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Fair multi-party contract signing using private contract signatures

Information and Computation
Alpaga: A Tool for Solving Parity Games with Imperfect Information

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
MCMAS: A Model Checker for the Verification of Multi-Agent Systems

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Secure ownership and ownership transfer in RFID systems

ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Game-based verification of multi-party contract signing protocols

FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
A fair protocol for signing contracts

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We indicate two problems with the specifications of fairness that are currently used for the verification of non-repudiation and other fair-exchange protocols. The first of these problems is the implicit assumption of perfect information. The second problem is the possible lack of effectiveness. We solve both problems in isolation by giving new definitions of fairness, but leave the combined solution for further work. Moreover, we establish a hierarchy of various definitions of fairness, and indicate the consequences for existing work.