Reliable Broadcasting and Secure Distributing in Channel Networks(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Let T_1, ・・・, T_n be n spanning trees rooted at node r of graph G. If for any node v, n paths from r to v, each path in each spanning tree of T_1, ・・・, T_n, are internally disjoint, then T_1, ・・・, T_n are said to be independent spanning trees rooted at r. A graph G is called an n-channel graph if G has n independent spanning trees rooted at each node G. We generalize the definition of n-channel graphs. If for any node v of G, among the n paths from r to v, each path in each spanning tree of T_1, ・・・, T_n, there are k internally disjoint paths, then T_1, ・・・, T_n are said to be(k, n)-independent spanning trees rooted at r of G. A graph G is called a(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 in(k, n)-channel graphs. The second task is secure message distribution such that one node called the distributor attempts to send different messages safely to different nodes. We should keep each message secret from the nodes called adversaries. We give two message distribution schemes in(k, n)-channel graphs. The first scheme uses secret sharing, and it can tolerate up to t+k-n listening advaersaries for any t<n if G is a(k, n)-channel graph. The second scheme uses unverifiable secret sharing, and it can tolerate up to t+k-n disrupting adversaries for any t<n/3 if G is a(k, n)-channel graph.

• 社団法人電子情報通信学会の論文
• 1998-05-25

著者

• Bao F

  National Univ. Sinpapore Singapore

• Hamada Yukihiro

  Department Of Electrical Engineering Akashi National College Of Technology

• Igarashi Yoshihide

  Department of Computer Science, Gunma University

• BAO Feng

  Institute for Infocomm Research, 21 Heng Mui Keng Terrace

• FUNYU Yutaka

  Yokogawa Electric Corporation

• Bao Feng

  Institute For Infocomm Research

• Igarashi Y

  Gunma Univ. Kiryu‐shi Jpn

• Igarashi Yoshihide

  Department Of Computer Science Gunma University

関連論文

• Trends in the prescriptions of Kampo medicines over a six-year period
• Information Disseminating Schemes and Their Fault Tolerance in Hypercubes
• A More Efficient Improvement of the Virtual Software Token Protocols (Fundamental Theories for Communications)
• Security Notes on Generalization of Threshold Signature and Authenticated Encryption(Information Security)
• Optimal Time Broadcasting Schemes in Faulty Star Graphs (Special Section on Discrete Mathematics and Its Applications)
• Reliable Broadcasting and Secure Distributing in Channel Networks(Special Section on Discrete Mathematics and Its Applications)
• Independent Spanning Trees of Product Graphs and Their Construction
• Independent Spanning Trees of Product Graphs and Their Construction
• Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs (Special Section on Discrete Mathematics and Its Applications)
• Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults
• Broadcasting in Hypercubes with Randamly Distributed Byzantine Faults
• PJ-645 Continuous dosing of nitrates reduces forearm blood flow in patients with ischemic heart disease(Chronic coronary heart disease / Remodeling(03)(IHD),Poster Session(Japanese),The 72nd Annual Scientific Meeting of the Japanese Circulation Society)
• Thermoelectric Properties of P -Type BaSnO3 Ceramics Doped with Cobalt
• Study on Annular Mist Flow in Pipe : 1st Report, Investigation of the Non-equilibrium Length and Changes of Some Factors in the Non-equilibrium Region
• Thermoelectric Properties of P-Type BaSnO_3 Ceramics Doped with Cobalt
• Liver abscess that responded well to pazufloxacin therapy
• Embeddings of Hyper-Rings in Hypercubes
• Time-Bound Hierarchical Key Assignment : An Overview
• REMARKS ON REAL-TIME DETERMINISTIC CONTEXT-FREE LANGUAGES(Mathematical Theories on Computing Schemes and Their Applications)
• Roughly Sorting: Sequential and Parallel Approach
• Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model (Special Issue on Selected Papers from LA Symposium)
• Highly Concurrent Group Mutual Exclusion Algorithms Based on Ticket Ordersl(Foundations of Computer Science)
• Construction of Secret Key Exchange Spanning Trees by Random Deals of Cards on Hierarchical Structures (Special Section on Discrete Mathematics and Its Applications)
• Secure Multi-Party Computation over Networks(Special Issue on Algorithm Engineering : Surveys)
• Security Analysis on an Improvement of RSA-Based Password Authenticated Key Exchange(Fundamental Theories for Communications)
• Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
• Clinical efficacy of arbekacin for Gram-negative bacteria
• Roughly Sorting: A Generalization of Sorting
• Investigation and threshold of optimum blood concentration of voriconazole : a descriptive statistical meta-analysis
• Practice guidelines for therapeutic drug monitoring of voriconazole : a consensus review of the Japanese Society of Chemotherapy and the Japanese Society of Therapeutic Drug Monitoring

もっと見る 閉じる

スポンサーリンク