| Project/Area Number |
16360184
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
OKAMOTO Eiji University of Tsukuba, Graduate School of Systems and Information Engineering, Professor, 大学院システム情報工学研究科, 教授 (60242567)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MIAO Ying University of Tsukuba, Graduate School of Systems and Information Engineering, Associate Professor, 大学院システム情報工学研究科, 助教授 (10302382)
OKAMOTO Takeshi University of Tsukuba, Graduate School of Systems and Information Engineering, Lecturer, 大学院システム情報工学研究科, 講師 (00349797)
|
|---|
| Project Period (FY) |
2004 – 2006
|
| Project Status |
Completed (Fiscal Year 2006)
|
| Budget Amount *help |
¥13,900,000 (Direct Cost: ¥13,900,000)
Fiscal Year 2006: ¥3,700,000 (Direct Cost: ¥3,700,000)
Fiscal Year 2005: ¥5,200,000 (Direct Cost: ¥5,200,000)
Fiscal Year 2004: ¥5,000,000 (Direct Cost: ¥5,000,000)
|
|---|
| Keywords | Pairing / Elliptic curve / Bilinear mapping / Cryptographic key management / (k, n) threshold scheme / Secret sharing scheme (SSS) / 1-out-of-n scheme / Hybrid-P2P model / ペアリング / Ateペアリング / Twisted Ateペアリング / 暗号 / 公開鍵暗号系 / 鍵 / 署名 / 証明書 |
|---|
| Research Abstract |
We construct efficient secret sharing scheme (SSS) (including "1-out-of-n" cryptosystem) and consider the treatment against the loss of cryptographic key. To make more concretely, we propose Hybrid P2P network model which does not access to the root server in case the system preserves or gathers the share of SSS. Our scheme can give some guarantee for the data integrity even when the system loses both terminal machines (e.g. mobile PC) and removable cryptographic key (e.g. USB key). We solve the above problem mainly using the following two methods : (1) The system uses the work key (not master key) to encrypt the data in mobile PC ; (2) The system uses the authentication code from the root server, which decrypts the encrypted data. Consequently, our system realizes the share's generation and the data recovery related to the (k, n) threshold scheme. The system gives the data integrity for the authentication code between server and client machines. Profitable performance evaluation is al
… More
so obtained from implementation point of view.
We also propose fast software/hardware implementation to calculate the paring on elliptic curve. Nowadays there are so many applications in the pairing based cryptosystem, e.g. ID-based cryptosystem, short signature, broadcast encryption, etc. However there exist some drawbacks in pairing calculation. This means that the amount of work to calculate the pairing is very large compared to the conventional calculation method. We propose some efficient pairing algorithms for calculation. One of them is a proposal of an efficient (twisted) Ate pairing. The twisted Ate pairing is faster than the conventional Tate pairing. We give the loop-shorten technique of the Eta T pairing. This pairing can be applied to the twisted Ate pairing and computational cost is reduced by 25 to 50 % in terms of software implementation. In addition, we show that the improvement of the twisted Ate pairing is theoretically faster than the Ate pairing when parameter rho is approximately 2. In the same way, we also proposed other efficient pairings and estimate them compared to conventional pairings. Less
|
