| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: Recent 10 Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IT | 2024-08-07 10:30 |
Okayama | Okayama University, Tsushima campus (Primary: On-site, Secondary: Online) |
Revisiting the Lossy Signature Scheme Based on DSDL Problem Tihang Wijaya, Bagus Santoso (UEC)  IT2024-20 |
In this paper, we revisit the lossy signature scheme based on Decisional Short Discrete Logarithm (DSDL) problem propose... [more] | IT2024-20 pp.36-41 |
| EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2024-07-23 14:50 |
Hokkaido | Sapporo Convention Center | Lossy Signature Scheme Based on Decisional Exact LPN Problem with Concrete Hash Encodings Arga Dhahana Pramudianto, Bagus Santoso (UEC) ISEC2024-55 SITE2024-52 BioX2024-65 HWS2024-55 ICSS2024-59 EMM2024-61 |
In this paper, we propose identification schemes based on the decisional exact LPN (XLPN) problem based on the scheme pr... [more] | ISEC2024-55 SITE2024-52 BioX2024-65 HWS2024-55 ICSS2024-59 EMM2024-61 pp.307-314 |
| RCC, ISEC, IT, WBS | 2024-03-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) | Revisiting the Soundness of 5-Pass Identification Scheme Daigo Kuroki, Kaoru Takemure, Bagus Santoso (UEC) IT2023-82 ISEC2023-81 WBS2023-70 RCC2023-64 |
We observe that mostly, the security of 5-pass identification schemes have only been analyzed in a emph{rough} way as f... [more] |
IT2023-82 ISEC2023-81 WBS2023-70 RCC2023-64 pp.44-51 |
| RCC, ISEC, IT, WBS | 2024-03-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) | Public-Key Identification Scheme Based on a New NP-Hard Tensor Problem Akitaka Yokota, Bagus Santoso (UEC) IT2023-90 ISEC2023-89 WBS2023-78 RCC2023-72 |
No general quantum algorithm is known to efficiently solve computational problems based on Multivariate Quadratic Poly... [more] |
IT2023-90 ISEC2023-89 WBS2023-78 RCC2023-72 pp.94-101 |
| SIP, IT, RCS | 2024-01-18 11:45 |
Miyagi | (Primary: On-site, Secondary: Online) |
A Proposal to Improve the Accuracy of BKW Algorithm Yuto Ko, Bagus Santoso (UEC) IT2023-41 SIP2023-74 RCS2023-216 |
The Blum-Kalai-Wasserman (BKW) algorithm is widely known as an algorithm for solving the Learning Parity with Noise (LPN... [more] | IT2023-41 SIP2023-74 RCS2023-216 pp.62-67 |
| SIP, IT, RCS | 2021-01-22 16:45 |
Online | Online | Revisiting the IND-CPA Security of LWE Encryption Scheme Takahiro Arai, Bagus Santoso, Kaoru Takemure (UEC) IT2020-111 SIP2020-89 RCS2020-202 |
In this paper, we propose a new simpler security notion which is equivalence to the standard IND-CPA notion, and base... [more] |
IT2020-111 SIP2020-89 RCS2020-202 pp.271-276 |
| QIT (2nd) |
2020-12-10 09:00 |
Online | Online | [Invited Talk]
An Introduction to Provable Secure Post-Quantum Cryptography Bagus Santoso (UEC) |
Public key cryptographic schemes are essential to guarantee the security of network communication over an untrusted comm... [more] | |
| IT | 2020-12-02 14:00 |
Online | Online | Strong Converse for Shannon Ciphers Yasutada Oohama, Bagus Santoso (UEC) IT2020-39 |
[more] | IT2020-39 pp.85-90 |
| IT, ISEC, WBS | 2019-03-07 11:45 |
Tokyo | University of Electro-Communications | A New Family of Isomorphism of Polynomials and Its Application to Public Key Encryption Scheme Bagus Santoso (UEC) IT2018-80 ISEC2018-86 WBS2018-81 |
[more] | IT2018-80 ISEC2018-86 WBS2018-81 pp.33-38 |
| IT, ISEC, WBS | 2019-03-07 12:10 |
Tokyo | University of Electro-Communications | Identification Scheme Based on the Hardness of Ideal Lattice Problems in all Rings. Kaoru Takemure, Bagus Santoso (UEC) IT2018-81 ISEC2018-87 WBS2018-82 |
Most identification schemes based on the hardness of ideal lattice problems are built upon the Ring-SIS or Ring-LWE prob... [more] | IT2018-81 ISEC2018-87 WBS2018-82 pp.39-44 |
| ISEC | 2018-09-07 14:50 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Extension of Easy-to-Understand Structure for Chosen-Ciphertext-Attack Security from Decisional Diffie-Hellman Assumption Daisuke Ueda, Bagus Santoso (UEC) ISEC2018-59 |
[more] | ISEC2018-59 pp.43-50 |
| ISEC | 2017-09-04 14:55 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | New Public Key Encryption Scheme based on Code and Multivariate Polynomials in Binary Field Tomoyuki Okubo, Bagus Santoso (UEC) ISEC2017-45 |
In this paper, we try to combine the code-based public key encryption scheme, McEliece public key encryption scheme, and... [more] | ISEC2017-45 pp.29-33 |
| ISEC | 2017-09-04 15:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Provably Secure Code-Based Signature Schemes via Fiat-Shamir Transform with Theoretical and Practical Analysis on Hash Encodings Taiyo Yamaguchi, Bagus Santoso (UEC) ISEC2017-46 |
In this paper, we propose signature schemes constructed from code-based identification scheme proposed by Stern via Fiat... [more] | ISEC2017-46 pp.35-42 |
| ISEC, WBS, IT | 2017-03-10 12:10 |
Tokyo | TOKAI University | Provable Secure Signature Scheme against Quantum Adversaries based on Decisional Isomorphism of Polynomials with Two Secrets Bagus Santoso (UEC) IT2016-122 ISEC2016-112 WBS2016-98 |
Recent research has shown that signature schemes created using Fiat-Shamir transformation might be insecure against quan... [more] | IT2016-122 ISEC2016-112 WBS2016-98 pp.149-154 |
| IT, ISEC, WBS | 2016-03-10 12:50 |
Tokyo | The University of Electro-Communications | Revisiting Isomorphism of Polynomials with Two Secrets Bagus Santoso (UEC) IT2015-112 ISEC2015-71 WBS2015-95 |
The isomorphism of polynomials with two secret (IP2S) problem is one candidate of computational assumptions for post-qua... [more] | IT2015-112 ISEC2015-71 WBS2015-95 pp.67-74 |
[Return to Top Page]