default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomoyuki Morimae
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c20]Tomoyuki Morimae, Shogo Yamada, Takashi Yamakawa:
Quantum Unpredictability. ASIACRYPT (9) 2024: 3-32- [c19]Tomoyuki Morimae, Barak Nehoran
, Takashi Yamakawa:
Unconditionally Secure Commitments with Quantum Auxiliary Inputs. CRYPTO (7) 2024: 59-92 - [c18]Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions. CRYPTO (7) 2024: 93-125 - [c17]Tomoyuki Morimae, Takashi Yamakawa:
Quantum Advantage from One-Way Functions. CRYPTO (5) 2024: 359-392 - [c16]Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Tapas Pal, Takashi Yamakawa:
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More. EUROCRYPT (3) 2024: 434-456 - [c15]Giulio Malavolta, Tomoyuki Morimae, Michael Walter, Takashi Yamakawa:
Exponential Quantum One-Wayness and EFI Pairs. SCN (1) 2024: 121-138 - [c14]Tomoyuki Morimae, Takashi Yamakawa:
One-Wayness in Quantum Cryptography. TQC 2024: 4:1-4:21 - [c13]Tomoyuki Morimae, Alexander Poremba, Takashi Yamakawa:
Revocable Quantum Digital Signatures. TQC 2024: 5:1-5:24 - [i64]Giulio Malavolta, Tomoyuki Morimae, Michael Walter, Takashi Yamakawa:
Exponential Quantum One-Wayness and EFI Pairs. CoRR abs/2404.13699 (2024) - [i63]Tomoyuki Morimae, Shogo Yamada, Takashi Yamakawa:
Quantum Unpredictability. CoRR abs/2405.04072 (2024) - [i62]Fuyuki Kitagawa, Tomoyuki Morimae, Takashi Yamakawa:
A Simple Framework for Secure Key Leasing. CoRR abs/2410.03413 (2024) - [i61]Amit Behera, Giulio Malavolta, Tomoyuki Morimae, Tamer Mour, Takashi Yamakawa:
A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID. CoRR abs/2410.03453 (2024) - [i60]Eli Goldin, Tomoyuki Morimae, Saachi Mutreja, Takashi Yamakawa:
CountCrypt: Quantum Cryptography between QCMA and PP. CoRR abs/2410.14792 (2024) - [i59]Tomoyuki Morimae, Shogo Yamada, Takashi Yamakawa:
Quantum Unpredictability. IACR Cryptol. ePrint Arch. 2024: 701 (2024) - [i58]Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa:
Cryptographic Characterization of Quantum Advantage. IACR Cryptol. ePrint Arch. 2024: 1536 (2024) - [i57]Taiga Hiroka, Tomoyuki Morimae:
Quantum Cryptography from Meta-Complexity. IACR Cryptol. ePrint Arch. 2024: 1539 (2024) - [i56]Fuyuki Kitagawa, Tomoyuki Morimae, Takashi Yamakawa:
A Simple Framework for Secure Key Leasing. IACR Cryptol. ePrint Arch. 2024: 1564 (2024) - [i55]Amit Behera, Giulio Malavolta, Tomoyuki Morimae, Tamer Mour, Takashi Yamakawa:
A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID. IACR Cryptol. ePrint Arch. 2024: 1567 (2024) - [i54]Tomoyuki Morimae, Keita Xagawa:
Quantum Group Actions. IACR Cryptol. ePrint Arch. 2024: 1578 (2024) - [i53]Eli Goldin, Tomoyuki Morimae, Saachi Mutreja, Takashi Yamakawa:
CountCrypt: Quantum Cryptography between QCMA and PP. IACR Cryptol. ePrint Arch. 2024: 1707 (2024) - 2023
- [c12]Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. EUROCRYPT (1) 2023: 639-667 - [c11]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: 32:1-32:19 - [c10]Tomoyuki Morimae, Takashi Yamakawa:
Proofs of Quantumness from Trapdoor Permutations. ITCS 2023: 87:1-87:14 - [i52]Tomoyuki Morimae, Takashi Yamakawa:
Quantum Advantage from One-Way Functions. CoRR abs/2302.04749 (2023) - [i51]Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Tapas Pal, Takashi Yamakawa:
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More. CoRR abs/2302.10354 (2023) - [i50]Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions. CoRR abs/2304.01800 (2023) - [i49]Tomoyuki Morimae, Barak Nehoran, Takashi Yamakawa:
Unconditionally Secure Commitments with Quantum Auxiliary Inputs. CoRR abs/2311.18566 (2023) - [i48]Tomoyuki Morimae, Alexander Poremba, Takashi Yamakawa:
Revocable Quantum Digital Signatures. CoRR abs/2312.13561 (2023) - [i47]Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
A Note on Output Length of One-Way State Generators. CoRR abs/2312.16025 (2023) - [i46]Tomoyuki Morimae, Takashi Yamakawa:
Quantum Advantage from One-Way Functions. IACR Cryptol. ePrint Arch. 2023: 161 (2023) - [i45]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: 236 (2023) - [i44]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: 490 (2023) - [i43]Tomoyuki Morimae, Barak Nehoran, Takashi Yamakawa:
Unconditionally Secure Commitments with Quantum Auxiliary Inputs. IACR Cryptol. ePrint Arch. 2023: 1844 (2023) - [i42]Tomoyuki Morimae, Alexander Poremba, Takashi Yamakawa:
Revocable Quantum Digital Signatures. IACR Cryptol. ePrint Arch. 2023: 1937 (2023) - 2022
- [j14]Yuki Takeuchi, Yasuhiro Takahashi, Tomoyuki Morimae, Seiichiro Tani:
Divide-and-conquer verification method for noisy intermediate-scale quantum computation. Quantum 6: 758 (2022) - [j13]Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani:
Sumcheck-based delegation of quantum computing to rational server. Theor. Comput. Sci. 924: 46-67 (2022) - [c9]Tomoyuki Morimae, Takashi Yamakawa:
Classically Verifiable NIZK for QMA with Preprocessing. ASIACRYPT (4) 2022: 599-627 - [c8]Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Certified Everlasting Zero-Knowledge Proof for QMA. CRYPTO (1) 2022: 239-268 - [c7]Tomoyuki Morimae, Takashi Yamakawa:
Quantum Commitments and Signatures Without One-Way Functions. CRYPTO (1) 2022: 269-295 - [e1]François Le Gall, Tomoyuki Morimae:
17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA. LIPIcs 232, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-237-2 [contents] - [i41]Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae:
Improved Hardness Results for the Guided Local Hamiltonian Problem. CoRR abs/2207.10250 (2022) - [i40]Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Certified Everlasting Functional Encryption. CoRR abs/2207.13878 (2022) - [i39]Tomoyuki Morimae, Takashi Yamakawa:
Proofs of Quantumness from Trapdoor Permutations. CoRR abs/2208.12390 (2022) - [i38]Tomoyuki Morimae, Takashi Yamakawa:
One-Wayness in Quantum Cryptography. CoRR abs/2210.03394 (2022) - [i37]Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. CoRR abs/2210.05978 (2022) - [i36]Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Certified Everlasting Functional Encryption. IACR Cryptol. ePrint Arch. 2022: 969 (2022) - [i35]Tomoyuki Morimae, Takashi Yamakawa:
Proofs of Quantumness from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2022: 1102 (2022) - [i34]Tomoyuki Morimae, Takashi Yamakawa:
Classically Verifiable NIZK for QMA with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 1157 (2022) - [i33]Tomoyuki Morimae, Takashi Yamakawa:
One-Wayness in Quantum Cryptography. IACR Cryptol. ePrint Arch. 2022: 1336 (2022) - [i32]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: 1375 (2022) - 2021
- [j12]Tomoyuki Morimae:
computing. Quantum Inf. Comput. 21(13&14): 1111-1134 (2021) - [c6]Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication. ASIACRYPT (1) 2021: 606-636 - [i31]Tomoyuki Morimae, Takashi Yamakawa:
Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing. CoRR abs/2102.09149 (2021) - [i30]Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication. CoRR abs/2105.05393 (2021) - [i29]Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Certified Everlasting Zero-Knowledge Proof for QMA. CoRR abs/2109.14163 (2021) - [i28]Tomoyuki Morimae, Takashi Yamakawa:
Quantum commitments and signatures without one-way functions. CoRR abs/2112.06369 (2021) - [i27]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: 617 (2021) - [i26]Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa:
Certified Everlasting Zero-Knowledge Proof for QMA. IACR Cryptol. ePrint Arch. 2021: 1315 (2021) - [i25]Tomoyuki Morimae, Takashi Yamakawa:
Quantum commitments and signatures without one-way functions. IACR Cryptol. ePrint Arch. 2021: 1691 (2021) - 2020
- [j11]Tomoyuki Morimae, Harumichi Nishimura:
Rational proofs for quantum computing. Quantum Inf. Comput. 20(3&4): 181-193 (2020) - [j10]Tomoyuki Morimae, Suguru Tamaki:
Additive-error fine-grained quantum supremacy. Quantum 4: 329 (2020) - [c5]Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani:
Sumcheck-Based Delegation of Quantum Computing to Rational Server. TAMC 2020: 69-81 - [i24]Tomoyuki Morimae:
Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center. CoRR abs/2003.10712 (2020) - [i23]Tomoyuki Morimae:
Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing. CoRR abs/2011.03141 (2020)
2010 – 2019
- 2019
- [j9]Tomoyuki Morimae, Takeshi Koshiba:
Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client. Quantum Inf. Comput. 19(3&4): 214-221 (2019) - [j8]Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani:
Impossibility of blind quantum sampling for classical client. Quantum Inf. Comput. 19(9&10): 793-806 (2019) - [j7]Tomoyuki Morimae, Suguru Tamaki:
Fine-grained quantum computational supremacy. Quantum Inf. Comput. 19(13&14): 1089-1115 (2019) - [j6]Go Sato, Takeshi Koshiba, Tomoyuki Morimae:
Arbitrable blind quantum computation. Quantum Inf. Process. 18(12): 370 (2019) - [i22]Tomoyuki Morimae, Suguru Tamaki:
Fine-grained quantum computational supremacy. CoRR abs/1901.01637 (2019) - [i21]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 abs/1902.08382 (2019) - [i20]Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani:
Sumcheck-based delegation of quantum computing to rational server. CoRR abs/1911.04734 (2019) - 2018
- [c4]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: 26:1-26:13 - [i19]Tomoyuki Morimae, Harumichi Nishimura:
Rational proofs for quantum computing. CoRR abs/1804.08868 (2018) - [i18]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 abs/1805.03385 (2018) - [i17]Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani:
Impossibility of blind quantum sampling for classical client. CoRR abs/1812.03703 (2018) - 2017
- [j5]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): 242-250 (2017) - [j4]Tomoyuki Morimae, Harumichi Nishimura:
Merlinization of complexity classes above BQP. Quantum Inf. Comput. 17(11&12): 959-972 (2017) - [i16]Tomoyuki Morimae, Harumichi Nishimura:
Merlinization of complexity classes above BQP. CoRR abs/1704.01514 (2017) - [i15]Tomoyuki Morimae:
Hardness of classically sampling one clean qubit model with constant total variation distance error. CoRR abs/1704.03640 (2017) - [i14]Tomoyuki Morimae, Yuki Takeuchi, Harumichi Nishimura:
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy. CoRR abs/1711.10605 (2017) - 2016
- [j3]Tomoyuki Morimae, Harumichi Nishimura:
Quantum interpretations of AWPP and APP. Quantum Inf. Comput. 16(5&6): 498-514 (2016) - [c3]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Power of Quantum Computation with Few Clean Qubits. ICALP 2016: 13:1-13:14 - [c2]Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura:
Space-Efficient Error Reduction for Unitary Quantum Computations. ICALP 2016: 14:1-14:14 - [i13]Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall:
Modified group non-membership is in AWPP. CoRR abs/1602.06073 (2016) - [i12]Tomoyuki Morimae:
Quantum Arthur-Merlin with single-qubit measurements. CoRR abs/1602.08656 (2016) - [i11]Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura:
Space-Efficient Error Reduction for Unitary Quantum Computations. CoRR abs/1604.08192 (2016) - [i10]Tomoyuki Morimae:
Quantum state and circuit distinguishability with single-qubit measurements. CoRR abs/1607.00574 (2016) - [i9]Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura:
Quantum Merlin-Arthur with noisy channel. CoRR abs/1608.04829 (2016) - [i8]Tomoyuki Morimae:
Finding resource states of measurement-based quantum computing is harder than quantum computing. CoRR abs/1609.00457 (2016) - [i7]Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura:
Power of one non-clean qubit. CoRR abs/1610.07244 (2016) - 2015
- [j2]Tomoyuki Morimae, Vedran Dunjko, Elham Kashefi:
Ground state blind quantum computation on AKLT state. Quantum Inf. Comput. 15(3&4): 200-234 (2015) - [j1]Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura, Keisuke Fujii:
Quantum Merlin-Arthur with Clifford Arthur. Quantum Inf. Comput. 15(15&16): 1420-1430 (2015) - [i6]Tomoyuki Morimae, Harumichi Nishimura:
Power of quantum computing with restricted postselections. CoRR abs/1502.00067 (2015) - [i5]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Power of Quantum Computation with Few Clean Qubits. CoRR abs/1509.07276 (2015) - [i4]Tomoyuki Morimae, Daniel Nagaj, Norbert Schuch:
Quantum proofs can be verified using only single qubit measurements. CoRR abs/1510.06789 (2015) - 2014
- [c1]Tomoyuki Morimae:
Basics and applications of measurement-based quantum computing. ISITA 2014: 327-330 - [i3]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Impossibility of Classically Simulating One-Clean-Qubit Computation. CoRR abs/1409.6777 (2014) - 2013
- [i2]Keisuke Fujii, Tomoyuki Morimae:
Quantum Commuting Circuits and Complexity of Ising Partition Functions. CoRR abs/1311.2128 (2013) - [i1]Tomoyuki Morimae, Keisuke Fujii, Joseph F. Fitzsimons:
On the hardness of classically simulating the one clean qubit model. CoRR abs/1312.2496 (2013)
Coauthor Index
[c20] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [i64] [i63] [i62] [i61] [i60] [i59] [i58] [i56] [i55] [i53] [c12] [c10] [i52] [i51] [i50] [i49] [i48] [i47] [i46] [i45] [i44] [i43] [i42] [c9] [c8] [c7] [i40] [i39] [i38] [i37] [i36] [i35] [i34] [i33] [i32] [c6] [i31] [i30] [i29] [i28] [i27] [i26] [i25]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
