Search

Your search keyword '"Yasunaga, Kenji"' showing total 161 results
Start Over Author "Yasunaga, Kenji"
161 results on '"Yasunaga, Kenji"'

2. Improved Bounds for Codes Correcting Insertions and Deletions

Author

Yasunaga, Kenji

Subjects
Computer Science - Information Theory
Abstract

This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and deletions and can be seen as analogous to the Elias bound in the Hamming metric. Our non-asymptotic bound is better than the existing bounds when the minimum Levenshtein distance is relatively large. The asymptotic bound exceeds the Elias and the MRRW bounds adapted from the Hamming-metric bounds for the binary and the quaternary cases. Our lower bound improves on the bound by Levenshtein, but its effect is limited and vanishes asymptotically., Comment: 13 pages, 2 fugures

Published
2021

3. Rational Broadcast Protocols Against Timid Adversaries

Author

Yamashita, Keigo, Yasunaga, Kenji, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Fu, Jie, editor, Kroupa, Tomas, editor, and Hayel, Yezekael, editor

Published
2023
Full Text
View/download PDF

4. Unified View for Notions of Bit Security

Author

Watanabe, Shun, Yasunaga, Kenji, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Guo, Jian, editor, and Steinfeld, Ron, editor

Published
2023
Full Text
View/download PDF

5. Perfectly Secure Message Transmission against Rational Adversaries

Author

Fujita, Maiki, Koshiba, Takeshi, and Yasunaga, Kenji

Subjects
Computer Science - Cryptography and Security, Computer Science - Computer Science and Game Theory
Abstract

Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple channels. An adversary can corrupt a subset of the channels and commit eavesdropping and tampering attacks over the channels. In this work, we introduce a game-theoretic security model for SMT in which adversaries have some preferences for protocol execution. We define rational "timid" adversaries who prefer to violate security requirements but do not prefer the tampering to be detected. First, we consider the basic setting where a single adversary attacks the protocol. We construct perfect SMT protocols against any rational adversary corrupting all but one of the channels. Since minority corruption is required in the traditional setting, our results demonstrate a way of circumventing the cryptographic impossibility results by a game-theoretic approach. Next, we study the setting in which all the channels can be corrupted by multiple adversaries who do not cooperate. Since we cannot hope for any security if a single adversary corrupts all the channels or multiple adversaries cooperate maliciously, the scenario can arise from a game-theoretic model. We also study the scenario in which both malicious and rational adversaries exist.

Published
2020

6. On the List Decodability of Insertions and Deletions

Author

Hayashi, Tomohiro and Yasunaga, Kenji

Subjects
Computer Science - Information Theory
Abstract

In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when insertions occur. Our bound implies that there are binary codes of rate $\Omega(1)$ that are list-decodable from a $0.707$-fraction of insertions. For any $\tau_\mathsf{I} \geq 0$ and $\tau_\mathsf{D} \in [0,1)$, there exist $q$-ary codes of rate $\Omega(1)$ that are list-decodable from a $\tau_\mathsf{I}$-fraction of insertions and $\tau_\mathsf{D}$-fraction of deletions, where $q$ depends only on $\tau_\mathsf{I}$ and $\tau_\mathsf{D}$. We also provide efficient encoding and decoding algorithms for list-decoding from $\tau_\mathsf{I}$-fraction of insertions and $\tau_\mathsf{D}$-fraction of deletions for any $\tau_\mathsf{I} \geq 0$ and $\tau_\mathsf{D} \in [0,1)$. Based on the Johnson-type bound, we derive a Plotkin-type upper bound on the code size in the Levenshtein metric.

Published
2018

7. Bit Security as Computational Cost for Winning Games with High Probability

Author

Watanabe, Shun, Yasunaga, Kenji, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Tibouchi, Mehdi, editor, and Wang, Huaxiong, editor

Published
2021
Full Text
View/download PDF

8. Error Correction by Structural Simplicity: Correcting Samplable Additive Errors

Author

Yasunaga, Kenji

Subjects
Computer Science - Information Theory
Abstract

This paper explores the possibilities and limitations of error correction by the structural simplicity of error mechanisms. Specifically, we consider channel models, called \emph{samplable additive channels}, in which (a) errors are efficiently sampled without the knowledge of the coding scheme or the transmitted codeword; (b) the entropy of the error distribution is bounded; and (c) the number of errors introduced by the channel is unbounded. For the channels, several negative and positive results are provided. Assuming the existence of one-way functions, there are samplable additive errors of entropy $n^{\epsilon}$ for $\epsilon \in (0,1)$ that are pseudorandom, and thus not correctable by efficient coding schemes. It is shown that there is an oracle algorithm that induces a samplable distribution over $\{0,1\}^n$ of entropy $m = \omega( \log n)$ that is not pseudorandom, but is uncorrectable by efficient schemes of rate less than $1 - m/n - o(1)$. The results indicate that restricting error mechanisms to be efficiently samplable and not pseudorandom is insufficient for error correction. As positive results, some conditions are provided under which efficient error correction is possible.

