Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Di Pietro, Roberto | Mancini, Luigi V. | Mei, Alessandro
Affiliations: Dipartimento di Informatica, Università di Roma “La Sapienza”, Roma, Italy. E-mail: dipietro@dsi.uniroma1.it, mancini@dsi.uniroma1.it, mei@dsi.uniroma1.it
Note: [*] This work was partially supported by the WEB-MINDS project from the Italian MIUR under the FIRB program and by the EU IST-2001-34734 EYES project.
Abstract: This paper brings up a new concern regarding efficient re-keying of large groups with dynamic membership: minimizing the overall time it takes for the key server and the group members to process the re-keying message. Specifically, we concentrate on re-keying algorithms based on the Logical Key Hierarchy (LKH), and minimize the longest sequence of encryptions and decryptions that need to be done in a re-keying operation. We first prove a lower bound on the time required to perform a re-keying operation in this model, then we provide an optimal schedule of re-keying messages matching the above lower bound. In particular, we show that the optimal schedule can be found only when the ariety of the LKH key graph is chosen according to the available communication bandwidth and the users processing power. Our results show that key trees of ariety 3, commonly assumed to be optimal, are not optimal when used in high bandwidth networks, or networks of devices with low computational power like sensor networks.
DOI: 10.3233/JCS-2004-12502
Journal: Journal of Computer Security, vol. 12, no. 5, pp. 693-709, 2004
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl