| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ISEC | 2024-05-15 14:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Single-Shuffle Physical Zero-Knowledge Proof for Sudoku using Interactive Inputs Tomoki Ono, Suthee Ruangwises (UEC), Yoshiki Abe (UEC/AIST), Kyosuke Hatsugai, Mitsugu Iwamoto (UEC) |
[more] | |
| RCC, ISEC, IT, WBS | 2024-03-14 14:40 |
Osaka | Osaka Univ. (Suita Campus) | Proposing the privacy-preserving cross-chain communication Hideaki Miyaji, Noriaki Kamiyama (RU)  IT2023-127 ISEC2023-126 WBS2023-115 RCC2023-109 |
Cross-chain communication is a cryptographic technique for sending and receiving tokens and data among different blockch... [more] | IT2023-127 ISEC2023-126 WBS2023-115 RCC2023-109 pp.324-331 |
| SITE, ISEC, LOIS | 2021-11-12 13:25 |
Online | Online | Zero-Knowledge Proof of Isolation in Graph with Strong Secrecy Tomoki Murakami, Toru Nakanishi, Katsunobu Imai (Hiroshima Univ.) ISEC2021-42 SITE2021-36 LOIS2021-25 |
Network systems can be represented using graphs. What is important for a tenant is that his system is well connected (co... [more] | ISEC2021-42 SITE2021-36 LOIS2021-25 pp.7-12 |
| 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] |
|
| SITE, ISEC, LOIS | 2018-11-04 15:10 |
Fukuoka | Pairing-based Zero-Knowledge Proof of Graph Information Hiromi Yoshino, Toru Nakanishi (Hiroshima Univ.) ISEC2018-79 SITE2018-57 LOIS2018-39 |
A network provider needs to consider a method that can disclose correct information to the system user without disclosin... [more] | ISEC2018-79 SITE2018-57 LOIS2018-39 pp.87-93 |
|
| ISEC, IT, WBS | 2015-03-02 14:05 |
Fukuoka | The University of Kitakyushu | On the Limit of Security Proof for Homomorphic Encryption Daiki Takahashi, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya (Tohoku Univ.) IT2014-67 ISEC2014-80 WBS2014-59 |
In this paper, we explore on the limitation of security proofs for homomorphic encryptions. We consider the computation... [more] |
IT2014-67 ISEC2014-80 WBS2014-59 pp.33-38 |
| DE | 2010-12-06 17:20 |
Tokyo | AIST Tokyo Akihabara Site | An Efficient Prevention Method of Deviation from an Anonymous Data Collection Protocol Yuya Nojima, Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) DE2010-36 |
Rational players deviate from a communication protocol when they can get more profit than one got if they follow the pro... [more] | DE2010-36 pp.61-66 |
| ISEC, SITE, IPSJ-CSEC | 2006-07-21 10:45 |
Okayama | Okayama Univ. | Asymptotic Lower Bound on Round Complexity of Bounded Concurrent Black-Box Zero-Knowledge Proof Protocols Hirofumi Muratani (Toshiba) |
We derive a lower bound on the round complexity of an $m$-bounded concurrent black-box zero-knowledge interactive proof ... [more] | ISEC2006-43 pp.19-26 |
| ISEC | 2006-05-19 16:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | General Composition of a Bounded Concurrent Black-Box Zero-Knowledge Protocol Hirofumi Muratani (TOSHIBA) |
We consider the round-complexity of an $m$-bounded concurrent black-box zero-knowledge interactive proof protocol. In th... [more] | ISEC2006-7 pp.45-52 |
| COMP | 2006-03-23 15:05 |
Tokyo | The University of Electro-Communications | Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes Yoshiharu Seri, Takeshi Koshiba (Saitama Univ.) |
We improve the upper bound on the round complexity for perfectly concealing bit commitment schemes based on the general ... [more] | COMP2005-68 pp.39-46 |
[Return to Top Page]