7
collaborators
2021–2025
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
4 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| A Meta-Complexity Characterization of Quantum Cryptography | TQC 2025 | regular | Bruno Cavalar, Eli Goldin, Matthew Gray, Peter Hall, Tomoyuki Morimae |
| Certified Everlasting Zero-Knowledge Proof for QMA | QCRYPT 2022 | regular | Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa |
| Certified Deletion for Public Key Encryption, Zero-Knowledge, and More | QIP 2022 | plenary_short | Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa |
| Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication | QCRYPT 2021 | regular | Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa |
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 ciphertext can generate a classical certificate that the encrypted message is deleted. Although their construction is information-theoretically secure, it is limited to the setting of one-time symmetric key encryption (SKE), where a sender and receiver have to share a common key in advance and the key can be used only once. Moreover, the sender has to generate a quantum state and send it to the receiver over a quantum channel in their construction. Although deletion certificates are privately verifiable, which means a verification key for a certificate has to be kept secret, in the definition by Broadbent and Islam, we can also consider public verifiability. In this work, we present various constructions of encryption with certified deletion. - Quantum communication case: We achieve (reusable-key) public key encryption (PKE) and attribute-based encryption (ABE) with certified deletion. Our PKE scheme with certified deletion is constructed assuming the existence of IND-CPA secure PKE, and our ABE scheme with certified deletion is constructed assuming the existence of indistinguishability obfuscation and one-way function. These two schemes are privately verifiable. - Classical communication case: We also achieve PKE with certified deletion that uses only classical communication. We give two schemes, a privately verifiable one and a publicly verifiable one. The former is constructed assuming the LWE assumption in the quantum random oracle model. The latter is constructed assuming the existence of one-shot signatures and extractable witness encryption. |
|||
2 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Computational Complexity of Learning Efficiently Generatable Pure States | TQC 2025 | — |
| Certified Everlasting Functional Encryption | QIP 2023 | Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa |
Collaborators
| Co-author | Joint talks |
|---|---|
| Tomoyuki Morimae | 5 |
| Ryo Nishimaki | 4 |
| Takashi Yamakawa | 4 |
| Bruno Cavalar | 1 |
| Eli Goldin | 1 |
| Matthew Gray | 1 |
| Peter Hall | 1 |