{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:53:57Z","timestamp":1740174837980,"version":"3.37.3"},"reference-count":20,"publisher":"Wiley","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Applied Basic and Advanced Technology Research Programs of Tianjin","award":["15JCYBJC15900"],"award-info":[{"award-number":["15JCYBJC15900"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Information Systems"],"published-print":{"date-parts":[[2016]]},"abstract":"In a popular electronic cash scheme, there are three participants: the bank, the customer, and the merchant. First, a customer opens an account in a bank. Then, he withdraws ane<\/mml:mi><\/mml:mrow><\/mml:math>-cash from his account and pays it to a merchant. After checking the electronic cash\u2019s validity, the merchant accepts it and deposits it to the bank. There are a number of requirements for an electronic cash scheme, such as, anonymity, unforgeability, unreusability, divisibility, transferability, and portability. Anonymity property of electronic cash schemes can ensure the privacy of payers. However, this anonymity property is easily abused by criminals. In 2011, Chen et al. proposed a novel electronic cash system with trustee-based anonymity revocation from pairing. On demand, the trustee can disclose the identity fore<\/mml:mi><\/mml:mrow><\/mml:math>-cash. But, in this paper we point out that Chen et al.\u2019s scheme is subjected to some drawbacks. To contribute secure electronic cash schemes, we propose a new offline electronic cash scheme with anonymity revocation. We also provide the formally security proofs of the unlinkability and unforgeability. Furthermore, the proposed scheme ensures the property of avoiding merchant frauds.<\/jats:p>","DOI":"10.1155\/2016\/2620141","type":"journal-article","created":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T17:02:09Z","timestamp":1461690129000},"page":"1-10","source":"Crossref","is-referenced-by-count":4,"title":["Secure Electronic Cash Scheme with Anonymity Revocation"],"prefix":"10.1155","volume":"2016","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2672-3958","authenticated-orcid":true,"given":"Baoyuan","family":"Kang","sequence":"first","affiliation":[{"name":"School of Computer Science and Software, Tianjin Polytechnic University, Tianjin 300387, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danhui","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Software, Tianjin Polytechnic University, Tianjin 300387, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"first-page":"199","volume-title":"Blind signatures for untraceable payments","year":"1983","key":"1"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2010.08.002"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62494-5_4"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63594-7_63"},{"first-page":"461","volume-title":"Fair electronic cash based on a group signature scheme","year":"2001","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/6.570825"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_18"},{"first-page":"302","volume-title":"Untraceable off-line cash in wallet with observers","year":"1994","key":"9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.09.015"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2004.05.008"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2005.12.001"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.scient.2013.05.002"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2011.06.002"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2012.04.003"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2012.06.005"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2012.07.012"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.11.006"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2011.01.004"},{"key":"18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-36492-7_20","volume-title":"Efficient identity based signature schemes based on pairings","volume":"2595","year":"2003"},{"key":"19","series-title":"Lecture Notes in Computer Science","first-page":"312","volume-title":"Efficient ID-based blind signature and proxy signature from bilinear pairings","year":"2003"}],"container-title":["Mobile Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2016\/2620141.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2016\/2620141.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2016\/2620141.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T07:49:59Z","timestamp":1498290599000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/misy\/2016\/2620141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":20,"alternative-id":["2620141","2620141"],"URL":"https:\/\/doi.org\/10.1155\/2016\/2620141","relation":{},"ISSN":["1574-017X","1875-905X"],"issn-type":[{"type":"print","value":"1574-017X"},{"type":"electronic","value":"1875-905X"}],"subject":[],"published":{"date-parts":[[2016]]}}}