WEKO3
アイテム
Formal Language Theoretic Approach to the Disclosure Tree Strategy in Trust Negotiation
http://hdl.handle.net/10173/675
http://hdl.handle.net/10173/675ea7eaedf-45c5-4768-8924-275a64368e8b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IEICE_E92-D_2_200.pdf (554.7 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2011-06-23 | |||||||||
| タイトル | ||||||||||
| タイトル | Formal Language Theoretic Approach to the Disclosure Tree Strategy in Trust Negotiation | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | rust management | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | trust negotiation | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | negotiation strategy | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | computational complexity | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | context-free grammar | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者 |
TAKATA, Yoshiaki
× TAKATA, Yoshiaki
× SEKI, Hiroyuki
|
|||||||||
| 抄録 | ||||||||||
| 内容記述タイプ | Abstract | |||||||||
| 内容記述 | Trust negotiation is an authorizing technique based on digital credentials, in which both a user and a server gradually establish trust in each other by repeatedly exchanging their credentials. A trust negotiation strategy is a function that answers a set of credentials to disclose to the other party, depending on policies and the set of already disclosed credentials. The disclosure tree strategy (DTS), proposed by Yu et al., is one of the strategies that satisfies preferable properties. DTS in a simple implementation requires exponential time and space; however, neither an efficient algorithm nor the lower-bound of its complexity was known. In this paper, we investigate the computational complexity of DTS. We formulate subproblems of DTS as problems on derivation trees of a context-free grammar (CFG), and analyze the computational complexity of the subproblems using the concepts of CFGs. As a result, we show that two subproblems EVL and MSET of DTS are NP-complete and NP-hard, respectively, while both are solvable in polynomial time if we modify EVL not to require non-redundancy and MSET not to answer any subset useless for leading the negotiation to success. | |||||||||
| 書誌情報 |
IEICE Transactions on Information and Systems 巻 E92-D, 号 2, p. 200-210, 発行日 2009-02-01 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1745-1361@@@0916-8532 | |||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AA11510321@@@AA10826272 | |||||||||
| DOI | ||||||||||
| 関連タイプ | isIdenticalTo | |||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | 10.1587/transinf.E92.D.200 | |||||||||
| 権利 | ||||||||||
| 権利情報 | Copyright © 2009 The Institute of Electronics, Information and Communication Engineers | |||||||||
| 著者版フラグ | ||||||||||
| 出版タイプ | VoR | |||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||
| 出版者 | ||||||||||
| 出版者 | The Institute of Electronics, Information and Communication Engineers | |||||||||
| 関係URI | ||||||||||
| 識別子タイプ | URI | |||||||||
| 関連識別子 | http://search.ieice.org/ | |||||||||
| 関連名称 | http://search.ieice.org/ | |||||||||
