Abstract
In this paper, we introduce what we believe to be a novel cryptographic primitive in secure multiparty computation, called anonymous selection (AS). This cryptographic primitive involves the random and anonymous selection of one participant from a group, ensuring that no one, except the selected individual, can identify who has been chosen. The AS concept holds significant potential for simplifying complex cryptographic tasks by enabling their implementation in a sequential manner rather than a synchronous one. To develop an efficient and practical AS protocol, we first propose two new primitive protocols: a measurement-device-independent (MDI) quantum secure multiparty XOR protocol and an MDI quantum collision detection protocol. Leveraging these protocols, we construct an innovative quantum AS protocol that achieves information-theoretic security under the semi-honest model. Furthermore, we explore the practical applications of the quantum AS protocol and present a feasible quantum protocol for secure multiparty logical multiplication. Our theoretical analysis and simulation experiments collectively demonstrate the feasibility of the proposed quantum protocols.
