Skip Navigation

The Computer Journal 1999 42(1):51-61; doi:10.1093/comjnl/42.1.51
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Blundo, C.
Right arrow Articles by Gaggia, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A {tau}-restricted key agreement scheme

Carlo Blundo, P D'Arco and AG Gaggia

Università di Salerno, 84087 Baronissi (SA), Italy Email: carblu@dia.unisa.it

A one-restricted key agreement scheme is a method by which initially a trusted authority distributes private individual pieces of information to a set of users. Later, each member of any group of users of a given size, referred to as a conference, can compute a common key by exchanging messages over a broadcast channel all users have access to. Such schemes can be used to establish only one common key. In this paper we analyse {tau}-restricted key agreement schemes. Such schemes allow the computation of up to r{tau} common keys for {tau} distinct conferences. For certain values of the parameters the scheme that we propose distributes less information than the trivial one obtained by considering {tau} copies of a one-restricted scheme.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.