{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:58:53Z","timestamp":1648565933609},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Info. Tech. Dec. Mak."],"published-print":{"date-parts":[[2003,6]]},"abstract":"<jats:p> A timed commitment is an extension to the standard commitment scheme in which there is a forced-open phase for the verifier to open the committed value even without the help of the committer. The first notion of timed commitment was from Boneh and Naor,<jats:sup>2<\/jats:sup> based on the hardness of the best-known algorithm for computing g<jats:sup>(2<jats:sup>n<\/jats:sup>)<\/jats:sup> mod N. We use a different approach to design two new schemes. These two schemes are based upon ElGamal encryption and Pubic Verifiable Secret Sharing (PVSS) respectively. Unlike the original scheme, our schemes can be timed precisely, thus easy to be applied in some short-term schemes. We also discuss the implementation of our schemes in contract-signing schemes. <\/jats:p>","DOI":"10.1142\/s0219622003000616","type":"journal-article","created":{"date-parts":[[2003,5,26]],"date-time":"2003-05-26T08:20:29Z","timestamp":1053937229000},"page":"287-297","source":"Crossref","is-referenced-by-count":0,"title":["NEW EFFICIENT TIMED COMMITMENT SCHEMES"],"prefix":"10.1142","volume":"02","author":[{"given":"WANG","family":"TAO","sequence":"first","affiliation":[{"name":"P.O. Box 126, Information Security Center, Beijing University of Posts &amp; Telecommunications, Beijing  100876, China"}]},{"given":"YI XIAN","family":"YANG","sequence":"additional","affiliation":[{"name":"P.O. Box 126, Information Security Center, Beijing University of Posts &amp; Telecommunications, Beijing  100876, China"}]},{"given":"XIN XIN","family":"NIU","sequence":"additional","affiliation":[{"name":"P.O. Box 126, Information Security Center, Beijing University of Posts &amp; Telecommunications, Beijing  100876, China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"Schneier B.","year":"1996"},{"key":"rf3","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"ElGamal T.","journal-title":"IEEE Trans. Information Theory"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"}],"container-title":["International Journal of Information Technology &amp; Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219622003000616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:10:03Z","timestamp":1565133003000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219622003000616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":3,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,6]]}},"alternative-id":["10.1142\/S0219622003000616"],"URL":"https:\/\/doi.org\/10.1142\/s0219622003000616","relation":{},"ISSN":["0219-6220","1793-6845"],"issn-type":[{"value":"0219-6220","type":"print"},{"value":"1793-6845","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}