2016 Fiscal Year Final Research Report
The Construction for Anonymous Authentication Scheme using Bilinear Pairing
| Project/Area Number |
24500005
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tsukuba University of Technology |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2012-04-01 – 2017-03-31
|
| Keywords | 暗号 / 電子署名 / 相手認証 / 匿名認証 / ペアリング / CAPTCHA |
|---|
| Outline of Final Research Achievements |
In this research, we study broadcast encryption using bilinear pairing. In our scheme, a sender encrypts data using his private key. This allows the receiver to authenticate the sender and the message. Furthermore, we consider the efficient signature scheme combining both functions of 1-out-of-n signatures and designated-verifier signatures.
We also study CAPTCHA to use the fundamental technique of anonymous authentication. The current CAPTCHA mainly uses perceptual recognition with images or sounds, but it is difficult for visually or hearing-impaired people to leverage it. We propose a new identification scheme. Our scheme uses a verbal question which is identification of natural sentences and word salads. We generate natural sentences as word salads which are generated by the Markov chain with multi-state. Such sentences are generated almost unbounded volume by using online documents and it is hard for adversaries to find them by search engine.
|
| Free Research Field |
情報セキュリティ
|