Published
2015

9. Perfectly Secure Message Transmission Against Independent Rational Adversaries

Author

Yasunaga, Kenji, Koshiba, Takeshi, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Alpcan, Tansu, editor, Vorobeychik, Yevgeniy, editor, Baras, John S., editor, and Dán, György, editor

Published
2019
Full Text
View/download PDF

11. Perfectly Secure Message Transmission Against Rational Timid Adversaries

Author

Fujita, Maiki, Yasunaga, Kenji, Koshiba, Takeshi, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Bushnell, Linda, editor, Poovendran, Radha, editor, and Başar, Tamer, editor

Published
2018
Full Text
View/download PDF

12. Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes

Author

Yasunaga, Kenji and Fujiwara, Toru

Subjects
Computer Science - Information Theory
Abstract

A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes, Reed-Muller codes, and random linear codes. The bound asymptotically coincides with the corresponding upper bound for Reed-Muller codes and random linear codes. By generalizing the idea of the lower bound, a lower bound on the number of uncorrectable errors for weights larger than half the minimum distance is also obtained, but the generalized lower bound is weak for large weights. The monotone error structure and its related notion larger half and trial set, which are introduced by Helleseth, Kl{\o}ve, and Levenshtein, are mainly used to derive the bounds., Comment: 5 pages, to appear in ISIT 2008

Published
2008

13. Relations between the Local Weight Distributions of a Linear Block Code, Its Extended Code, and Its Even Weight Subcode

Author

Yasunaga, Kenji and Fujiwara, Toru

Subjects
Computer Science - Information Theory
Abstract

Relations between the local weight distributions of a binary linear code, its extended code, and its even weight subcode are presented. In particular, for a code of which the extended code is transitive invariant and contains only codewords with weight multiples of four, the local weight distribution can be obtained from that of the extended code. Using the relations, the local weight distributions of the $(127,k)$ primitive BCH codes for $k\leq50$, the $(127,64)$ punctured third-order Reed-Muller, and their even weight subcodes are obtained from the local weight distribution of the $(128,k)$ extended primitive BCH codes for $k\leq50$ and the $(128,64)$ third-order Reed-Muller code. We also show an approach to improve an algorithm for computing the local weight distribution proposed before., Comment: 5 pages, 2 figures. To appear in the Proceedings of IEEE International Symposium on Information Theory, Sept. 4-9, 2005, Adelaide, Australia

Published
2005
Full Text
View/download PDF

15. Error-Correcting Codes Against Chosen-Codeword Attacks

Author

Yasunaga, Kenji, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Nascimento, Anderson C.A., editor, and Barreto, Paulo, editor

Published
2016
Full Text
View/download PDF

18. Game-Theoretic Security for Bit Commitment

Author

Higo, Haruna, Tanaka, Keisuke, Yasunaga, Kenji, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sakiyama, Kazuo, editor, and Terada, Masayuki, editor

Published
2013
Full Text
View/download PDF

19. Public-Key Encryption with Lazy Parties

Author

Yasunaga, Kenji, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Visconti, Ivan, editor, and De Prisco, Roberto, editor

Published
2012
Full Text
View/download PDF

20. Leakage-Resilience of Stateless/Stateful Public-Key Encryption from Hash Proofs

Author

Nguyen, Manh Ha, Tanaka, Keisuke, Yasunaga, Kenji, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Susilo, Willy, editor, Mu, Yi, editor, and Seberry, Jennifer, editor

Published
2012
Full Text
View/download PDF

21. A Game-Theoretic Perspective on Oblivious Transfer

Author

Higo, Haruna, Tanaka, Keisuke, Yamada, Akihiro, Yasunaga, Kenji, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Susilo, Willy, editor, Mu, Yi, editor, and Seberry, Jennifer, editor

Published
2012
Full Text
View/download PDF

22. Randomness Leakage in the KEM/DEM Framework

Author

Namiki, Hitoshi, Tanaka, Keisuke, Yasunaga, Kenji, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Boyen, Xavier, editor, and Chen, Xiaofeng, editor

Published
2011
Full Text
View/download PDF

23. Weak Oblivious Transfer from Strong One-Way Functions

Author

Tanaka, Keisuke, Yamada, Akihiro, Yasunaga, Kenji, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Boyen, Xavier, editor, and Chen, Xiaofeng, editor

Published
2011
Full Text
View/download PDF

26. Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes

Author

Yasunaga, Kenji, Fujiwara, Toru, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Boztaş, Serdar, editor, and Lu, Hsiao-Feng (Francis), editor

Published
2007
Full Text
View/download PDF

27. A comprehensive experimental and detailed chemical kinetic modelling study of 2,5-dimethylfuran pyrolysis and oxidation

Author

