Tomoyuki Morimae
According to our database1,
Tomoyuki Morimae
authored at least 59 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID.
IACR Cryptol. ePrint Arch., 2024
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024
2023
IACR Cryptol. ePrint Arch., 2023
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions.
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
2022
Theor. Comput. Sci., 2022
Divide-and-conquer verification method for noisy intermediate-scale quantum computation.
Quantum, 2022
IACR Cryptol. ePrint Arch., 2022
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments.
IACR Cryptol. ePrint Arch., 2022
2021
IACR Cryptol. ePrint Arch., 2021
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication.
IACR Cryptol. ePrint Arch., 2021
2020
Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing.
CoRR, 2020
Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center.
CoRR, 2020
2019
Quantum Inf. Comput., 2019
Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client.
Quantum Inf. Comput., 2019
Depth-scaling fine-grained quantum supremacy based on SETH and qubit-scaling fine-grained quantum supremacy based on Orthogonal Vectors and 3-SUM.
CoRR, 2019
2018
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
2017
Quantum Inf. Comput., 2017
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy.
CoRR, 2017
Hardness of classically sampling one clean qubit model with constant total variation distance error.
CoRR, 2017
2016
Finding resource states of measurement-based quantum computing is harder than quantum computing.
CoRR, 2016
CoRR, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
2014
Proceedings of the International Symposium on Information Theory and its Applications, 2014
2013