{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:54:11Z","timestamp":1648857251677},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s11390-007-9009-7","type":"journal-article","created":{"date-parts":[[2007,2,9]],"date-time":"2007-02-09T18:31:12Z","timestamp":1171045872000},"page":"75-78","source":"Crossref","is-referenced-by-count":0,"title":["Relationship Between a Non-Malleable Commitment Scheme and a Modified Selective Decommitment Scheme"],"prefix":"10.1007","volume":"22","author":[{"given":"Hai-Xia","family":"Xu","sequence":"first","affiliation":[]},{"given":"Bao","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,2,14]]},"reference":[{"key":"9009_CR1","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev D, Dwork C, Naor M. Non-malleable cryptography. SIAM J. Computing, 2000, 30: 392\u2013437.","journal-title":"SIAM J. Computing"},{"key":"9009_CR2","doi-asserted-by":"crossref","unstructured":"Di Crescenzo G, Ishai Y, Ostrovsky R. Non-interactive and non-malleable commitment. In Proc. STOC\u201998, Dallas, May 23\u201326, 1998, pp.140\u2013151.","DOI":"10.1145\/276698.276722"},{"key":"9009_CR3","doi-asserted-by":"crossref","unstructured":"Dwork C, Naor M, Reingold O et al. Magic functions. In 40th Annual Symposium on Foundations of Computer Science, New York City, October 17\u201319, 1999, pp.523\u2013534.","DOI":"10.1109\/SFFCS.1999.814626"},{"key":"9009_CR4","doi-asserted-by":"crossref","unstructured":"Canetti R, Fischlin M. Universally composable commitments. In Proc. Crypto\u201901, California, USA, August 19\u201323, 2001, LNCS 2139, pp.19\u201340.","DOI":"10.1007\/3-540-44647-8_2"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9009-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9009-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9009-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:38Z","timestamp":1559399558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9009-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["9009"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9009-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}