Jiahui Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiahui Liu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Mark Zhandry
Stanford University, Stanford, USA
4 shared publications - Qipeng Liu
University of California San Diego
2 shared publications - Aayush Jain
Carnegie Mellon University, Pittsburgh, USA
1 shared publication - Aparna Gupte
Massachusetts Institute of Technology, Cambridge, USA
1 shared publication - Bhaskar Roberts
UC Berkeley
1 shared publication - Brent Waters
University of Texas at Austin
1 shared publication
Latest Publications
- Open Access
A Unified Approach to Quantum Key Leasing with a Classical Lessor
Secure key leasing allows a cryptographic key to be leased as a quantum state in such a way that the key can later be revoked in a verifiable manner. In this work, we propose a modular framework for constructing secure key leasing with a classical-lessor, where the lessor is entirely classical and, in particular, the quantum secret key can be both leased and revoked using only classical communication. Based on this framework, we obtain classical-lessor secure key leasing schemes for public-key encryption (PKE), pseudorandom function (PRF), and digital signature. We adopt the strong security notion known as security against verification key revealing attacks (VRA security) proposed by Kitagawa et al. (Eurocrypt 2025) into the classical-lessor setting, and we prove that all three of our schemes satisfy this notion under the learning with errors assumption. Our PKE scheme improves upon the previous construction by Goyal et al. (Eurocrypt 2025), and our PRF and digital signature schemes are respectively the first PRF and digital signature with classical-lessor secure key leasing property.
Open AccessA Unified Approach to Quantum Key Leasing with a Classical Lessor
Secure key leasing allows a cryptographic key to be leased as a quantum state in such a way that the key can later be revoked in a verifiable manner. In this work, we propose a modular framework for constructing secure key leasing with a classical-lessor, where the lessor is entirely classical and, in particular, the quantum secret key can be both leased and revoked using only classical communication. Based on this framework, we obtain classical-lessor secure key leasing schemes for public-key encryption (PKE), pseudorandom function (PRF), and digital signature. We adopt the strong security notion known as security against verification key revealing attacks (VRA security) proposed by Kitagawa et al. (Eurocrypt 2025) into the classical-lessor setting, and we prove that all three of our schemes satisfy this notion under the learning with errors assumption. Our PKE scheme improves upon the previous construction by Goyal et al. (Eurocrypt 2025), and our PRF and digital signature schemes are respectively the first PRF and digital signature with classical-lessor secure key leasing property.
- Open Access
- 15 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1520-1531
QMA vs QCMA and Pseudorandomness
- 15 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1520-1531
Open AccessQMA vs QCMA and Pseudorandomness
- Open Access
- 15 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 213-221
Quantum One-Time Programs, Revisited
- 15 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 213-221
Open AccessQuantum One-Time Programs, Revisited
- 28 April 2025
- Published by Springer Nature
- p. 248-277
Quantum Key Leasing for PKE and FHE with a Classical Lessor
- 28 April 2025
- Published by Springer Nature
- p. 248-277
Quantum Key Leasing for PKE and FHE with a Classical Lessor
- Open Access
Composability in Watermarking Schemes
Software watermarking allows for embedding a mark into a piece of code, such that any attempt to remove the mark will render the code useless. Provably secure watermarking schemes currently seems limited to programs computing various cryptographic operations, such as evaluating pseudorandom functions (PRFs), signing messages, or decrypting ciphertexts (the latter often going by the name ``traitor tracing''). Moreover, each of these watermarking schemes has an ad-hoc construction of its own. We observe, however, that many cryptographic objects are used as building blocks in larger protocols. We ask: just as we can compose building blocks to obtain larger protocols, can we compose watermarking schemes for the building blocks to obtain watermarking schemes for the larger protocols? We give an affirmative answer to this question, by precisely formulating a set of requirements that allow for composing watermarking schemes. We use our formulation to derive a number of applications.
Open AccessComposability in Watermarking Schemes
Software watermarking allows for embedding a mark into a piece of code, such that any attempt to remove the mark will render the code useless. Provably secure watermarking schemes currently seems limited to programs computing various cryptographic operations, such as evaluating pseudorandom functions (PRFs), signing messages, or decrypting ciphertexts (the latter often going by the name ``traitor tracing''). Moreover, each of these watermarking schemes has an ad-hoc construction of its own. We observe, however, that many cryptographic objects are used as building blocks in larger protocols. We ask: just as we can compose building blocks to obtain larger protocols, can we compose watermarking schemes for the building blocks to obtain watermarking schemes for the larger protocols? We give an affirmative answer to this question, by precisely formulating a set of requirements that allow for composing watermarking schemes. We use our formulation to derive a number of applications.
- 16 April 2023
- Published by Springer Nature
- p. 611-638
Another Round of Breaking and Making Quantum Money:
- 16 April 2023
- Published by Springer Nature
- p. 611-638
Another Round of Breaking and Making Quantum Money:
- 21 December 2022
- Published by Springer Nature
- p. 294-323
Collusion Resistant Copy-Protection for Watermarkable Functionalities
- 21 December 2022
- Published by Springer Nature
- p. 294-323
Collusion Resistant Copy-Protection for Watermarkable Functionalities
- 15 December 2021
- Published by Springer Nature
- p. 289-325
Secure Multiparty Computation in the Bounded Storage Model
- 15 December 2021
- Published by Springer Nature
- p. 289-325
Secure Multiparty Computation in the Bounded Storage Model