2016 Fiscal Year Final Research Report
Communication Complexity based on Blind Quantum Computation
| Project/Area Number |
26540002
|
|---|
| Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Saitama University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
NISHIMURA Harumichi 名古屋大学, 情報科学研究科, 准教授 (70433323)
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| Keywords | 暗号理論 / 量子計算 / 暗号プロトコル / 準同型暗号 |
|---|
| Outline of Final Research Achievements |
In order to discuss the quantum communication complexity of several problems, we propose efficient protocols for secure database search based on homomorphic encryption for comparison. In addition, we have computational experiments to verify the effectiveness of our proposals. We have a new result with respect to quantum blind computation. We devise an information-theoretic mechanism where a third-party can arbitrate between a client and a server if one party is cheating and incorporate the mechanism into quantum blind computation.
|
| Free Research Field |
量子計算
|
