Tetsu Iwata

Tetsu Iwata

Auto-generated profile, based on publicly available information

Tetsu Iwata

Nagoya University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 February 2019
Verified
Book Chapter
Closed access
GIGembu Ito
Gembu Ito
AHAkinori Hosoyamada
Akinori Hosoyamada
Ryutaroh MatsumotoRyutaroh Matsumoto
Ryutaroh Matsumoto
YSYu Sasaki
Yu Sasaki
TITetsu Iwata
Tetsu Iwata

19 November 2019
Verified
Book Chapter
Closed access
PDF file
BNBoyu Ni
Boyu Ni
GIGembu Ito
Gembu Ito
XDXiaoyang Dong
Xiaoyang Dong
TITetsu Iwata
Tetsu Iwata

1 August 2019
Verified
Book Chapter
Closed access
PDF file
AIAkiko Inoue
Akiko Inoue
TITetsu Iwata
Tetsu Iwata
KMKazuhiko Minematsu
Kazuhiko Minematsu
BPBertram Poettering
Bertram Poettering

19 March 2021 in IACR Transactions on Symmetric Cryptology
Verified
Journal Article
Open access
PDF file
AHAkinori Hosoyamada
Akinori Hosoyamada
TITetsu Iwata
Tetsu Iwata
Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting. Liskov, Rivest, and Wagner showed that secure tweakable block ciphers can be constructed from secure block ciphers in the classical setting. However, Kaplan et al. showed that their scheme can be broken by polynomial time quantum superposition attacks, even if underlying block ciphers are quantum-secure. Since then, it remains open if there exists a mode of block ciphers to build quantum-secure tweakable block ciphers. This paper settles the problem in the reduction-based provable security paradigm. We show the first design of quantum-secure tweakable block ciphers based on quantum-secure block ciphers, and present a provable security bound. Our construction is simple, and when instantiated with a quantum-secure n-bit block cipher, it is secure against attacks that query arbitrary quantum superpositions of plaintexts and tweaks up to O(2n/6) quantum queries. Our security proofs use the compressed oracle technique introduced by Zhandry. More precisely, we use an alternative formalization of the technique introduced by Hosoyamada and Iwata.

2 June 2017 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
KIKazuya Imamura
Kazuya Imamura
KMKazuhiko Minematsu
Kazuhiko Minematsu
TITetsu Iwata
Tetsu Iwata

12 March 2022 in IET Information Security
Verified
Journal Article
Open access
CGChun Guo
Chun Guo
TITetsu Iwata
Tetsu Iwata
KMKazuhiko Minematsu
Kazuhiko Minematsu
MDPH is a double‐block‐length hash function proposed by Naito at Latincrypt 2019. This is a combination of Hirose's compression function and the domain extender called Merkle–Damgård with permutation. When instantiated with an n ‐bit block cipher, Naito proved that this achieves the (nearly) optimal indifferentiable security bound of O ( n − log n )‐bit security. In this paper, the authors first point out that the proof of the claim contains a gap, which is related to the definition of the simulator in simulating the decryption of the block cipher. The authors then show that the proof can be fixed. The authors introduce a new simulator that addresses the issue, showing that MDPH retains its (nearly) optimal indifferentiable security bound of O ( n − log n )‐bit security.