Multi-Divisible On-Line/Off-Line Encryptions

Dan YAMAMOTO; Wakaha OGATA

doi:10.1587/transfun.E100.A.91

Multi-Divisible On-Line/Off-Line Encryptions

Dan YAMAMOTO, Wakaha OGATA

Full Text Views

0

Cite this

Summary :

We present a new notion of public-key encryption, called multi-divisible on-line/off-line encryptions, in which partial ciphertexts can be computed and made publicly available for the recipients before the recipients' public key and/or the plaintexts are determined. We formalize its syntax and define several security notions with regard to the level of divisibility, the number of users, and the number of encryption (challenge) queries per user. Furthermore, we show implications and separations between these security notions and classify them into three categories. We also present concrete multi-divisible on-line/off-line encryption schemes. The schemes allow the computationally-restricted and/or bandwidth-restricted devices to transmit ciphertexts with low computational overhead and/or low-bandwidth network.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.1 pp.91-102

Publication Date: 2017/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.91

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category

Authors

Dan YAMAMOTO
Hitachi, Ltd.,Tokyo Institute of Technology
Wakaha OGATA
Tokyo Institute of Technology

Keyword

public-key encryption, on-line/off-line encryption, divisible, multi-user setting, KEM

Cite this

Copy

Dan YAMAMOTO, Wakaha OGATA, "Multi-Divisible On-Line/Off-Line Encryptions" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 1, pp. 91-102, January 2017, doi: 10.1587/transfun.E100.A.91.
Abstract: We present a new notion of public-key encryption, called multi-divisible on-line/off-line encryptions, in which partial ciphertexts can be computed and made publicly available for the recipients before the recipients' public key and/or the plaintexts are determined. We formalize its syntax and define several security notions with regard to the level of divisibility, the number of users, and the number of encryption (challenge) queries per user. Furthermore, we show implications and separations between these security notions and classify them into three categories. We also present concrete multi-divisible on-line/off-line encryption schemes. The schemes allow the computationally-restricted and/or bandwidth-restricted devices to transmit ciphertexts with low computational overhead and/or low-bandwidth network.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.91/_p

Copy

@ARTICLE{e100-a_1_91,
author={Dan YAMAMOTO, Wakaha OGATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multi-Divisible On-Line/Off-Line Encryptions},
year={2017},
volume={E100-A},
number={1},
pages={91-102},
abstract={We present a new notion of public-key encryption, called multi-divisible on-line/off-line encryptions, in which partial ciphertexts can be computed and made publicly available for the recipients before the recipients' public key and/or the plaintexts are determined. We formalize its syntax and define several security notions with regard to the level of divisibility, the number of users, and the number of encryption (challenge) queries per user. Furthermore, we show implications and separations between these security notions and classify them into three categories. We also present concrete multi-divisible on-line/off-line encryption schemes. The schemes allow the computationally-restricted and/or bandwidth-restricted devices to transmit ciphertexts with low computational overhead and/or low-bandwidth network.},
keywords={},
doi={10.1587/transfun.E100.A.91},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Multi-Divisible On-Line/Off-Line Encryptions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 91
EP - 102
AU - Dan YAMAMOTO
AU - Wakaha OGATA
PY - 2017
DO - 10.1587/transfun.E100.A.91
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2017
AB - We present a new notion of public-key encryption, called multi-divisible on-line/off-line encryptions, in which partial ciphertexts can be computed and made publicly available for the recipients before the recipients' public key and/or the plaintexts are determined. We formalize its syntax and define several security notions with regard to the level of divisibility, the number of users, and the number of encryption (challenge) queries per user. Furthermore, we show implications and separations between these security notions and classify them into three categories. We also present concrete multi-divisible on-line/off-line encryption schemes. The schemes allow the computationally-restricted and/or bandwidth-restricted devices to transmit ciphertexts with low computational overhead and/or low-bandwidth network.
ER -