Unconditionally secure cryptographic protocols from noisy channels
| Project/Area Number |
21760300
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Kwansei Gakuin University |
|---|
Principal Investigator |
ISAKA Motohiko 関西学院大学, 理工学部, 准教授 (50351739)
|
|---|
| Project Period (FY) |
2009 – 2011
|
| Project Status |
Completed (Fiscal Year 2011)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2011: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2010: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2009: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Keywords | 情報理論 / 安全性 / 暗号プリミティブ |
|---|
| Research Abstract |
A cryptographic protocol called oblivious transfer is a powerful tool in secure multiparty computation. In this research project, we studied unconditionally secure oblivious transfer whose secrecy is guaranteed even when a malicious player has unlimited computational power. We designed a procedure between two parties for realizing oblivious transfer by assuming the existence of continuous noisy channels. An efficient coding scheme to be used in this scenario is also proposed.
|
Report
(4 results)
Research Products
(29 results)
