A quantum evolving secret sharing scheme
From MaRDI portal
Recommendations
Cites work
- \((t,n)\) threshold quantum secret sharing using the phase shift operation
- A resilient quantum secret sharing scheme
- Dynamic quantum secret sharing
- Dynamic quantum secret sharing by using d-dimensional GHZ state
- Dynamic quantum secret sharing protocol based on GHZ state
- Efficient simulation for quantum message authentication
- Evolving ramp secret-sharing schemes
- Evolving secret sharing: dynamic thresholds and robustness
- How to share a secret
- How to Share a Secret, Infinitely
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 5863326 (Why is no real title available?)
- Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
- Multiparty quantum secret sharing
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum lower bounds by quantum arguments
- Quantum one-time programs. (Extended abstract)
- Secure assisted quantum computation
- Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- Verifiable (t,n) threshold quantum secret sharing using d-dimensional Bell state
Cited in
(5)- Quantum multi-secret sharing via trap codes and discrete quantum walks
- Quantum attribute-based encryption: a comprehensive study
- Quantum secret sharing with identity authentication based on GHZ states entanglement swapping
- Efficient quantum multi-authority attribute-based encryption and generalizations
- A construction of evolving 3-threshold secret sharing scheme with perfect security and smaller share size
This page was built for publication: A quantum evolving secret sharing scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2024899)