Optimizing One Fair Document Exchange Protocol
Abdullah M. Alaraj

TL;DR
This paper introduces a new, efficient fair document exchange protocol that ensures verifiable and recoverable encryption of document keys, involving minimal messaging and enhanced trust enforcement.
Contribution
It proposes a novel three-message protocol based on verifiable recoverable encryption, improving efficiency and trust enforcement over existing methods.
Findings
Protocol is more efficient than related protocols.
Ensures verifiable and recoverable encryption of document keys.
Involves only three messages for the exchange.
Abstract
This paper presents an efficient fair document exchange protocol. The exchange of the documents will be between two parties. The protocol is based on the verifiable and recoverable encryption of a document's key. This verifiable and recoverable encryption of the document's key will allow one party to verify the encrypted key. It will also ensure this party that the Semi Trusted Third Party will be able to recover the key if the other party misbehaves. The protocol also incorporates the concept of enforcing the honesty of one party. The proposed protocol consists of only three messages and is more efficient than related protocols.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
