| Project/Area Number |
15300015
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Computer system/Network
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
ITOH Toshiya Tokyo Institute of Technology, GSIC, Professor, 学術国際情報センター, 教授 (20184674)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YAMAOKA Katsunori Tokyo Institute of Technology, Graduate School of Science and Engineering, Associate Professor, 大学院・理工学研究科, 助教授 (90262279)
KAKUTA Mitsugu Tokyo Institute of Technology, Interdisciplinary Graduate School of Science and Engineering, Associate Professor, 大学院・総合理工学研究科, 講師 (00301979)
|
|---|
| Project Period (FY) |
2003 – 2005
|
| Project Status |
Completed (Fiscal Year 2005)
|
| Budget Amount *help |
¥16,300,000 (Direct Cost: ¥16,300,000)
Fiscal Year 2005: ¥5,200,000 (Direct Cost: ¥5,200,000)
Fiscal Year 2004: ¥6,500,000 (Direct Cost: ¥6,500,000)
Fiscal Year 2003: ¥4,600,000 (Direct Cost: ¥4,600,000)
|
|---|
| Keywords | Zero-Knowledge Proofs / Distributed network / Identification scheme / Security / Scalability / Information infrastructure |
|---|
| Research Abstract |
In distributed network systems, it is practical to establish authentication schemes for a group of users. This enables the system to realize a mechanism by which is discriminates users by authentication, and permits them to use the computing and/or network resources.
In this research, we proposed a new distributed local identification scheme that achieves such a mechanism, i.e., scheme that is based on zero-knowledge proofs. To show the availability of the proposed scheme, we also discuss a scheme based on public-key cryptosystems and compare the performance of the two systems. We first design those two distributed local identification schemes and then analyze the performance of these schemes with respect to security level, time complexity, communication complexity, and space complexity, to verify the availability of the scheme based on zero-knowledge proofs. By the analysis, we observe that for the scheme based on zero-knowledge proofs, the communication complexity is dominant of the overall performance but for the scheme based on public-key cryptosystems, the time complexity is dominant of the overall performance. As a result, we show that the scheme based on zero-knowledge proofs is more advantageous than the scheme based on public-key cryptosystems, especially when a broadband network is accessible.
|
