Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
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 |
ISEC, IPSJ-CSEC, SITE, ICSS [detail] |
2009-07-03 11:35 |
Akita |
Akita University |
Improving Efficiency of an 'On the Fly' Identification Scheme by Perfecting Zero-Knowledgeness Bagus Santoso (AIST), Kazuo Ohta, Kazuo Sakiyama (Univ. of Electro-Comm.), Goichiro Hanaoka (AIST) ISEC2009-30 SITE2009-22 ICSS2009-44 |
In this paper, we present a new methodology for constructing
an efficient identification scheme, and based on it,
we... [more] |
ISEC2009-30 SITE2009-22 ICSS2009-44 pp.161-168 |
IT, WBS, ISEC |
2005-03-17 13:50 |
Kyoto |
Kyoto Univ. |
A consideration on Randomized Partial Checking Mix Yoshikazu Hanatani, Yasuhiko Hiehata, Bagus Santoso, Noboru Kunihiro, Kazuo Ohta (UEC) |
RPC-MIX[1] guarantees the correctness of shuffle by opening the relationship of each input/output exclusively between th... [more] |
IT2004-52 ISEC2004-108 WBS2004-167 pp.13-18 |
ISEC, IPSJ-CSEC |
2004-07-20 15:10 |
Tokushima |
Tokushima Univ. |
Optimal Security Proof for PFDH under Strong Existential Unforgeability Bagus Santoso, Kazuo Ohta, Noboru Kunihiro (UEC) |
[more] |
ISEC2004-22 pp.53-60 |