The search functionality is under construction.

The search functionality is under construction.

The concept of threshold public key encryption (TPKE) with the special property called key re-splittability (re-splittable TPKE, for short) was introduced by Hanaoka et al. (CT-RSA 2012), and used as one of the building blocks for constructing their proxy re-encryption scheme. In a re-splittable TPKE scheme, a secret key can be split into a set of secret key shares not only once, but also multiple times, and the security of the TPKE scheme is guaranteed as long as the number of corrupted secret key shares under the same splitting is smaller than the threshold. In this paper, we show several new constructions of a re-splittable TPKE scheme by extending the previous (ordinary) TPKE schemes. All of our proposed schemes are based on discrete logarithm (DL)-type assumptions. Therefore, our results suggest that key re-splittability is a very natural property for DL-type TPKE schemes.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.9 pp.1473-1483

- Publication Date
- 2018/09/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E101.A.1473

- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

- Category

Satsuya OHATA

National Institute of Advanced Industrial Science and Technology (AIST)

Takahiro MATSUDA

National Institute of Advanced Industrial Science and Technology (AIST)

Goichiro HANAOKA

National Institute of Advanced Industrial Science and Technology (AIST)

Kanta MATSUURA

The University of Tokyo

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.

Copy

Satsuya OHATA, Takahiro MATSUDA, Goichiro HANAOKA, Kanta MATSUURA, "More Constructions of Re-Splittable Threshold Public Key Encryption" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1473-1483, September 2018, doi: 10.1587/transfun.E101.A.1473.

Abstract: The concept of threshold public key encryption (TPKE) with the special property called key re-splittability (re-splittable TPKE, for short) was introduced by Hanaoka et al. (CT-RSA 2012), and used as one of the building blocks for constructing their proxy re-encryption scheme. In a re-splittable TPKE scheme, a secret key can be split into a set of secret key shares not only once, but also multiple times, and the security of the TPKE scheme is guaranteed as long as the number of corrupted secret key shares under the same splitting is smaller than the threshold. In this paper, we show several new constructions of a re-splittable TPKE scheme by extending the previous (ordinary) TPKE schemes. All of our proposed schemes are based on discrete logarithm (DL)-type assumptions. Therefore, our results suggest that key re-splittability is a very natural property for DL-type TPKE schemes.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1473/_p

Copy

@ARTICLE{e101-a_9_1473,

author={Satsuya OHATA, Takahiro MATSUDA, Goichiro HANAOKA, Kanta MATSUURA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={More Constructions of Re-Splittable Threshold Public Key Encryption},

year={2018},

volume={E101-A},

number={9},

pages={1473-1483},

abstract={The concept of threshold public key encryption (TPKE) with the special property called key re-splittability (re-splittable TPKE, for short) was introduced by Hanaoka et al. (CT-RSA 2012), and used as one of the building blocks for constructing their proxy re-encryption scheme. In a re-splittable TPKE scheme, a secret key can be split into a set of secret key shares not only once, but also multiple times, and the security of the TPKE scheme is guaranteed as long as the number of corrupted secret key shares under the same splitting is smaller than the threshold. In this paper, we show several new constructions of a re-splittable TPKE scheme by extending the previous (ordinary) TPKE schemes. All of our proposed schemes are based on discrete logarithm (DL)-type assumptions. Therefore, our results suggest that key re-splittability is a very natural property for DL-type TPKE schemes.},

keywords={},

doi={10.1587/transfun.E101.A.1473},

ISSN={1745-1337},

month={September},}

Copy

TY - JOUR

TI - More Constructions of Re-Splittable Threshold Public Key Encryption

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1473

EP - 1483

AU - Satsuya OHATA

AU - Takahiro MATSUDA

AU - Goichiro HANAOKA

AU - Kanta MATSUURA

PY - 2018

DO - 10.1587/transfun.E101.A.1473

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E101-A

IS - 9

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - September 2018

AB - The concept of threshold public key encryption (TPKE) with the special property called key re-splittability (re-splittable TPKE, for short) was introduced by Hanaoka et al. (CT-RSA 2012), and used as one of the building blocks for constructing their proxy re-encryption scheme. In a re-splittable TPKE scheme, a secret key can be split into a set of secret key shares not only once, but also multiple times, and the security of the TPKE scheme is guaranteed as long as the number of corrupted secret key shares under the same splitting is smaller than the threshold. In this paper, we show several new constructions of a re-splittable TPKE scheme by extending the previous (ordinary) TPKE schemes. All of our proposed schemes are based on discrete logarithm (DL)-type assumptions. Therefore, our results suggest that key re-splittability is a very natural property for DL-type TPKE schemes.

ER -