6 papers
I Prove, Therefore I Am: Spatiotemporal Multi-Party Computation
Ziqing Guo, Fuyuki Kitagawa, Xiao Liang
Secure multiparty computation (MPC) enables mutually distrustful parties to compute on private digital inputs. We initiate the study of spatiotemporal MPC, extending this paradigm…
The Round Complexity of Black-Box Post-Quantum Secure Computation
Rohit Chatterjee, Xiao Liang, Omkant Pandey +1
We study the round complexity of secure multi-party computation (MPC) in the post-quantum regime. Our focus is on the fully black-box setting, where both the construction and secur…
The Black-Box Simulation Barrier Persists in a Fully Quantum World
Nai-Hui Chia, Kai-Min Chung, Xiao Liang +1
Zero-Knowledge (ZK) protocols have been intensely studied due to their fundamental importance and versatility. However, quantum information's inherent differences significantly alt…
A New Approach to Post-Quantum Non-Malleability
Xiao Liang, Omkant Pandey, Takashi Yamakawa
We provide the first - construction of post-quantum non-malleable commitments under the minimal assumption that -$\mathit{quantum}…
A Note on the Post-Quantum Security of (Ring) Signatures
Rohit Chatterjee, Kai-Min Chung, Xiao Liang +1
This work revisits the security of classical signatures and ring signatures in a quantum world. For (ordinary) signatures, we focus on the arguably preferable security notion of bl…
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round
Nai-Hui Chia, Kai-Min Chung, Xiao Liang +1
From the minimal assumption of post-quantum semi-honest oblivious transfers, we build the first -simulatable two-party computation (2PC) against quantum polynomial-time (QPT) ad…