Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP, IPSJ-AL |
2021-08-25 16:30 |
Online |
Online |
Rational sumcheck protocols for classically delegating quantum computing to a quantum server Yuki Takeuchi (NTT), Tomoyuki Morimae (Kyoto Univ.), Seiichiro Tani (NTT) COMP2021-11 |
Recently, a new model of delegated quantum computing has been proposed, namely, rational delegated quantum computing.
... [more] |
COMP2021-11 pp.10-13 |
QIT (2nd) |
2020-12-11 16:20 |
Online |
Online |
Almost entanglement-breaking channel approximately generating arbitrary separable states requires exponentially large input system
-- Application for disentangler conjecture -- Seiseki Akibue, Go Kato, Seiichiro Tani (NTT) |
(To be available after the conference date) [more] |
|
ISEC, IT, WBS |
2020-03-10 13:20 |
Hyogo |
University of Hyogo (Cancelled but technical report was issued) |
Delegatable zero-knowledge proof systems with NIZap Naoya Shiratori, Mitsuru Tada (Chiba Univ.) IT2019-92 ISEC2019-88 WBS2019-41 |
(To be available after the conference date) [more] |
IT2019-92 ISEC2019-88 WBS2019-41 pp.15-22 |
QIT (2nd) |
2019-05-21 12:00 |
Fukuoka |
Kyushu University, Chikushi Campus |
Analysis of Quantum Multi-Prover Zero-Knowledge Systems: Elimination of the Honest Condition and Computational Zero-Knowledge Systems for QMIP Yusuke Kinoshita (Nagoya Univ.) |
Zero-knowledge and multi-prover systems are both central notions in classical and quantum complexity
theory. There is, ... [more] |
|
IT, ISEC, WBS |
2019-03-08 16:10 |
Tokyo |
University of Electro-Communications |
Non-interactive Proof Systems for Group-Dependent Bundled Languages Hiroaki Anada (Univ. of Nagasaki) IT2018-114 ISEC2018-120 WBS2018-115 |
In this report,
we propose a bundled language for the direct product of group-dependent languages.
Then we construct... [more] |
IT2018-114 ISEC2018-120 WBS2018-115 pp.243-248 |
ISEC |
2018-09-07 10:20 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
On AND/OR Composition of the ZKBoo Protocols Hiroaki Anada (U. Nagasaki) ISEC2018-53 |
The ZKBoo protocol, which was presented at USENIX Security '16, is a kind of sigma-protocol. Since the presentation it i... [more] |
ISEC2018-53 pp.23-24 |
COMP |
2013-10-18 15:50 |
Aichi |
Nagoya Institute of Technology |
Constant-Space Zero-Knowledge Proofs Systems with One-Way Quantum Verifiers
-- Preliminary Report -- Marcos Villagra, Tomoyuki Yamakami (Univ. of Fukui) COMP2013-36 |
We discuss the notion of quantum zero-knowledge proof systems whose memory-limited verifiers
receive a stream of classi... [more] |
COMP2013-36 pp.23-24 |
COMP |
2013-06-24 15:45 |
Nara |
Nara Women's University |
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.) COMP2013-24 |
This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is prove... [more] |
COMP2013-24 pp.31-38 |
ISEC, LOIS |
2011-11-15 13:50 |
Osaka |
Osaka Electro-Communication University |
On the Little Knowledge Interactive Proof Jun-ya Iwazaki, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya (Tohoku Univ.) ISEC2011-56 LOIS2011-50 |
We propose the notion of little knowledgeness in interactive proof systems,
as a notion alternative to the zero knowle... [more] |
ISEC2011-56 LOIS2011-50 pp.149-154 |
DE |
2008-12-01 |
Tokyo |
Gakushuin |
[Poster Presentation]
A Concept of Oblivious CAPTCHA
-- Fifth-Factor Technology for Practical CAPTCHA Usages -- Hiroaki Ozeki (IBM Japan) DE2008-63 |
The CAPTCHA idea (Completely Automated Public Turing test to tell Computers and Humans Apart) is widely used as a HIP (H... [more] |
DE2008-63 pp.31-32 |