Computational Quantum Secret Sharing

Watch a conference talk from TQC 2023 (Theory of Quantum Computation, Communication and Cryptography Conference) exploring groundbreaking developments in computational quantum secret sharing (QSS). Discover how computational assumptions can significantly improve QSS schemes, enabling polynomial-time computationally-secure implementations for complex access structures that previously required exponential share sizes. Learn about a novel compiler that achieves quantum shares smaller than the secret size - a feat impossible with perfect security. Examine how these advances improve information-theoretic settings, reducing share sizes for n-party access structures to 1.5^(n+o(n)), matching classical cryptography's best results. Understand the implications for efficiently implementing access structures with limited secret copies, including functions in P and NP, presented by researcher Alper Cakan at the University of Aveiro, Portugal.