DOI QR코드

DOI QR Code

Message Recovery Fair Blind Multi-Signature Scheme Based on Meta-ElGamal Protocol

Meta-ElGamal 기반 메시지 복원 공정 은닉 다중 서명 기법

  • 이형우 (천안대학교 정보통신학부 정보보호 및 전자상거래 연구실)
  • Published : 1999.12.01

Abstract

As the blind signature(10) does not reveal any information about the message or its signature it has been used for preventing the information leakage and 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 nd the payment made 표 the same customer. Therefore we should provide publicly verifiable mechanism if it is required for the judge to trace the blackmailed messages. In this paper we propose a modified blind signature scheme which additionally provides the role of message recovery after analyzing the existing meta-ELGamal scheme(12) suggested by Horster. And we suggest a new fair blind multi-signature scheme based on the oblivious transfer protocol with which a judge can publicly verify its fairness and correctness if needed. Proposed scheme can also applicable to the diverse electronic payment applications.

은닉 서명(10)은 서명장의 신분과 메시지 내용에 대한 정보유출 방지와 함께 익명 성 보장을 위 해 전자 화폐 시스템에 사용되고 있다. 그러나 완전한 익명성은 전자 화폐에 대한 불법적 인 사용 등에 악용될수 있다. 따라서 필요로 하는 경우 특정 신뢰 센터가 전자 화폐에 대한 공정성을 검 증할 수 있어 야 한다. 본 연구에서는 Hoster가 제시한 Meta-ElGamal 기법 (12)을 분석하여 메시지 복 원 기능을 제 공하는 공정 은닉 서명 모델에 대해 고찰하고 메시지 복원 기능을 제공하는 개선된 공정 은 닉 다중서명 기법을 제시한다. 본 연구에서는 제시하는 기법은 불확정 전송 방식의 특성을 사용하여 신 뢰 센터에 의 한 공정 검증 및 확인 기능을 제공하는 다중 서명 방식으로 다양한 전자 화폐 시스템에 적 용 가능하다. As the blind signature(10) does not reveal any information about the message or its signature it has been used for preventing the information leakage and 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 nd the payment made 표 the same customer. Therefore we should provide publicly verifiable mechanism if it is required for the judge to trace the blackmailed messages. In this paper we propose a modified blind signature scheme which additionally provides the role of message recovery after analyzing the existing meta-ELGamal scheme(12) suggested by Horster. And we suggest a new fair blind multi-signature scheme based on the oblivious transfer protocol with which a judge can publicly verify its fairness and correctness if needed. Proposed scheme can also applicable to the diverse electronic payment applications.

Keywords

References

  1. IEEE Transactions on Information Theory on Information Theory v.IT-22 no.6 New directions in cryptography W. Diffie;M. Hellman
  2. Communications of the ACM v.21 no.2 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems R. L. Rivest;A. Shamir;L. Adleman
  3. Advances in Cryptology - Crypto'88, Lecture Notes in Computer Science Untraceable electronic cash D. Chaum;A. Fiat;M. Naor
  4. Technical Report CS-R9323 An Efficient Off-line Electronic Cash System Based on The Representation Problem S. Brands
  5. Advances in Cryptology - Crypto'93, Lecture Notes in Computer Science v.773 Untraeable Off-line Cash in Wallets with Observers S. Brands
  6. Computers and Security v.11 no.6 On blind signatures and perfect crimes B. von Solms;D. Naccache
  7. In Symposium of Distributed Algorithms(SODA) Trustee-based tracing extensions to anonymous cash and the making of anonymous change E. F. Brickell;P. Gemmell, D. Kravitz
  8. Advances in Cryptology - Crypto'86, Lecture Notes in Computer Science v.263 How to prove Yourself: practical solutions of identification and signature problems A. Fiat;A. Shamir
  9. IEEE Transactions on Information Theory v.IT-30 no.4 A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms T. ElGamal
  10. Advances in Cryptology - Crypto'82, Lecture Notes in Computer Science Blind Signatures for Untraceable Payments D. Chaum
  11. Advances in Cryptology - Asiacrypt'94, Lecture Notes in Computer Science Meta Message Recovery and Meta Blind signature schemes based on the discrete logarithm problem and their applications Patrick Horster;Holger Petersen
  12. Proc. 2nd ACM conference on Computer and Communications security Meta-ElGamal signature schemes Patrick Horster;Markus Michels;Holger Petersen
  13. Technical Report TR-94-6-D Efficient blind signature schemes based on the discrete logarithm problem Patrick Horster;Markus Michels;Holger Petersen
  14. Technical Report TR-94-12-F Meta-Multisignature schemes based on the discrete logarithm problem Patrick Horster;Markus Michels;Holger Petersen
  15. Technical Reports TR-81 How to exchange secrets by oblivious transfer M. Rabin
  16. Advances in Cryptology - Crypto 89, Lecture Notes in Computer Science v.435 Non-Interactive Oblivious Transfer and Applications Mihir Bellare;Silvio Micali
  17. Technical Reports MIT/LCS/TR-579-b Fair Cryptosystems S. Micali
  18. Advances in Cryptology - Eurocrypt'95, Lecture Notes in Computer Science v.921 Fair Blind Signature Markus Stadler;Jean-Marc Piveteau;Jan Camenisch
  19. Advances in Cryptology - Eurocrypt'94, Lecture Notes in Computer Science v.875 An Efficient Electronic Payment System Protecting Privacy Jan Camenisch;Jean-Marc Piveteau;Markus Stadler
  20. IBM Technical Report RZ 2973 Optimistic Fair Exchange of Digital Signature N. Asokan;Victor Shoup;Michael Waidner
  21. Technical Report LIENS-97-7 Efficient Scalable Fair Cash with Off-line Extortion Prevention Holger Petersen;Guillaume Poupard
  22. Advances in Cryptology - Eurocrypt'96, Lecture Notes in Computer Science Publicly Verifiable Secret Sharing Markus Stadler
  23. Handbook of Applied Cryptography Alfred J. Menezed;Paul C. van Oorschot;Scott A. Vanstone
  24. 1st ACM Conference on Computer and Communication Security A New Signature Scheme Based on the DSA Giving Message Recovery K. Nyberg;R.A. Rueppel