Quantum anonymous selection and its applications

Area of Science:

• Cryptography
• Quantum Information Science
• Secure Multiparty Computation

Background:

• Secure multiparty computation (SMC) often requires complex synchronous protocols.
• A need exists for primitives that simplify SMC tasks, enabling sequential execution.

Purpose of the Study:

• Introduce a novel cryptographic primitive: anonymous selection (AS).
• Develop an efficient and practical quantum protocol for AS.
• Explore applications in secure multiparty computation.

Main Methods:

• Proposed two new primitive protocols: measurement-device-independent (MDI) quantum secure multiparty XOR and MDI quantum collision detection.
• Constructed a quantum AS protocol leveraging these primitives.
• Developed a quantum protocol for secure multiparty logical multiplication.

Main Results:

• Achieved information-theoretic security for the quantum AS protocol in the semi-honest model.
• Demonstrated the feasibility of the quantum AS protocol and its applications.
• Validated theoretical findings through simulation experiments.

Conclusions:

• The proposed quantum AS protocol is a novel and efficient cryptographic primitive.
• This primitive simplifies complex cryptographic tasks by allowing sequential execution.
• The developed protocols show practical potential for secure multiparty computation.