Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Kohtaro Watanabe 0001

dblp:89/1433 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-9674-0924ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
code-based cryptography
0.812024
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems · IEEE Trans. Inf. Theory 2024
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.812024
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems · IEEE Trans. Inf. Theory 2024
Coding theory › error-correcting codes › decoding › iterative decoding
ADMM decoding
0.812024
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems · IEEE Trans. Inf. Theory 2024
Coding theory › error-correcting codes › decoding › iterative decoding
belief propagation
0.812024
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems · IEEE Trans. Inf. Theory 2024
Coding theory › error-correcting codes
decoding
0.812024
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems · IEEE Trans. Inf. Theory 2024
Cryptographic primitives and cryptanalysis › post-quantum cryptography › code-based cryptography
mceliece cryptosystem
0.212024
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems · IEEE Trans. Inf. Theory 2024

Methods — techniques the papers use, named apart from their topics

reproducing sum-product algorithm · 1.5alternating direction method of multipliers · 1.5
YearPublicationVenuePosition
2024 ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems
abstract
QC-MDPC (quasi cyclic moderate density parity check) code-based McEliece cryptosystems are considered to be one of the candidates for post-quantum cryptography. Decreasing DFR (decoding failure rate) is one of important factor for their security, since recent attacks to these cryptosystems effectively use DFR information. In this paper, we pursue the possibility of optimization-base decoding, concretely we examine ADMM (alternating direction method of multipliers) based method, a recent developing method in optimization theory. Further, RSPA (reproducing sum-product algorithm), which efficiently reuse outputs of SPA (sum-product algorithm) is proposed for further reduction of DFR. By numerical simulations, we show that the proposing scheme shows considerable decrement in DFR compared to the conventional decoding methods such as BF (bit-flipping algorithm) or SPA.
Kohtaro Watanabe 0001, Motonari Ohtsuka, Yuta Tsukie
IEEE Trans. Inf. Theory1
2022 Improved scheme and evaluation method for progressive visual cryptography
abstract
Abstract Visual cryptography (VC) is a powerful technique with high security and requires no PC or device to reconstruct the secret information. Progressive visual cryptography (PVC) is a variation of the VC scheme in which the quality of the reconstructed image is improved by increasing the number of shared images. The previous study focused directly on maximizing the value of the quality in the completely reconstructed image; thus, there is a difference in the quality of the shared images. In this paper, we focus on the aforementioned issue and propose a new approach based on inductive reasoning. Our basic idea is to maximize the quality of the reconstructed images each time the number of shared images increases. We call this method the bottom-up approach. Moreover, hitherto, PVC has been evaluated based on the value of relative difference or by sight. Such evaluation methods are only subjective or difficult to execute without the knowledge of basis matrices. In addition, PVC users cannot easily confirm the effectiveness of their shared images. In this paper, we propose a new information-theoretic evaluation method for PVC, which only uses shared images, to solve the aforementioned problems. Our proposed method can objectively and quantitatively evaluate PVC based on the numerical value, and PVC users can easily confirm the effectiveness of their shared images.
Binh Le Thanh Thai, Hidema Tanaka, Kohtaro Watanabe 0001
EURASIP J. Inf. Secur.3