Somers, Kieran P., Simmie, John M., Gillespie, Fiona, Conroy, Christine, Black, Gráinne, Metcalfe, Wayne K., Battin-Leclerc, Frédérique, Dirrenberger, Patricia, Herbinet, Olivier, Glaude, Pierre-Alexandre, Dagaut, Philippe, Togbé, Casimir, Yasunaga, Kenji, Fernandes, Ravi X., Lee, Changyoul, Tripathi, Rupali, and Curran, Henry J.

Published
2013
Full Text
View/download PDF

32. Replacing Probability Distributions in Security Games via Hellinger Distance

Author

Yasunaga, Kenji

Subjects
Hellinger distance, entropy loss, Security and privacy → Cryptography, Security proof, randomness extractor, Mathematics of computing → Probability and statistics
Abstract

Security of cryptographic primitives is usually proved by assuming "ideal" probability distributions. We need to replace them with approximated "real" distributions in the real-world systems without losing the security level. We demonstrate that the Hellinger distance is useful for this problem, while the statistical distance is mainly used in the cryptographic literature. First, we show that for preserving λ-bit security of a given security game, the closeness of 2^{-λ/2} to the ideal distribution is sufficient for the Hellinger distance, whereas 2^{-λ} is generally required for the statistical distance. The result can be applied to both search and decision primitives through the bit security framework of Micciancio and Walter (Eurocrypt 2018). We also show that the Hellinger distance gives a tighter evaluation of closeness than the max-log distance when the distance is small. Finally, we show that the leftover hash lemma can be strengthened to the Hellinger distance. Namely, a universal family of hash functions gives a strong randomness extractor with optimal entropy loss for the Hellinger distance. Based on the results, a λ-bit entropy loss in randomness extractors is sufficient for preserving λ-bit security. The current understanding based on the statistical distance is that a 2λ-bit entropy loss is necessary., LIPIcs, Vol. 199, 2nd Conference on Information-Theoretic Cryptography (ITC 2021), pages 17:1-17:15

Published
2021
Full Text
View/download PDF

39. Determination of the local weight distribution of binary linear block codes

Author

Yasunaga, Kenji and Fujiwara, Toru

Subjects
Coding theory -- Analysis, Binary-coded notation -- Analysis, Computational complexity -- Analysis
Abstract

Some methods to determine the local weight distribution of binary linear codes are presented. Two approaches are studied: A computational approach and a theoretical approach. For the computational approach, an algorithm for computing the local weight distribution of codes using the automorphism group of the codes is devised. In this algorithm, a code is considered the set of cosets of a subcode, and the set of cosets is partitioned into equivalence classes. Thus, only the weight distributions of zero neighbors for each representative coset of equivalence classes are computed. For the theoretical approach, relations between the local weight distribution of a code, its extended code, and its even weight subcode are studied. As a result, the local weight distributions of some of the extended primitive Bose-Chaudhuri-Hocquenghen (BCH) codes, Reed-Muller codes, primitive BCH codes, punctured Reed-Muller codes, and even weight subcodes of primitive BCH codes and punctured Reed-Muller codes are determined. Index Terms--Automorphism group, binary linear code, coset, local weight distribution, primitive Bose-Chaudhuri-Hocquenghen (BCH) code, Reed-Muller code, zero neighbor.

Published
2006

47. Thermal Decomposition Pathways of Higher Hydrocarbons in the Gas Phase

Author

Yasunaga, Kenji, Moriyama, Hirohito, and Yamada, Hiroshi

Subjects
Shock Wave, Species Concentration Profiles, Gas-Sampling
Abstract

平成29年度衝撃波シンポジウム (2018年3月7日-9日. 東北大学片平さくらホール ）仙台市, 宮城県, (2018年3月7日-9日. 宇宙航空研究開発機構角田宇宙センター ）角田市, 宮城県, Symposium on Shock Waves in Japan, FY2017 (March 7-9, 2018. Sakura Hall), Sendai, Miyagi, (March 7-9, 2018. Kakuda Space Center, Japan Aerospace Exploration Agency (JAXA)(KSPC)), Kakuda, Miyagi, 資料番号: SA6000119051, レポート番号: 1C4-2

Published
2018

50. Pyrolysis of n-Pentane, Hexane and Heptane at High Temperatures in a Single-Pulse Shock Tube

Author

Yasunaga, Kenji

Subjects
Single-Pulse Shock Tube, GC Sampling, Chemical Kinetic Model, Pyrolysis
Abstract

平成28年度衝撃波シンポジウム (2017年3月8日-10日. ヴェルクよこすか 横須賀市立勤労福祉会館）横須賀市, 神奈川県, Symposium on Shock Waves in Japan, FY2016 (March 8-10, 2017. Werk Yokosuka), Kanagawa, Japan, 資料番号: SA6000084019, レポート番号: 1B1-1

Published
2017

Catalog

Books, media, physical & digital resources
See catalog results