Earticle

초록

영어

Divisible e-cash allows the user to withdraw a single divisible coin and spends the any sub-coins by dividing the value of the coin. The first divisible e-cash system in the standard model was proposed by Izabachene and Libert. However, the efficiency of the spending protocol and the deposit protocol is very low. In this paper, we construct an efficient divisible e-cash scheme without random oracle by using the Groth-Sahai (GS) proof system and bound accumulators. Our scheme is on-line and truly anonymous without a trusted third party. Comparing to Izabachene and Libert's work, we improve the efficiency of the spending protocol and deposit protocol by introducing a new generational algorithm. Moreover, the bank only needs to look up the coin's serial number in a table of previously spent coins. We give the NIZK proofs of bounded accumulator in the standard model. Some security properties of our scheme, such as anonymity, unforgeability and exculpability, are proved in the standard model.

목차

Abstract
 1. INTRODUCTION
 2. Preliminaries
  2.1 Mathematical Definitions and Assumptions
  2.2. Useful Tools
  2.3. Algorithms
  2.4. Security Notions
 3. Construction of Divisible E-Cash
  3.1. Bounded Accumulators
  3.2. New Binary Tree Structure
  3.3. Construction
 4. Efficiency Analysis
 5. Security Analysis
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Huo Yanling [ Department of Information Engineering, Xingtai Polytechnic College, Xingtai, Hebei, China ]
• Wang Haibin [ Department of Information Engineering, Xingtai Polytechnic College, Xingtai, Hebei, China ]
• Chai Xuguang [ Department of Information Engineering, Xingtai Polytechnic College, Xingtai, Hebei, China ]
• Liu Xia [ Department of Information Science and Technology, Xingtai University, Xingtai, Hebei, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605