Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Cryptology Conference

The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptographically from majorities

David Chaum

Published Jul 1, 1989• 21 citations
OpenAlex

Related papers

The Spymasters Double-Agent Problem

David Chaum

Springer eBooks•Nov 8, 2007•29 citations

Best of Both Worlds: Revisiting the Spymasters Double Agent Problem

Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya +1 more

Lecture notes in computer science•Jan 1, 2023•2 citations

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

Eli Ben‐Sasson, Serge Fehr, Rafail Ostrovsky

Lecture notes in computer science•Jan 1, 2012•112 citations

Symmetric cryptographic solution to Yao’s millionaires’ problem and an evaluation of secure multiparty computations

Shundong Li, Wang Daoshun, Dai Yiqi +1 more

Information Sciences•Jul 25, 2007•39 citations

Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch

Matthias Fitzi, Nicolas Gisin, Ueli M. Maurer +1 more

Lecture notes in computer science•Jan 1, 2002•41 citations

A Symmetric Extensible Protocol for Quantum Secret Sharing

Michael Ampatzis, Theodore Andronikos

This paper introduces the Symmetric Extensible Quantum Secret Sharing protocol, a novel quantum protocol for secret sharing. At its heart, it is an entanglement-based protocol that relies on the use of maximally entangled GHZ tuples, evenly distributed among the players, endowing the spymaster with the ability to securely share a secret message with the agents. Its security stems from the fact that it is highly improbable for a malicious eavesdropper or a rogue double agent to disrupt its successful execution. It is characterized by symmetry, since all agents are treated indiscriminately, utilizing identical quantum circuits. Furthermore, it can be seamlessly extended to an arbitrary number of agents. Finally, after the completion of the quantum part of the protocol, the spymaster will have to publicly transmit some information, in order to allow the agents to unlock the secret message. This part of the protocol can be considered as an additional advantage, due to the fact that it gives the spymaster the privilege of deciding if, or when, it is the right time for the agents to unlock the secret message, after the completion of the quantum part of the protocol.

arXiv:2204.13397•Symmetry•Aug 15, 2022•12 citations
This paper introduces the Symmetric Extensible Quantum Secret Sharing protocol, a novel quantum protocol for secret sharing. At its heart, it is an entanglement-based protocol that relies on the use of maximally entangled GHZ tuples, evenly distributed among the players, endowing the spymaster with the ability to securely share a secret message with the agents. Its security stems from the fact that it is highly improbable for a malicious eavesdropper or a rogue double agent to disrupt its successful execution. It is characterized by symmetry, since all agents are treated indiscriminately, utilizing identical quantum circuits. Furthermore, it can be seamlessly extended to an arbitrary number of agents. Finally, after the completion of the quantum part of the protocol, the spymaster will have to publicly transmit some information, in order to allow the agents to unlock the secret message. This part of the protocol can be considered as an additional advantage, due to the fact that it gives the spymaster the privilege of deciding if, or when, it is the right time for the agents to unlock the secret message, after the completion of the quantum part of the protocol.