Mikito Nanashima

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 20

Top Topics

Intrinsic Complexity

Languages From Positive Data

Inductive Inference

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Shuichi Hirahara, Mikito Nanashima
One-Way Functions and Zero Knowledge. STOC (2024)
Shuichi Hirahara, Mikito Nanashima
One-Way Functions and Zero Knowledge. Electron. Colloquium Comput. Complex. (2024)
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira
A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC (2023)
Shuichi Hirahara, Mikito Nanashima
Learning in Pessiland via Inductive Inference. FOCS (2023)
Shuichi Hirahara, Mikito Nanashima
Learning Versus Pseudorandom Generators in Constant Parallel Time. ITCS (2023)
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira
A Duality Between One-Way Functions and Average-Case Symmetry of Information. IACR Cryptol. ePrint Arch. 2023 (2023)
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira
A Duality Between One-Way Functions and Average-Case Symmetry of Information. Electron. Colloquium Comput. Complex. (2023)
Shuichi Hirahara, Mikito Nanashima
Learning in Pessiland via Inductive Inference. Electron. Colloquium Comput. Complex. (2023)
Shuichi Hirahara, Mikito Nanashima
On Worst-Case Learning in Relativized Heuristica. FOCS (2022)
Shuichi Hirahara, Mikito Nanashima
Learning versus Pseudorandom Generators in Constant Parallel Time. Electron. Colloquium Comput. Complex. (2022)
Shuichi Hirahara, Mikito Nanashima
Finding Errorless Pessiland in Error-Prone Heuristica. CCC (2022)
Shuichi Hirahara, Mikito Nanashima
On Worst-Case Learning in Relativized Heuristica. FOCS (2021)
Mikito Nanashima
A Theory of Heuristic Learnability. COLT (2021)
Mikito Nanashima
On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions. ITCS (2021)
Shuichi Hirahara, Mikito Nanashima
On Worst-Case Learning in Relativized Heuristica. Electron. Colloquium Comput. Complex. 28 (2021)
Mikito Nanashima
On Basing Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions. Electron. Colloquium Comput. Complex. 27 (2020)
Mikito Nanashima
A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields. ALT (2020)
Mikito Nanashima
Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning. COLT (2020)
Mikito Nanashima
A Faster Algorithm Enumerating Relevant Features over Finite Fields. CoRR (2019)
Mikito Nanashima
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning. IWOCA (2018)