12 0

Fair Offline Payment Using Verifiable Encryption

Title
Fair Offline Payment Using Verifiable Encryption
Author
오희국
Keywords
Signature Scheme; Discrete Logarithm; Blind Signature; Dispute Settlement; Fair Exchange
Issue Date
2005-03
Publisher
SPRINGER-VERLAG BERLIN
Citation
International Workshop on Information Security Applications; WISA 2004: Information Security Applications, Page. 286-301
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.
URI
https://link.springer.com/chapter/10.1007/978-3-540-31815-6_24http://repository.hanyang.ac.kr/handle/20.500.11754/110312
ISBN
978-3-540-24015-0
DOI
10.1007/978-3-540-31815-6_24
Appears in Collections:
COLLEGE OF COMPUTING[E] > COMPUTER SCIENCE(소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE