2 papers
quant-ph2025
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…
quant-ph2022
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}…