36 citations · 36 across the 8 of their papers we have counts for
10 papers
Universal Inductive Inference of Quantum States
Taiga Hiroka, Min-Hsiu Hsieh, Yuki Shirakawa
Solomonoff's universal inductive inference [Inf. Control. 1964] is one of the most general frameworks for learning from sequential data and predicting future observations. It provi…
Cryptographic Conditions for Efficient Testing of Distributions and Quantum States
Bruno Cavalar, Eli Goldin, Matthew Gray +3
One of the most fundamental problems in distribution testing is the identity testing problem: given samples , the goal is to determine whether the samples are drawn…
Hardness of Quantum Distribution Learning and Quantum Cryptography
Taiga Hiroka, Min-Hsiu Hsieh, Tomoyuki Morimae
The existence of one-way functions (OWFs) forms the minimal assumption in classical cryptography. However, this is not necessarily the case in quantum cryptography. One-way puzzles…
Quantum Cryptography and Meta-Complexity
Taiga Hiroka, Tomoyuki Morimae
In classical cryptography, one-way functions (OWFs) are the minimal assumption, while it is not the case in quantum cryptography. Several new primitives have been introduced such a…
Computational Complexity of Learning Efficiently Generatable Pure States
Taiga Hiroka, Min-Hsiu Hsieh
Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computatio…
Robust Combiners and Universal Constructions for Quantum Cryptography
Taiga Hiroka, Fuyuki Kitagawa, Ryo Nishimaki +1
A robust combiner combines many candidates for a cryptographic primitive and generates a new candidate for the same primitive. Its correctness and security hold as long as one of t…
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More
Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae +3
We study certified everlasting secure functional encryption (FE) and many other cryptographic primitives in this work. Certified everlasting security roughly means the following. A…
Certified Everlasting Functional Encryption
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki +1
Computational security in cryptography has a risk that computational assumptions underlying the security are broken in the future. One solution is to construct information-theoreti…
Certified Everlasting Zero-Knowledge Proof for QMA
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki +1
In known constructions of classical zero-knowledge protocols for NP, either of zero-knowledge or soundness holds only against computationally bounded adversaries. Indeed, achieving…
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki +1
Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum…