| Project/Area Number |
22560378
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Okayama University |
|---|
Principal Investigator |
NAKANISHI Tohru 岡山大学, 大学院・自然科学研究科, 准教授 (50304332)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
FUNABIKI Nobuo 岡山大学, 大学院・自然科学研究科, 教授 (70263225)
NOGAMI Yasuyuki 岡山大学, 大学院・自然科学研究科, 准教授 (60314655)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2010: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Keywords | プライバシ保護 / 認証 / プライバシー / 匿名 / グループ署名 / ペアリング / 失効 / 楕円曲線暗号 / プライバシ |
|---|
| Research Abstract |
By anonymous authentications called group signatures, a user can be anonymously authenticated, and thus the privacy of users is protected. In conventional group signature schemes, the computational and/or communicational costs depending on the number of users and the number of revoked ones are required for member revocations. In this research, we constructed revocable schemes that are efficient on both costs, and realized scalable implementations by the fast pairing computations.
|
