Fair offline payment using verifiable encryption

Authors:
Sangjin Kim;Heekuck Oh
Affiliations:
School of Internet Media Eng., Korea Univ. of Technology and Education, Byeoncheonmyeon, Cheonan, Chungnam, Republic of Korea;Department of Computer Science and Engineering, Hanyang University, Kyunggi, Republic of Korea
Venue:
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Year:
2004

Citing 11
Cited 0

Untraceable off-line cash in wallet with observers

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Atomicity in electronic commerce

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Optimistic protocols for fair exchange

Proceedings of the 4th ACM conference on Computer and communications security
A new public key cryptosystem based on higher residues

CCS '98 Proceedings of the 5th 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
Separability and Efficiency for Generic Group Signature Schemes

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Off-Line Fair Payment Protocols Using Convertible Signatures

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
An Efficient Fair Off-Line Electronic Cash System with Extensions to Checks and Wallets with Observers

FC '98 Proceedings of the Second International Conference on Financial Cryptography
Money Conservation via Atomicity in Fair Off-Line E-Cash

ISW '99 Proceedings of the Second International Workshop on Information Security
Optimistic fair exchange of digital signatures

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Verifiable encryption allows a receiver, who cannot decrypt the ciphertext, to verify what has been encrypted. This technique is widely used in fair exchange to convince a receiver that he/she can later obtain the requested item by presenting the item in an encrypted form to a TTP (Trusted Third Party). In this paper, we apply verifiable encryption to offline payment systems based on the representation problem to provide the payment atomicity. Our verifiable encryption uses the Naccache-Stern cryptosystem and a proof of equality of discrete logarithms from different groups. Although additional cost is required during payments, we show that the cost is reasonable. Furthermore, we have improved the efficiency of dispute settlement significantly. In our method, the TTP does not have to interact with any other party other than the one who filed a complaint to resolve disputes.