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

Lecture notes in computer science

A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol

Julien P. Stern

Published Jan 1, 1998• 138 citations
Publisher
DOI
10.1007/3-540-49649-1_28

Related papers

A New Protocol for Conditional Disclosure of Secrets and Its Applications

Sven Laur, Helger Lipmaa

Lecture notes in computer science•Jan 1, 2007•36 citations

A New Protocol for Conditional Disclosure of Secrets And Its Applications.

Sven Laur, Helger Lipmaa

•Jan 1, 2005•0 citations

New Protocols for Conditional Disclosure of Secrets (and More).

Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee

Electronic colloquium on computational complexity•Jan 1, 2017•1 citation

Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols

Amos Beimel, Naty Peter

Lecture notes in computer science•Jan 1, 2018•19 citations

Evolving Conditional Disclosure of Secrets

Naty Peter

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

Unconditionally secure all-or-nothing disclosure of secrets based on POVM measurements

Yang Wei, Liusheng Huang

Secure two-party protocols are of significant research and application value. All-or-Nothing Disclosure of Secrets (ANDOS) is such a kind of cryptographic task. It involves two parties, a vendor and a buyer. The vendor, say Alice, who disposes of several secrets and is willing to sell any of them to the buyer, say Bob, with the guarantee that no information about the other secrets will be obtained. Furthermore, Bob can freely choose his secret and wants to ensure that Alice can obtain on information about which of her secrets he has picked. In this paper, we present a new quantum ANDOS scheme which achieves the same functionality, but which is of unconditional security.

International Conference on Communications•Jul 13, 2006•0 citations
Secure two-party protocols are of significant research and application value. All-or-Nothing Disclosure of Secrets (ANDOS) is such a kind of cryptographic task. It involves two parties, a vendor and a buyer. The vendor, say Alice, who disposes of several secrets and is willing to sell any of them to the buyer, say Bob, with the guarantee that no information about the other secrets will be obtained. Furthermore, Bob can freely choose his secret and wants to ensure that Alice can obtain on information about which of her secrets he has picked. In this paper, we present a new quantum ANDOS scheme which achieves the same functionality, but which is of unconditional security.