Minh Thuy Truc Pham

Minh Thuy Truc Pham

Auto-generated profile, based on publicly available information

Minh Thuy Truc Pham

BTQ Technologies, Vancouver, British Columbia, Canada

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 November 2026
Verified
Conference Paper
Open access
GMGopikrishnan Muraleedharan
Gopikrishnan Muraleedharan
MPMinh Thuy Truc Pham
Minh Thuy Truc Pham
VPVir Pathak
Vir Pathak
TGThomas Gardner
Thomas Gardner
CZChuanqi Zhang
Chuanqi Zhang
GBGavin Brennen
Gavin Brennen
We provide a pre-obfuscation circuit-level implementation of an efficient one shot signature scheme, which has known applications to delegated signatures, secure token transfer, and publicly verifiable randomness. The algorithm consists of two stages: a key generation stage where a classical public key/quantum secret key pair is produced, and a signing stage where the quantum secret key is processed with a message string to produce a classical signature. There is no algorithmic error in the construction and the signed message can be efficiently checked by a classical verifier. Our scheme works by preparing a superposition over elements of a random affine coset determined by the output of a puncturable pseudorandom function, together with a circuit that tests coset membership. The logical qubit number scales like Θ(κ log(r) + n + l) and the gate complexity scales like Θ(n3 + nl), where r is the public key size, n + l is the signature size, l is the message size, and κ = Ω(n) is the cryptographic security parameter. We provide explicit qubit and gate counts before obfuscation. A secure instantiation additionally requires modified key generation and a security proof for the resulting obfuscated construction.