A cover free family (CFF) is a useful mathematical tool for cryptographic schemes where any pre-defined number of sets in the family do not cover another set in the family. The common disadvantage of CFF-based schemes is the requirement for a significantly large amount of data such as public keys and ciphertexts. This paper proposes a simple method to reduce the size of ciphertexts in CFF-based broadcast encryption schemes by removing redundant elements from sets in the family, and then analyzes the size of cihpertexts. As a result, in a typical distribution case, the average amount of ciphertexts is reduced to 83 percents (from 691Kbits to 576Kbits).
Maki YOSHIDA
National Institute of Information and Communications Technology
Toru FUJIWARA
Osaka University
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
Maki YOSHIDA, Toru FUJIWARA, "Efficient Usage of Cover Free Families in Broadcast Encryption" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 6, pp. 1216-1221, June 2016, doi: 10.1587/transfun.E99.A.1216.
Abstract: A cover free family (CFF) is a useful mathematical tool for cryptographic schemes where any pre-defined number of sets in the family do not cover another set in the family. The common disadvantage of CFF-based schemes is the requirement for a significantly large amount of data such as public keys and ciphertexts. This paper proposes a simple method to reduce the size of ciphertexts in CFF-based broadcast encryption schemes by removing redundant elements from sets in the family, and then analyzes the size of cihpertexts. As a result, in a typical distribution case, the average amount of ciphertexts is reduced to 83 percents (from 691Kbits to 576Kbits).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1216/_p
Copy
@ARTICLE{e99-a_6_1216,
author={Maki YOSHIDA, Toru FUJIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Usage of Cover Free Families in Broadcast Encryption},
year={2016},
volume={E99-A},
number={6},
pages={1216-1221},
abstract={A cover free family (CFF) is a useful mathematical tool for cryptographic schemes where any pre-defined number of sets in the family do not cover another set in the family. The common disadvantage of CFF-based schemes is the requirement for a significantly large amount of data such as public keys and ciphertexts. This paper proposes a simple method to reduce the size of ciphertexts in CFF-based broadcast encryption schemes by removing redundant elements from sets in the family, and then analyzes the size of cihpertexts. As a result, in a typical distribution case, the average amount of ciphertexts is reduced to 83 percents (from 691Kbits to 576Kbits).},
keywords={},
doi={10.1587/transfun.E99.A.1216},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - Efficient Usage of Cover Free Families in Broadcast Encryption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1216
EP - 1221
AU - Maki YOSHIDA
AU - Toru FUJIWARA
PY - 2016
DO - 10.1587/transfun.E99.A.1216
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2016
AB - A cover free family (CFF) is a useful mathematical tool for cryptographic schemes where any pre-defined number of sets in the family do not cover another set in the family. The common disadvantage of CFF-based schemes is the requirement for a significantly large amount of data such as public keys and ciphertexts. This paper proposes a simple method to reduce the size of ciphertexts in CFF-based broadcast encryption schemes by removing redundant elements from sets in the family, and then analyzes the size of cihpertexts. As a result, in a typical distribution case, the average amount of ciphertexts is reduced to 83 percents (from 691Kbits to 576Kbits).
ER -