{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T08:00:27Z","timestamp":1696060827417},"reference-count":33,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1587\/transfun.2019cip0018","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T22:06:04Z","timestamp":1577829964000},"page":"150-164","source":"Crossref","is-referenced-by-count":1,"title":["A Setup-Free Threshold Encryption Scheme for the Bitcoin Protocol and Its Applications"],"prefix":"10.1587","volume":"E103.A","author":[{"given":"Goichiro","family":"HANAOKA","sequence":"first","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"SAKAI","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiya","family":"SHIMIZU","sequence":"additional","affiliation":[{"name":"FUJITSU Laboratories Ltd."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"SHIMOYAMA","sequence":"additional","affiliation":[{"name":"FUJITSU Laboratories Ltd."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SeongHan","family":"SHIN","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), ANSI X9.62, November 2005."},{"key":"2","unstructured":"[2] A.M. Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies, O'Reilly, 2014."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Boneh, X. Boyen, and S. Halevi, \u201cChosen ciphertext secure public key threshold encryption without random oracles,\u201d CT-RSA 2006, pp.226-243, Springer, 2006. 10.1007\/11605805_15","DOI":"10.1007\/11605805_15"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] M. Blaze, G. Bleumer, and M. Strauss, \u201cDivertible protocols and atomic proxy cryptography,\u201d EUROCRYPT'98, pp.127-144, Springer, 1998. 10.1007\/bfb0054122","DOI":"10.1007\/BFb0054122"},{"key":"5","unstructured":"[5] Bitcoin Core version 0.15.1 released, https:\/\/bitcoin.org\/en\/release\/v0.15.1"},{"key":"6","unstructured":"[6] Bitcoin Developer Examples, https:\/\/bitcoin.org\/en\/developer-examples#testing-applications"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] G.R. Blakley, \u201cSafeguarding cryptographic keys,\u201d AFIPS National Computer Conference, pp.313-317, 1979. 10.1109\/mark.1979.8817296","DOI":"10.1109\/MARK.1979.8817296"},{"key":"8","unstructured":"[8] BLOCKCHAIN, https:\/\/blockchain.info\/"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for designing efficient protocols,\u201d CCS'93, pp.62-73, ACM, 1993. 10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] D.R.L. Brown, \u201cGeneric groups, collision resistance, and ECDSA,\u201d Designs, Codes and Cryptography, vol.35, no.1, pp.119-152, 2005. 10.1007\/s10623-003-6154-z","DOI":"10.1007\/s10623-003-6154-z"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R. Canetti and S. Hohenberger, \u201cChosen-ciphertext secure proxy re-encryption,\u201d CCS 2007, pp.185-194, ACM, 2007. 10.1145\/1315245.1315269","DOI":"10.1145\/1315245.1315269"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] J.H. Cheon, N. Hopper, Y. Kim, and I. Osipkov, \u201cProvably secure timed-release public key encryption,\u201d ACM Trans. Inf. Syst. Secur., vol.11, no.2, 2008. 10.1145\/1330332.1330336","DOI":"10.1145\/1330332.1330336"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J. Cathalo, B. Libert, and J.-J. Quisquater, \u201cEfficient and non-interactive timed-release encryption,\u201d ICICS 2005, pp.291-303, Springer, 2005. 10.1007\/11602897_25","DOI":"10.1007\/11602897_25"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] R. Cramer and V. Shoup, \u201cDesign and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack,\u201d SIAM J. Comput., vol.33, no.1, pp.167-226, 2004. 10.1137\/s0097539702403773","DOI":"10.1137\/S0097539702403773"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[16] Y. Dodis and J. Katz, \u201cChosen-ciphertext security of multiple encryption,\u201d TCC 2005, pp.188-209, Springer, 2005. 10.1007\/978-3-540-30576-7_11","DOI":"10.1007\/978-3-540-30576-7_11"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[17] J.P. Degabriele, A. Lehmann, K.G. Paterson, N.P. Smart, and M. Strefler, \u201cOn the joint security of encryption and signature in EMV,\u201d CT-RSA 2012, pp.116-135, Springer, 2012. 10.1007\/978-3-642-27954-6_8","DOI":"10.1007\/978-3-642-27954-6_8"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[18] C. Delerablee and D. Pointcheval, \u201cDynamic threshold public-key encryption,\u201d CRYPTO 2008, pp.317-334, Springer, 2008. 10.1007\/978-3-540-85174-5_18","DOI":"10.1007\/978-3-540-85174-5_18"},{"key":"18","unstructured":"[19] Digital Signature Standard (DSS), FIPS PUB 186-4, July 2013. https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"key":"19","unstructured":"[20] Secure Hash Standard (SHS), FIPS PUB 180-4, Aug. 2015. https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.180-4.pdf"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[21] A. Fiat and A. Shamir, \u201cHow to prove yourself: Practical solutions to identification and signature problems,\u201d CRYPTO'86, pp.186-194, Springer, 1986. 10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"21","unstructured":"[22] Hashing to Elliptic Curves, IETF Internet-Draft, July 2018. https:\/\/tools.ietf.org\/html\/draft-irtf-cfrg-hash-to-curve-01"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[23] B. Libert and M. Yung, \u201cAdaptively secure non-interactive threshold cryptosystems,\u201d Theor. Comput. Sci., vol.478, pp.76-100, 2013. 10.1016\/j.tcs.2013.01.001","DOI":"10.1016\/j.tcs.2013.01.001"},{"key":"23","unstructured":"[24] T. May, Timed-Release Crypto, manuscript, 1993."},{"key":"24","unstructured":"[25] M. Mambo and E. Okamoto, \u201cProxy cryptosystems: Delegation of the power to decrypt ciphertexts,\u201d IEICE Trans. Fundamentals, vol.E80-A, no.1, pp.54-63, 1997."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[26] U. Maurer and S. Wolf, \u201cLower bounds on generic algorithms in groups,\u201d EUROCRYPT'98, pp.72-84, Springer, 1998. 10.1007\/bfb0054118","DOI":"10.1007\/BFb0054118"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[27] D. Pointcheval and J. Stern, \u201cSecurity proofs for signature schemes,\u201d EUROCRYPT'96, pp.387-398, Springer, 1996. 10.1007\/3-540-68339-9_33","DOI":"10.1007\/3-540-68339-9_33"},{"key":"27","unstructured":"[28] Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA), IETF RFC 6979, Aug. 2013. https:\/\/tools.ietf.org\/html\/rfc6979"},{"key":"28","unstructured":"[29] R.L. Rivest, A. Shamir, and D.A. Wagner, Time-lock Puzzles and Timed-release Crypto, MIT, 1996."},{"key":"29","unstructured":"[30] SEC 2: Recommended Elliptic Curve Domain Parameters, Standards for Efficient Cryptography, Jan. 2010. http:\/\/www.secg.org\/sec2-v2.pdf"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[31] Y. Sakai, K. Emura, J.C.N. Schuldt, G. Hanaoka, and K. Ohta, \u201cConstructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency,\u201d Theor. Comput. Sci., vol.630, pp.95-116, 2016. 10.1016\/j.tcs.2016.04.003","DOI":"10.1016\/j.tcs.2016.04.003"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[32] V. Shoup and R. Gennaro, \u201cSecuring threshold cryptosystems against chosen ciphertext attack,\u201d J. Cryptol., voo.15, no.2, pp.75-96, 2002. 10.1007\/s00145-001-0020-9","DOI":"10.1007\/s00145-001-0020-9"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[33] A. Shamir, \u201cHow to share a secret,\u201d Commun. ACM, vol.22, no.11, pp.612-613, 1979. 10.1145\/359168.359176","DOI":"10.1145\/359168.359176"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[34] V. Shoup, \u201cLower bounds for discrete logarithms and related problems,\u201d EUROCRYPT'97, pp.256-266, Springer, 1997. 10.1007\/3-540-69053-0_18","DOI":"10.1007\/3-540-69053-0_18"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/1\/E103.A_2019CIP0018\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T05:25:24Z","timestamp":1578288324000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/1\/E103.A_2019CIP0018\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2019cip0018","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}