Mikito Nanashima

23 papers A* 7A 3B 1C 1Journal 11
YearRankTypeTitle / Venue / Authors
2025 J jnl
Complexity-Theoretic Inductive Inference.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Mikito Nanashima
2024 A* conf
One-Way Functions and Zero Knowledge.
STOC
Shuichi Hirahara, Mikito Nanashima
2024 J jnl
One-Way Functions and Zero Knowledge.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Mikito Nanashima
2024 A* conf
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications.
FOCS
Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima
2024 J jnl
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications.
CoRR
Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima
2024 J jnl
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima
2023 J jnl
A Duality Between One-Way Functions and Average-Case Symmetry of Information.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira
2023 J jnl
A Duality Between One-Way Functions and Average-Case Symmetry of Information.
IACR Cryptol. ePrint Arch.
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira
2023 A* conf
A Duality between One-Way Functions and Average-Case Symmetry of Information.
STOC
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira
2023 A conf
Learning Versus Pseudorandom Generators in Constant Parallel Time.
ITCS
Shuichi Hirahara, Mikito Nanashima
2023 A* conf
Learning in Pessiland via Inductive Inference.
FOCS
Shuichi Hirahara, Mikito Nanashima
2023 J jnl
Learning in Pessiland via Inductive Inference.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Mikito Nanashima
2022 A conf
Finding Errorless Pessiland in Error-Prone Heuristica.
CCC
Shuichi Hirahara, Mikito Nanashima
2022 J jnl
Learning versus Pseudorandom Generators in Constant Parallel Time.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Mikito Nanashima
2021 A* conf
A Theory of Heuristic Learnability.
COLT
Mikito Nanashima
2021 A conf
On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions.
ITCS
Mikito Nanashima
2021 A* conf
On Worst-Case Learning in Relativized Heuristica.
FOCS
Shuichi Hirahara, Mikito Nanashima
2021 J jnl
On Worst-Case Learning in Relativized Heuristica.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Mikito Nanashima
2020 B conf
A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields.
ALT
Mikito Nanashima
2020 A* conf
Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning.
COLT
Mikito Nanashima
2020 J jnl
On Basing Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions.
Electron. Colloquium Comput. Complex.
Mikito Nanashima
2019 J jnl
A Faster Algorithm Enumerating Relevant Features over Finite Fields.
CoRR
Mikito Nanashima
2018 C conf
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning.
IWOCA
Mikito Nanashima