Abstract
As the blind signature introduced by Chaum [10] does not reveal any information about the message or its signature, it has been used for providing the anonymity in secure electronic payment systems. Unfortunately, this perfect anonymity could be misused by criminals as blind signatures prevent linking the withdrawal of money and the payment made by the same customer. Therefore, we should provide publicly verifiable mechanism if it is required for the judge to trace the blackmailed messages. In this study, we propose a modified fair blind signature, which additionally provides the role of message recovery. After analyzing the existing meta-ElGamal scheme [12] suggested by Horster, the model of message recovery blind signature is considered at first. And we suggest a new fair blind signature based on the oblivious transfer protocol, with which a judge can verify its fairness. Proposed scheme can be advanced into the blind multi-signature and it is also applicable to the diverse payment applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Diffie, M. Hellman: New Directions in Cryptography, IEEE Transactions on Information Theory, Vol. IT-22, No. 6, (1976) 472–492
R. L. Rivest, A. Shamir, L. Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communication of the ACM, Vol. 21, No. 2, (1978) 120–126
D. Chaum, A. Fiat, M. Noar: Untraceable Electronic Cash, Advances in Cryptology-Crypto’88, Lecture Notes in Computer Science, Springer-Verlag, (1990) 319–327
S. Brands: An Efficient Off-line Electronic Cash System Based on the Representation Problem, Technical Report CS-R9323, CWI, (1993)
S. Brands.: Untraceable Off-line Cash in Wallets with Observers, Advances in Cryptology-Cryptology’93, Lecture Notes in Computer Science, Vol. 773, Springer-Verlag, (1994)
B. von Solms, D. Naccache: On Blind Signatures and Perfect Crimes, Computers ans Security, Vol. 11, No. 6, (1992) 581–583
E. F. Brickell, P. Gemmell, D. Kravitz: Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change, Symposium of Distributed Algorithms (SODA), (1995)
A. Fiat, A. Shamir: How to Prove Yourself: Practical Solutions of Identification and Signature Problems, Advances in Cryptology-Crypto’86, Lecture Notes in Computer Science, Vol. 263, Springer-Verlag, (1987)
T. ElGamal: A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithm, IEEE Transactions on Information Theory, Vol. IT-30, No. 4, (1985) 469–472
D. Chaum: Blind Signature for Untraceable Payments, Advances in Cryptology-Crypto’82, Lecture Notes in Computer Science, Springer-Verlag, (1982) 199–203
Patrick Horster, Holger Petersen: Meta Message Recovery and Meta Blind Signature Scheme Based on the Discrete Logarithm Problem and Their Applications, Advances in Cryptology-Asiacrypt’94, Lecture Notes in Computer Science, Springer-Verlag, (1994)
Patrick Horster, Markus Michels, Holger Petersen: Meta-ElGamal Signature Schemes, Proc. 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, (1994)
Patrick Horster, Markus Michels, Holger Petersen: Efficient Blind Signature Scheme based on the Discrete Logarithm Problem, Technical Report TR-94-6-D,University of Technology Chemnitz-Zwichau,Dept. of Computer Science, (1994)
Patrick Horster, Markus Michels, Holger Petersen: Meta-Multisignature Scheme based on the Discrete Logarithm Problem, Technical Report TR-94-12-F, University of Technology Chemnitz-Zwichau, Dept. of Computer Science, (1994)
M. Rabin: How to Exchange Secrets by Oblivious Transfer, Technical Reports TR-81, Harvard Aiken Computation Laboratory, (1981)
Mihir Bellare, Silvio Micali: Non-Interactive Oblivious Transfer and Applications, Advances in Cryptology-Crypto’89, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, (1989)
S. Micali: Fair Cryptosystems, Technical Reports MIT/LCS/TR-579-b, (1993)
Markus Stadler, Jean-Marc Piveteau, Jan Camenisch: Fair Blind Signature, Advances in Cryptology-Eurocrypt’95, Lecture Notes in Computer Science, Vol. 921, Springer-Verlag, (1995)
Jan Camenisch, Jean-Marc Piveteau, Markus Stadler: An Efficient Electronic Payment System Protecting Privacy, Advances in Cryptology-Eurocrypt’94, Lecture Notes in Computer Science, Vol. 875, Springer-Verlag, (1994)
N. Asokan, Victor shoup, Michael Waidner: Optimistic Fair Exchange of Digital Signature, IBM Technical Report RZ 2973. (1997)
Holger Petersen, Guillaume Poupard: Efficient Scalable Fair Cash with Off-line Extortion Prevention, Technical Report LIENS-97-7, (1997)
Markus Stadler: Publicly Verifiable Secret Sharing, Advances in Cryptology-Eurocrypt’96, Lecture Notes in Computer Science, Springer-Verlag, (1995) 190–199
Alfred J. Menezed, Paul C. van Oorschot, Scott A. Vanstone (nted.): Handbook of Applied Cryptography, CRC Press. (1996)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, H.W., Kim, T.Y. (1999). Message Recovery Fair Blind Signature. In: Public Key Cryptography. PKC 1999. Lecture Notes in Computer Science, vol 1560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49162-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-49162-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65644-9
Online ISBN: 978-3-540-49162-0
eBook Packages: Springer Book Archive