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

Information Processing Letters

On cryptographic anonymity and unpredictability in secret sharing

Anat Paskin-Cherniavsky, Ruxandra F. Olimid

Published May 10, 2020• 4 citations
Publisher
DOI
10.1016/j.ipl.2020.105965

Related papers

Providing Anonymity in Unconditionally Secure Secret Sharing Schemes

Mida Guillermo, Keith M. Martin, Christine M. O’Keefe

Designs Codes and Cryptography•Apr 1, 2003•13 citations

Quantum Anonymous Secret Sharing with Permutation Invariant Codes

Varin Sikand, Andrew Nemec

Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.

quant-pharXiv:2604.27284•May 1, 2026•0 citations

Anonymous secret sharing schemes

Carlo Blundo, Doug R. Stinson

Discrete Applied Mathematics•Jun 1, 1997•37 citations

A Novel Authenticated Quantum Anonymous Secret Sharing for Classical and Quantum Information

Qingle Wang, Yixi Xu, Guodong Li +4 more

Abstract Anonymous secret sharing (ASS) is an essential cryptographic concept that facilitates the sharing and reconstruction of secret information while safeguarding the identity of the involved secret receivers, which has broad applications in key management, data backup, and distributed systems. In this study, a novel authenticated quantum anonymous secret sharing (QASS) protocol that emphasizes information privacy and identity anonymity protection is proposed. Employing ‐level multipartite GHZ states as a quantum resource, one‐sided anonymous entanglement (AE) is innovatively established between the dealer and anonymous receivers, enabling the dealer to distribute a random share of secret information. Additionally, by establishing a one‐sided AE between anonymous receivers and restorer, the restorer can securely collect and reconstruct the secret information using quantum teleportation (QT). Rigorous security analysis demonstrates that protocol can resist attacks from active adversaries and potentially dishonest users. Quantum experiments on IBM Qiskit validate the correctness and feasibility of the proposed QASS protocol. This work contributes to the advancement of quantum anonymous communication, addressing the requirements for information privacy and identity anonymity in practical application environments.

Advanced Quantum Technologies•Sep 6, 2024•6 citations

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing

Divesh Aggarwal, Eldon Chung, Maciej Obremski +1 more

Lecture notes in computer science•Jan 1, 2022•1 citation

Security Notions of Secret Sharing Schemes via Different Information Measures

Chenxi Liu, Songsong Dai, Donghui Guo

Vide Leaf, Hyderabad eBooks•Jan 1, 2020•0 citations
Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.
Abstract Anonymous secret sharing (ASS) is an essential cryptographic concept that facilitates the sharing and reconstruction of secret information while safeguarding the identity of the involved secret receivers, which has broad applications in key management, data backup, and distributed systems. In this study, a novel authenticated quantum anonymous secret sharing (QASS) protocol that emphasizes information privacy and identity anonymity protection is proposed. Employing ‐level multipartite GHZ states as a quantum resource, one‐sided anonymous entanglement (AE) is innovatively established between the dealer and anonymous receivers, enabling the dealer to distribute a random share of secret information. Additionally, by establishing a one‐sided AE between anonymous receivers and restorer, the restorer can securely collect and reconstruct the secret information using quantum teleportation (QT). Rigorous security analysis demonstrates that protocol can resist attacks from active adversaries and potentially dishonest users. Quantum experiments on IBM Qiskit validate the correctness and feasibility of the proposed QASS protocol. This work contributes to the advancement of quantum anonymous communication, addressing the requirements for information privacy and identity anonymity in practical application environments.