Tomoyuki Morimae

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 78

Top Topics

Quantum Computing

Top Venues

IACR Cryptol. ePrint Arch.

Quantum Inf. Comput.

Publications

Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions. CRYPTO (7) (2024)
Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Tapas Pal, Takashi Yamakawa
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More. EUROCRYPT (3) (2024)
Tomoyuki Morimae, Barak Nehoran, Takashi Yamakawa
Unconditionally Secure Commitments with Quantum Auxiliary Inputs. CRYPTO (7) (2024)
Tomoyuki Morimae, Shogo Yamada, Takashi Yamakawa
Quantum Unpredictability. CoRR (2024)
Tomoyuki Morimae, Alexander Poremba, Takashi Yamakawa
Revocable Quantum Digital Signatures. TQC (2024)
Tomoyuki Morimae, Takashi Yamakawa
Quantum Advantage from One-Way Functions. CRYPTO (5) (2024)
Giulio Malavolta, Tomoyuki Morimae, Michael Walter, Takashi Yamakawa
Exponential Quantum One-Wayness and EFI Pairs. CoRR (2024)
Tomoyuki Morimae, Takashi Yamakawa
One-Wayness in Quantum Cryptography. TQC (2024)
Tomoyuki Morimae, Shogo Yamada, Takashi Yamakawa
Quantum Unpredictability. IACR Cryptol. ePrint Arch. 2024 (2024)
Tomoyuki Morimae, Barak Nehoran, Takashi Yamakawa
Unconditionally Secure Commitments with Quantum Auxiliary Inputs. IACR Cryptol. ePrint Arch. 2023 (2023)
Tomoyuki Morimae, Takashi Yamakawa
Quantum Advantage from One-Way Functions. IACR Cryptol. ePrint Arch. 2023 (2023)
Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Tapas Pal, Takashi Yamakawa
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More. CoRR (2023)
Tomoyuki Morimae, Takashi Yamakawa
Proofs of Quantumness from Trapdoor Permutations. ITCS (2023)
Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Tapas Pal, Takashi Yamakawa
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More. IACR Cryptol. ePrint Arch. 2023 (2023)
Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions. CoRR (2023)
Tomoyuki Morimae, Alexander Poremba, Takashi Yamakawa
Revocable Quantum Digital Signatures. CoRR (2023)
Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa
A Note on Output Length of One-Way State Generators. CoRR (2023)
Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions. IACR Cryptol. ePrint Arch. 2023 (2023)
Tomoyuki Morimae, Takashi Yamakawa
Quantum Advantage from One-Way Functions. CoRR (2023)
Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. EUROCRYPT (1) (2023)
Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans
Improved Hardness Results for the Guided Local Hamiltonian Problem. ICALP (2023)
Tomoyuki Morimae, Barak Nehoran, Takashi Yamakawa
Unconditionally Secure Commitments with Quantum Auxiliary Inputs. CoRR (2023)
Tomoyuki Morimae, Alexander Poremba, Takashi Yamakawa
Revocable Quantum Digital Signatures. IACR Cryptol. ePrint Arch. 2023 (2023)
Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani
Sumcheck-based delegation of quantum computing to rational server. Theor. Comput. Sci. 924 (2022)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Certified Everlasting Functional Encryption. IACR Cryptol. ePrint Arch. 2022 (2022)
Tomoyuki Morimae, Takashi Yamakawa
One-Wayness in Quantum Cryptography. CoRR (2022)
Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. IACR Cryptol. ePrint Arch. 2022 (2022)
Tomoyuki Morimae, Takashi Yamakawa
Quantum Commitments and Signatures Without One-Way Functions. CRYPTO (1) (2022)
Tomoyuki Morimae, Takashi Yamakawa
Classically Verifiable NIZK for QMA with Preprocessing. IACR Cryptol. ePrint Arch. 2022 (2022)
Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. CoRR (2022)
Tomoyuki Morimae, Takashi Yamakawa
One-Wayness in Quantum Cryptography. IACR Cryptol. ePrint Arch. 2022 (2022)
Tomoyuki Morimae, Takashi Yamakawa
Proofs of Quantumness from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2022 (2022)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Certified Everlasting Zero-Knowledge Proof for QMA. CRYPTO (1) (2022)
Yuki Takeuchi, Yasuhiro Takahashi, Tomoyuki Morimae, Seiichiro Tani
Divide-and-conquer verification method for noisy intermediate-scale quantum computation. Quantum 6 (2022)
Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae
Improved Hardness Results for the Guided Local Hamiltonian Problem. CoRR (2022)
Tomoyuki Morimae, Takashi Yamakawa
Classically Verifiable NIZK for QMA with Preprocessing. ASIACRYPT (4) (2022)
Tomoyuki Morimae, Takashi Yamakawa
Proofs of Quantumness from Trapdoor Permutations. CoRR (2022)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Certified Everlasting Functional Encryption. CoRR (2022)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication. CoRR (2021)
Tomoyuki Morimae, Takashi Yamakawa
Quantum commitments and signatures without one-way functions. IACR Cryptol. ePrint Arch. 2021 (2021)
Tomoyuki Morimae, Takashi Yamakawa
Quantum commitments and signatures without one-way functions. CoRR (2021)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication. IACR Cryptol. ePrint Arch. 2021 (2021)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Certified Everlasting Zero-Knowledge Proof for QMA. CoRR (2021)
Tomoyuki Morimae
computing. Quantum Inf. Comput. 21 (13&14) (2021)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication. ASIACRYPT (1) (2021)
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
Certified Everlasting Zero-Knowledge Proof for QMA. IACR Cryptol. ePrint Arch. 2021 (2021)
Tomoyuki Morimae, Takashi Yamakawa
Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing. CoRR (2021)
Tomoyuki Morimae, Suguru Tamaki
Additive-error fine-grained quantum supremacy. Quantum 4 (2020)
Tomoyuki Morimae
Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing. CoRR (2020)
Tomoyuki Morimae
Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center. CoRR (2020)
Tomoyuki Morimae, Harumichi Nishimura
Rational proofs for quantum computing. Quantum Inf. Comput. 20 (3&4) (2020)
Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani
Sumcheck-Based Delegation of Quantum Computing to Rational Server. TAMC (2020)
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani
Impossibility of blind quantum sampling for classical client. Quantum Inf. Comput. 19 (9&10) (2019)
Go Sato, Takeshi Koshiba, Tomoyuki Morimae
Arbitrable blind quantum computation. Quantum Inf. Process. 18 (12) (2019)
Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani
Sumcheck-based delegation of quantum computing to rational server. CoRR (2019)
Tomoyuki Morimae, Suguru Tamaki
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)
Tomoyuki Morimae, Suguru Tamaki
Fine-grained quantum computational supremacy. Quantum Inf. Comput. 19 (13&14) (2019)
Tomoyuki Morimae, Suguru Tamaki
Fine-grained quantum computational supremacy. CoRR (2019)
Tomoyuki Morimae, Takeshi Koshiba
Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client. Quantum Inf. Comput. 19 (3&4) (2019)
François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. CoRR (2018)
François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. MFCS (2018)
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani
Impossibility of blind quantum sampling for classical client. CoRR (2018)
Tomoyuki Morimae, Harumichi Nishimura
Rational proofs for quantum computing. CoRR (2018)
Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall
Modified Group Non-Membership is in Promise-AWPP relative to group oracles. Quantum Inf. Comput. 17 (3&4) (2017)
Tomoyuki Morimae, Harumichi Nishimura
Merlinization of complexity classes above BQP. CoRR (2017)
Tomoyuki Morimae, Harumichi Nishimura
Merlinization of complexity classes above BQP. Quantum Inf. Comput. 17 (11&12) (2017)
Tomoyuki Morimae
Hardness of classically sampling one clean qubit model with constant total variation distance error. CoRR (2017)
Tomoyuki Morimae, Yuki Takeuchi, Harumichi Nishimura
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy. CoRR (2017)
Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura
Power of one non-clean qubit. CoRR (2016)
Tomoyuki Morimae
Finding resource states of measurement-based quantum computing is harder than quantum computing. CoRR (2016)
Tomoyuki Morimae
Quantum state and circuit distinguishability with single-qubit measurements. CoRR (2016)
Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura
Quantum Merlin-Arthur with noisy channel. CoRR (2016)
Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall
Modified group non-membership is in AWPP. CoRR (2016)
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
Space-Efficient Error Reduction for Unitary Quantum Computations. ICALP (2016)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. ICALP (2016)
Tomoyuki Morimae, Harumichi Nishimura
Quantum interpretations of AWPP and APP. Quantum Inf. Comput. 16 (5&6) (2016)
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
Space-Efficient Error Reduction for Unitary Quantum Computations. CoRR (2016)
Tomoyuki Morimae
Quantum Arthur-Merlin with single-qubit measurements. CoRR (2016)
Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura, Keisuke Fujii
Quantum Merlin-Arthur with Clifford Arthur. Quantum Inf. Comput. 15 (15&16) (2015)
Tomoyuki Morimae, Harumichi Nishimura
Power of quantum computing with restricted postselections. CoRR (2015)
Tomoyuki Morimae, Daniel Nagaj, Norbert Schuch
Quantum proofs can be verified using only single qubit measurements. CoRR (2015)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. CoRR (2015)
Tomoyuki Morimae, Vedran Dunjko, Elham Kashefi
Ground state blind quantum computation on AKLT state. Quantum Inf. Comput. 15 (3&4) (2015)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Impossibility of Classically Simulating One-Clean-Qubit Computation. CoRR (2014)
Tomoyuki Morimae
Basics and applications of measurement-based quantum computing. ISITA (2014)
Keisuke Fujii, Tomoyuki Morimae
Quantum Commuting Circuits and Complexity of Ising Partition Functions. CoRR (2013)
Tomoyuki Morimae, Keisuke Fujii, Joseph F. Fitzsimons
On the hardness of classically simulating the one clean qubit model. CoRR (2013)