Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)   p. 472
Reliable broadcasting and secure distributing in channel networks

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645139
Send link to a friend

Abstract
Let T/sub 1/, /spl middot//spl middot//spl middot/, T/sub n/ be n spanning trees rooted at node r of graph G. If for any node /spl nu/ of G, among the n paths from r to /spl nu/, each path in each spanning tree of T/sub 1/, /spl middot//spl middot//spl middot/, T/sub n/, there are k (k/spl les/n) internally disjoint paths, then T/sub 1/, /spl middot//spl middot//spl middot/, T/sub n/, are said to be (k, n)-independent spanning trees rooted at r. A graph is called an (k, n)-channel graph if G has (k, n)-independent spanning trees rooted at each node of G. We study two fault-tolerant communication tasks in (k, n)-channel graphs. The first task is reliable broadcasting. We analyze the relation between the reliability and the efficiency of broadcasting. The second task is secure message distributing. It is required that each message should be received by its destination node and that we should keep the message secret from the nodes called adversaries. We give two message distribution schemes. The first scheme uses secret sharing, and it can tolerate t+k-n listening adversaries for any t
Additional Information
Index Terms- security of data; channel networks; spanning trees; secure message distributing; reliable broadcasting; secret sharing; fault-tolerant communication; message distribution schemes

Citation:  Feng Bao, Y. Funyu, Y. Hamada, Y. Igarashi, "Reliable broadcasting and secure distributing in channel networks," ispan, p. 472,  1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97),  1997

Similar Articles

Abstract Contents
Abstract
Index Terms
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback