Open Access
June 2010 On the average number of ciphertexts for the optimal key-management tree for a frequency distribution of communication
Nozomu Ochiumi
Author Affiliations +
SUT J. Math. 46(2): 243-254 (June 2010). DOI: 10.55937/sut/1295467057

Abstract

The average number of ciphertexts per one session c¯T is an indicator of aptitude of a key-management tree T for a given frequency distribution of communication. In this paper, we estimate the weighted mean of c¯T over all T’s with respect to appropriate weights as a criterion of aptitude of a key-management tree. We also give the concrete value of that mean in the case of equal weights.

Acknowledgements

The author would like to thank the Associate Editor and the referee for their useful comments. And the author would like to express his sincere thanks to Professor Yasuichi Horibe and Professor Masahiro Yanagida for their useful suggestions and comments.

Citation

Download Citation

Nozomu Ochiumi. "On the average number of ciphertexts for the optimal key-management tree for a frequency distribution of communication." SUT J. Math. 46 (2) 243 - 254, June 2010. https://doi.org/10.55937/sut/1295467057

Information

Received: 6 August 2010; Revised: 24 November 2010; Published: June 2010
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1295467057

Subjects:
Primary: 05C05 , 68R10 , 94A60

Keywords: 1-to-k encryption , Average cost , Broadcast encryption schemes , Entropy , frequency distribution of communication , generating function method , tree-based key-management system

Rights: Copyright © 2010 Tokyo University of Science

Vol.46 • No. 2 • June 2010
Back to Top