{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T05:53:13Z","timestamp":1774158793857,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T00:00:00Z","timestamp":1547164800000},"content-version":"vor","delay-in-days":1471,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000923","name":"ARC","doi-asserted-by":"publisher","award":["FT0991397"],"award-info":[{"award-number":["FT0991397"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1016\/j.tcs.2014.09.033","type":"journal-article","created":{"date-parts":[[2014,9,21]],"date-time":"2014-09-21T20:34:31Z","timestamp":1411331671000},"page":"57-74","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Optimistic fair exchange in the enhanced chosen-key model"],"prefix":"10.1016","volume":"562","author":[{"given":"Yang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Man Ho","family":"Au","sequence":"additional","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.09.033_br0010","doi-asserted-by":"crossref","unstructured":"N. Asokan, M. Schunter, M. Waidner, Optimistic protocols for fair exchange, in: Proc. 4th ACM Conference on Computer and Communications Security, pp. 8\u201317.","DOI":"10.1145\/266420.266426"},{"key":"10.1016\/j.tcs.2014.09.033_br0020","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/TIFS.2011.2109952","article-title":"Preserving transparency and accountability in optimistic fair exchange of digital signatures","volume":"6","author":"Huang","year":"2011","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.tcs.2014.09.033_br0030","series-title":"Advances in Cryptology \u2013 EUROCRYPT 1998","first-page":"591","article-title":"Optimistic fair exchange of digital signatures","volume":"vol. 1403","author":"Asokan","year":"1998"},{"key":"10.1016\/j.tcs.2014.09.033_br0040","series-title":"Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology","first-page":"331","article-title":"Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes","author":"Camenisch","year":"2000"},{"key":"10.1016\/j.tcs.2014.09.033_br0050","series-title":"Advances in Cryptology \u2013 EUROCRYPT 2003","first-page":"416","article-title":"Aggregate and verifiably encrypted signatures from bilinear maps","volume":"vol. 2656","author":"Boneh","year":"2003"},{"key":"10.1016\/j.tcs.2014.09.033_br0060","series-title":"EUROCRYPT 2006","first-page":"465","article-title":"Sequential aggregate signatures and multisignatures without random oracles","author":"Lu","year":"2006"},{"key":"10.1016\/j.tcs.2014.09.033_br0070","series-title":"Proceedings of the 3rd International Conference on Information Security Practice and Experience","first-page":"65","article-title":"A novel verifiably encrypted signature scheme without random oracle","author":"Zhang","year":"2007"},{"key":"10.1016\/j.tcs.2014.09.033_br0080","series-title":"Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography","first-page":"17","article-title":"Security of verifiably encrypted signatures and a construction without random oracles","author":"R\u00fcckert","year":"2009"},{"key":"10.1016\/j.tcs.2014.09.033_br0090","series-title":"Proceedings of the 3rd ACM Workshop on Digital Rights Management","first-page":"47","article-title":"Breaking and repairing optimistic fair exchange from PODC 2003","author":"Dodis","year":"2003"},{"key":"10.1016\/j.tcs.2014.09.033_br0100","series-title":"Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography","first-page":"118","article-title":"Optimistic fair exchange in a multi-user setting","author":"Dodis","year":"2007"},{"key":"10.1016\/j.tcs.2014.09.033_br0110","series-title":"Proceedings of the 2008 The Cryptopgraphers' Track at the RSA Conference on Topics in Cryptology","first-page":"106","article-title":"Efficient optimistic fair exchange secure in the multi-user setting and chosen-key model without random oracles","author":"Huang","year":"2008"},{"key":"10.1016\/j.tcs.2014.09.033_br0120","doi-asserted-by":"crossref","unstructured":"H. Zhu, W. Susilo, Y. Mu, Multi-party stand-alone and setup-free verifiably committed signatures, in: [29], pp. 134\u2013149.","DOI":"10.1007\/978-3-540-71677-8_10"},{"key":"10.1016\/j.tcs.2014.09.033_br0130","doi-asserted-by":"crossref","unstructured":"B. Barak, R. Canetti, J.B. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in: FOCS'04, pp. 186\u2013195.","DOI":"10.1109\/FOCS.2004.71"},{"key":"10.1016\/j.tcs.2014.09.033_br0140","series-title":"CRYPTO","first-page":"213","article-title":"Identity-based encryption from the Weil pairing","volume":"vol. 2139","author":"Boneh","year":"2001"},{"key":"10.1016\/j.tcs.2014.09.033_br0150","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","article-title":"Short signatures without random oracles and the SDH assumption in bilinear groups","volume":"21","author":"Boneh","year":"2008","journal-title":"J. Cryptology"},{"key":"10.1016\/j.tcs.2014.09.033_br0160","doi-asserted-by":"crossref","unstructured":"X. Boyen, B. Waters, Full-domain subgroup hiding and constant-size group signatures, in: [29], pp. 1\u201315.","DOI":"10.1007\/978-3-540-71677-8_1"},{"key":"10.1016\/j.tcs.2014.09.033_br0170","series-title":"ISPEC","first-page":"257","article-title":"Short convertible undeniable signature in the standard model","volume":"vol. 6672","author":"Huang","year":"2011"},{"key":"10.1016\/j.tcs.2014.09.033_br0180","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/s00145-011-9102-5","article-title":"Programmable hash functions and their applications","volume":"25","author":"Hofheinz","year":"2012","journal-title":"J. Cryptology"},{"key":"10.1016\/j.tcs.2014.09.033_br0190","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1109\/TIFS.2011.2161290","article-title":"Efficient designated confirmer signature and DCS-based ambiguous optimistic fair exchange","volume":"6","author":"Huang","year":"2011","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.tcs.2014.09.033_br0200","series-title":"EUROCRYPT","first-page":"86","article-title":"Designated confirmer signatures","volume":"vol. 950","author":"Chaum","year":"1994"},{"key":"10.1016\/j.tcs.2014.09.033_br0210","series-title":"Proceedings of the 13th ACM Conference on Computer and Communications Security","first-page":"390","article-title":"Multi-signatures in the plain public-key model and a general forking lemma","author":"Bellare","year":"2006"},{"key":"10.1016\/j.tcs.2014.09.033_br0220","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","article-title":"Short signatures from the Weil pairing","volume":"17","author":"Boneh","year":"2004","journal-title":"J. Cryptology"},{"key":"10.1016\/j.tcs.2014.09.033_br0230","series-title":"TCC","first-page":"60","article-title":"Ring signatures: stronger definitions, and constructions without random oracles","volume":"vol. 3876","author":"Bender","year":"2006"},{"key":"10.1016\/j.tcs.2014.09.033_br0240","series-title":"EUROCRYPT","first-page":"114","article-title":"Efficient identity-based encryption without random oracles","volume":"vol. 3494","author":"Waters","year":"2005"},{"key":"10.1016\/j.tcs.2014.09.033_br0250","series-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science","first-page":"543","article-title":"Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security","author":"Sahai","year":"1999"},{"key":"10.1016\/j.tcs.2014.09.033_br0260","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","article-title":"A digital signature scheme secure against adaptive chosen-message attacks","volume":"17","author":"Goldwasser","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2014.09.033_br0270","series-title":"Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology","first-page":"433","article-title":"Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack","author":"Rackoff","year":"1992"},{"key":"10.1016\/j.tcs.2014.09.033_br0280","series-title":"EUROCRYPT","first-page":"210","article-title":"Mesh signatures","volume":"vol. 4515","author":"Boyen","year":"2007"},{"key":"10.1016\/j.tcs.2014.09.033_br0290","series-title":"Public Key Cryptography \u2013 PKC 2007, 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16\u201320, 2007, Proceedings","volume":"vol. 4450","year":"2007"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514007117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514007117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T09:43:10Z","timestamp":1565430190000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514007117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":29,"alternative-id":["S0304397514007117"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.09.033","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimistic fair exchange in the enhanced chosen-key model","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.09.033","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}