Efficient Quantum Secret Sharing Scheme Developed for Non-Maximal Access Structures
By
[Submitted on 22 Jun 2026]
Summary
This paper addresses challenges in quantum secret sharing under non-maximal quantum access structures (QAS), specifically focusing on a structure called "hyperstar with three hyperedges." The authors characterize forbidden and intermediate sets within this QAS, define a representative element QAS as a substructure, and propose a universal, efficient, and perfect quantum secret sharing scheme. By using lightweight quantum resources and leveraging classical secret sharing as an auxiliary, the scheme reduces quantum state preparation difficulty, improves security, and enhances resource utilization efficiency.
Source
Key quotes
· 3 pulledQuantum secret sharing is one of the core security technologies in the field of quantum communication.
Aiming at the problems of high quantum resource consumption and the difficulty in balancing security and efficiency existing in current quantum secret sharing schemes under non-maximal quantum access structure(QAS)...
By deploying lightweight quantum resources to representative element access structures, the proposed scheme reduces the difficulty in quantum state preparation and distribution, and enhances its security and resource utilization efficiency.
You might also wanna read
Apple: Prepare your network for quantum-secure encryption in TLS
A Classical RAM Design That Mimics Quantum Collapse and Entanglement"
Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
Researchers Achieve Quantum Teleportation Using Standard Internet Infrastructure
German researchers have successfully demonstrated quantum teleportation using existing internet infrastructure, teleporting information betw
Exploring post-quantum signature design for Ethereum asset protection
This article explores the design space for post-quantum transaction signatures on Ethereum, focusing on protecting user assets at the execut
Comments
Sign in to join the conversation.
No comments yet. Be the first.
