New protocols for third-party-based authentication and secure broadcast
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
How to simultaneously exchange secrets by general assumptions
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Fair exchange with a semi-trusted third party (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A Fair-exchange E-commerce Protocol with Automated Dispute Resolution
Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions
Secure Group Barter: Multi-party Fair Exchange with Semi-Trusted Neutral Parties
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Modular Fair Exchange Protocols for Electronic Commerce
ACSAC '99 Proceedings of the 15th Annual Computer Security Applications Conference
Multi-Party Fair Exchange with an Off-Line Trusted Neutral Party
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
An agent-mediated fair exchange protocol
ICICS'10 Proceedings of the 12th international conference on Information and communications security
| Hi-index | 0.00 |
This paper aims to propose a solution to unify different approaches to fair document exchange for the development of a flexible, general and secure fair document exchange system capable of guaranteeing strong fairness. The solution caters for a document exchange among any number of parties under various situations. At the heart of this unified solution are methods for a verifiable and recoverable encryption of a symmetric (or conventional) key for document encryption and decryption in a simple and efficient manner. The verifiability means that any party can verify the correctness of a key encrypted without actually viewing the key, and the recoverability implies that the party can be assured that a designated party or a group of designated parties can decrypt the encrypted key to recover the original key. These methods are essential for the unified solution to achieve strong fairness. The main novel contribution of the work presented in this paper is that the proposed unified solution represents the first effort on providing an efficient and unified approach to achieving strong fairness in document exchange under various situations.