Post-Quantum Multi-Party Computation

Agarwal, Amit; Bartusek, James; Goyal, Vipul; Khurana, Dakshita; Malavolta, Giulio

doi:10.48550/arxiv.2005.12904

Search citation statements

Order By: Relevance

Paper Sections

Select...

Mpqc For Multiple Parties1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 4 (MPQC with weaker assumptions [38,44]). Assuming super-polynomial quantum hardness of LWE and quantum AFS-spooky encryption [48], there exists a MPQC secure against quantum adversaries that has a round number O(nd), where n is the number of parties and d is the circuit depth.…”

Section: Mpqc For Multiple Partiesmentioning

confidence: 99%

Constant-round Multi-party Quantum Computation for Constant Parties

Cao

2020

Preprint

View full text Add to dashboard Cite

One of the central themes in classical cryptography is multi-party computation, which performs joint computation on multiple participants' data while maintaining data privacy. The extension to the quantum regime was proposed in 2002, but despite two decades of research, the current stateof-the-art multi-party quantum computation protocol for a fixed number of parties (even 2 parties) requires unbounded rounds of communication, which greatly limit its practical usage. In this work, we propose the first constant-round multi-party quantum computation protocol for a fixed number of parties against specious adversaries, thereby significantly reducing the required number of rounds. Our work constitutes a key step towards practical implementation of secure multi-party quantum computation, and opens the door for practitioners to be involved in this exciting field. The result of our work has wide implications to quantum fidelity evaluation, quantum machine learning, quantum voting, and distributed quantum information processing.

show abstract

Section: Mpqc For Multiple Partiesmentioning

confidence: 99%

Constant-round Multi-party Quantum Computation for Constant Parties

Cao

2020

Preprint

View full text Add to dashboard Cite

show abstract

Post-Quantum Multi-Party Computation

Cited by 1 publication

References 50 publications

Constant-round Multi-party Quantum Computation for Constant Parties

Constant-round Multi-party Quantum Computation for Constant Parties

Contact Info

Product

Resources

About