The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Prenons le cas d'une personne souhaitant chiffrer son testament sur une blockchain existante, par exemple Bitcoin, et permettant qu'un testament crypté ne soit déchiffrable que si les membres désignés travaillent ensemble. À première vue, une telle propriété semble être facilement obtenue en utilisant un chiffrement à seuil conventionnel. Cependant, cette idée ne peut pas être mise en œuvre directement car des paires de clés pour un mécanisme de chiffrement sont également nécessaires. Dans cet article, nous proposons un nouveau schéma de chiffrement à seuil dans lequel les paires de clés pour ECDSA déjà utilisées dans le protocole Bitcoin peuvent être directement utilisées telles quelles. À savoir, une paire de clés unique peut être utilisée simultanément pour ECDSA et notre système de chiffrement à seuil sans perte de sécurité. De plus, nous avons implémenté notre système sur le réseau Bitcoin regtest et montrons qu’il est assez pratique. Par exemple, le temps d'exécution de l'algorithme de chiffrement Enc (resp. l'algorithme de décryptage à seuil Dec) est de 0.2 seconde. (resp., 0.3 seconde), et la durée totale n'est que de 3 secondes. y compris tous les processus cryptographiques et les communications réseau pour un paramétrage typique. Nous discutons également en détail de plusieurs applications de notre système de cryptage à seuil : revendication de la priorité de la propriété intellectuelle, enchères sous pli scellé, loterie et service de tirage au sort.
Goichiro HANAOKA
National Institute of Advanced Industrial Science and Technology (AIST)
Yusuke SAKAI
National Institute of Advanced Industrial Science and Technology (AIST)
Toshiya SHIMIZU
FUJITSU Laboratories Ltd.
Takeshi SHIMOYAMA
FUJITSU Laboratories Ltd.
SeongHan SHIN
National Institute of Advanced Industrial Science and Technology (AIST)
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Goichiro HANAOKA, Yusuke SAKAI, Toshiya SHIMIZU, Takeshi SHIMOYAMA, SeongHan SHIN, "A Setup-Free Threshold Encryption Scheme for the Bitcoin Protocol and Its Applications" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 150-164, January 2020, doi: 10.1587/transfun.2019CIP0018.
Abstract: Let us consider a situation where someone wants to encrypt his/her will on an existing blockchain, e.g. Bitcoin, and allow an encrypted will to be decryptable only if designated members work together. At a first glance, such a property seems to be easily provided by using conventional threshold encryption. However, this idea cannot be straightforwardly implemented since key pairs for an encryption mechanism is additionally required. In this paper, we propose a new threshold encryption scheme in which key pairs for ECDSA that are already used in the Bitcoin protocol can be directly used as they are. Namely, a unique key pair can be simultaneously used for both ECDSA and our threshold encryption scheme without losing security. Furthermore, we implemented our scheme on the Bitcoin regtest network, and show that it is fairly practical. For example, the execution time of the encryption algorithm Enc (resp., the threshold decryption algorithm Dec) is 0.2sec. (resp., 0.3sec.), and the total time is just only 3sec. including all the cryptographic processes and network communications for a typical parameter setting. Also, we discuss several applications of our threshold encryption scheme in detail: Claiming priority of intellectual property, sealed-bid auction, lottery, and coin tossing service.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0018/_p
Copier
@ARTICLE{e103-a_1_150,
author={Goichiro HANAOKA, Yusuke SAKAI, Toshiya SHIMIZU, Takeshi SHIMOYAMA, SeongHan SHIN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Setup-Free Threshold Encryption Scheme for the Bitcoin Protocol and Its Applications},
year={2020},
volume={E103-A},
number={1},
pages={150-164},
abstract={Let us consider a situation where someone wants to encrypt his/her will on an existing blockchain, e.g. Bitcoin, and allow an encrypted will to be decryptable only if designated members work together. At a first glance, such a property seems to be easily provided by using conventional threshold encryption. However, this idea cannot be straightforwardly implemented since key pairs for an encryption mechanism is additionally required. In this paper, we propose a new threshold encryption scheme in which key pairs for ECDSA that are already used in the Bitcoin protocol can be directly used as they are. Namely, a unique key pair can be simultaneously used for both ECDSA and our threshold encryption scheme without losing security. Furthermore, we implemented our scheme on the Bitcoin regtest network, and show that it is fairly practical. For example, the execution time of the encryption algorithm Enc (resp., the threshold decryption algorithm Dec) is 0.2sec. (resp., 0.3sec.), and the total time is just only 3sec. including all the cryptographic processes and network communications for a typical parameter setting. Also, we discuss several applications of our threshold encryption scheme in detail: Claiming priority of intellectual property, sealed-bid auction, lottery, and coin tossing service.},
keywords={},
doi={10.1587/transfun.2019CIP0018},
ISSN={1745-1337},
month={January},}
Copier
TY - JOUR
TI - A Setup-Free Threshold Encryption Scheme for the Bitcoin Protocol and Its Applications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 150
EP - 164
AU - Goichiro HANAOKA
AU - Yusuke SAKAI
AU - Toshiya SHIMIZU
AU - Takeshi SHIMOYAMA
AU - SeongHan SHIN
PY - 2020
DO - 10.1587/transfun.2019CIP0018
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2020
AB - Let us consider a situation where someone wants to encrypt his/her will on an existing blockchain, e.g. Bitcoin, and allow an encrypted will to be decryptable only if designated members work together. At a first glance, such a property seems to be easily provided by using conventional threshold encryption. However, this idea cannot be straightforwardly implemented since key pairs for an encryption mechanism is additionally required. In this paper, we propose a new threshold encryption scheme in which key pairs for ECDSA that are already used in the Bitcoin protocol can be directly used as they are. Namely, a unique key pair can be simultaneously used for both ECDSA and our threshold encryption scheme without losing security. Furthermore, we implemented our scheme on the Bitcoin regtest network, and show that it is fairly practical. For example, the execution time of the encryption algorithm Enc (resp., the threshold decryption algorithm Dec) is 0.2sec. (resp., 0.3sec.), and the total time is just only 3sec. including all the cryptographic processes and network communications for a typical parameter setting. Also, we discuss several applications of our threshold encryption scheme in detail: Claiming priority of intellectual property, sealed-bid auction, lottery, and coin tossing service.
ER -