Optimal efficiency of optimistic contract signing
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Some guidelines for non-repudiation protocols
ACM SIGCOMM Computer Communication Review
Security Analysis of a Probabilistic Non-repudiation Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Evolution of Fair Non-repudiation with TTP
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
A Practical English Auction with One-Time Registration
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
An Equitably Fair On-line Auction Scheme
EC-WEB '00 Proceedings of the First International Conference on Electronic Commerce and Web Technologies
An Asymmetric Traceability Scheme for Copyright Protection without Trust Assumptions
EC-Web 2001 Proceedings of the Second International Conference on Electronic Commerce and Web Technologies
A Multi-party Optimistic Non-repudiation Protocol
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
An Optimistic Multi-party Fair Exchange Protocol with Reduced Trust Requirements
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Mechanical Proofs about a Non-repudiation Protocol
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Using Smart Cards for Fair Exchange
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Selective Receipt in Certified E-mail
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Efficient Fair Exchange with Verifiable Confirmation of Signatures
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Optimistic Fair Exchange with Transparent Signature Recovery
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Exploring Fair Exchange Protocols Using Specification Animation
ISW '00 Proceedings of the Third International Workshop on Information Security
An Efficient Protocol for Certified Electronic Mail
ISW '00 Proceedings of the Third International Workshop on Information Security
Efficient Optimistic N-Party Contract Signing Protocol
ISC '01 Proceedings of the 4th International Conference on Information Security
An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party
ISC '01 Proceedings of the 4th International Conference on Information Security
A Realistic Protocol for Multi-party Certified Electronic Mail
ISC '02 Proceedings of the 5th International Conference on Information Security
Exclusion-Freeness in Multi-party Exchange Protocols
ISC '02 Proceedings of the 5th International Conference on Information Security
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Supporting fair exchange in mobile environments
Mobile Networks and Applications - Security in mobile computing environments
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Certified E-Mail Delivery with DSA Receipts
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18
A transactional-cycle approach to evidence management for dispute resolution
Information and Management
ACM SIGOPS Operating Systems Review
A fair and secure mobile billing system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Computer Security - Special issue on security track at ACM symposium on applied computing 2004
Generic non-repudiation protocols supporting transparent off-line TTP
Journal of Computer Security - On IWAP'05
Smart card-based agents for fair non-repudiation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Providing Certified Mail Services on the Internet
IEEE Security and Privacy
Exclusions and related trust relationships in multi-party fair exchange protocols
Electronic Commerce Research and Applications
An optimistic fair exchange protocol and its security in the universal composability framework
International Journal of Applied Cryptography
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Multiparty nonrepudiation: A survey
ACM Computing Surveys (CSUR)
A Fair Mobile Payment Protocol
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Generic Fair Non-Repudiation Protocols with Transparent Off-line TTP
Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
Fair Threshold Decryption with Semi-Trusted Third Parties
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Mean Value Analysis for a Class of PEPA Models
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Some common attacks against certified email protocols and the countermeasures
Computer Communications
A fair and secure mobile billing system
Computer Networks: The International Journal of Computer and Telecommunications Networking
A secure on-line software transaction scheme
Computer Standards & Interfaces
Specification and Verification of Protocols With Time Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Robust and efficient incentives for cooperative content distribution
IEEE/ACM Transactions on Networking (TON)
Testing a probabilistic FSM using interval estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
On fairness in exchange protocols
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Fair threshold decryption with semi-trusted third parties
International Journal of Applied Cryptography
Design and implementation of an inline certified e-mail service
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Generic, optimistic, and efficient schemes for fair certified email delivery
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Towards verification of timed non-repudiation protocols
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Synthesizing protocols for digital contract signing
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Fairness in non-repudiation protocols
STM'11 Proceedings of the 7th international conference on Security and Trust Management
| Hi-index | 0.00 |
Fairness may be a desirable property of a non-repudiation service. Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary between protocols. Hence, one of the goals of designing an efficient non-repudiation protocol is to reduce the work load of the trusted third party. In this paper we present a variant of our fair non-repudiation protocol which appeared at the 1996 IEEE Symposium on Security and Privacy, where the trusted third party will be involved only in case that one party cannot obtain the expected non-repudiation evidence from the other party. This variant is efficient in an environment where the two parties are likely to resolve communications problems between themselves.