New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation
スポンサーリンク
概要
- 論文の詳細を見る
In an ad hoc network, we cannot assume a trusted certificate authority and a centralized repository that are used in ordinary Public-Key Infrastructure (PKI). Hence a PKI system of the web-of-trust type in which each node can issue certificates to others in a self-organizing manner has been studied. Although this system is useful for ad hoc networks, it has the problem that for authentication a node needs to find a certificate-chain to the destination node. In this paper, we formally model a web-of-trust-type PKI system, define the certificate-chain discovery problem, and propose a new distributed algorithm and its modification that solve the problem. Furthermore, we propose a measure of communication cost, and according to the measure, we compare our algorithm with an existing method by numerical computation for large-size networks and by simulation on randomly generated unit disk graphs for moderate-size networks. The simulation results show that the communication cost of the proposed method is less than 10% of the existing method.
- 一般社団法人 情報処理学会の論文
著者
-
Seki Hiroyuki
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Mohri Hisashi
Graduate School Of Information Science Nara Institute Of Science And Technology
-
YASUDA IKUYA
Graduate School of Information Science, Nara Institute of Science and Technology
-
Takata Yoshiaki
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Yasuda Ikuya
Graduate School Of Information Science Nara Institute Of Science And Technology:(present Office)mura
関連論文
- A Formal Approach to Detecting Security Flaws in Object-Oriented Databases (Special Issue on New Generation Database Technologies)
- An Authorization Model for Object-Oriented Databases and Its Efficient Access Control
- Assignment of Data Types to Words in a Natural Language Specification
- Implementation of Natural Language Specifications of Communication Protocols by Executable Specifications
- RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar
- RIGHT-LINEAR FINITE PATH OVERLAPPING REWRITE SYSTEMS EFFECTIVELY PRESERVE RECOGNIZABILITY
- A Polynomial Time Learning Algorithm for Recognizable Series
- A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars
- A Note on Inadequacy of the Model for Learning from Queries
- Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry
- A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power
- New certificate chain discovery methods for trust establishment in ad hoc networks and their evaluation (特集:次世代社会基盤をもたらす高度交通システムとモバイル通信システム)
- Policy Controlled System and Its Model Checking
- Decidability of the Security Verification Problem for Programs with Stack Inspection
- Tree Automaton with Tree Memory
- Static Analysis for k-secrecy against Inference Attacks
- An Efficient Method for Optimal Probe Deployment of Distributed IDS(Dependable Computing)
- RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar
- Deciding Schema k-Secrecy for XML Databases
- A Static Analysis using Tree Automata for XML Access Control
- New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation
- New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation
- Runtime Control of a Program based on Quantitative Information Flow