all InfoSec news
Unconditionally secure quantum commitments with preprocessing
Dec. 1, 2023, 3:24 a.m. |
IACR News www.iacr.org
ePrint Report: Unconditionally secure quantum commitments with preprocessing
Luowen Qian
We demonstrate how to build computationally secure commitment schemes with the aid of quantum auxiliary inputs without unproven complexity assumptions. Furthermore, the quantum auxiliary input can be prepared either (1) efficiently through a trusted setup similar to the classical common random string model, or (2) strictly between the two involved parties in uniform exponential time. Classically this remains impossible without first proving $\mathsf{P} \neq \mathsf{NP}$.
aid be prepared build complexity eprint report input inputs quantum random report
More from www.iacr.org / IACR News
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants
2 days, 5 hours ago |
www.iacr.org
Securing the Future of GenAI: Policy and Technology
2 days, 5 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
CyberSOC Technical Lead
@ Integrity360 | Sandyford, Dublin, Ireland
Cyber Security Strategy Consultant
@ Capco | New York City
Cyber Security Senior Consultant
@ Capco | Chicago, IL
Sr. Product Manager
@ MixMode | Remote, US
Security Compliance Strategist
@ Grab | Petaling Jaya, Malaysia
Cloud Security Architect, Lead
@ Booz Allen Hamilton | USA, VA, McLean (1500 Tysons McLean Dr)