GAO audit reveals 24 major federal agencies lack adequate preparation for quantum threats to cryptography, with critical skills gaps delaying post-quantum cryptography implementation and federal system resilience.
@informaq.bsky.social
@informaq.bsky.socialGAO audit reveals 24 major federal agencies lack adequate preparation for quantum threats to cryptography, with critical skills gaps delaying post-quantum cryptography implementation and federal system resilience.
@informaq.bsky.socialSaudi Arabia's central bank (SAMA) requires financial institutions to assess quantum computing threats to encryption and develop post-quantum cryptography readiness strategies.
@informaq.bsky.socialZumo and Quantum Chain launched a partnership to provide quantum-resistant financial infrastructure for UK institutions, combining quantum-secure blockchain technology with digital asset management to address future quantum computing threats.
@informaq.bsky.socialResearchers construct succinct arguments for QMA directly from ideal hash functions, solving a major open problem and showing quantum cryptographic primitives don't require special structured assumptions.
@informaq.bsky.socialNovel restricted quantum computation model enables secure public quantum computers by limiting cryptanalytic power while preserving scientific utility through randomized inputs and single-bit outputs.
@informaq.bsky.socialEstablishes matching finite-blocklength bounds and derives capacity min{ϵ,1−ϵ} for quantum-state oblivious transfer over quantum erasure channels with rigorous information-theoretic security proofs in both honest and adversarial settings.
@informaq.bsky.socialQuantum time-lock puzzles now possible: using BB84 states, we achieve polylogarithmic generation time and T-round solving with security against polynomial-width quantum adversaries—resolving a 15-year-old open problem.
@informaq.bsky.socialThis work proves parallel repetition reduces soundness error at tight rates for all interactive arguments under homomorphic encryption, even against quantum provers. It enables constant-round succinct quantum argument constructions.
@informaq.bsky.socialQuantum protocol achieves optimal-rate certified randomness without requiring verifier randomness, advancing near-term quantum applications like randomness beacons with unconditional security proofs in the quantum random oracle model.
@informaq.bsky.socialProves parallel Kac's walk achieves rapid mixing on Stiefel manifolds in O((k+log d)log(d/ε)) steps, extending results from single quantum states to multiple orthonormal states with applications to quantum cryptography and pseudorandom unitaries.
@informaq.bsky.socialFramework for zero-knowledge certification of shared entangled states in quantum networks achieving information-theoretic security independent of computational power, extending cryptographic primitives to multiparty distributed quantum settings.
@informaq.bsky.socialQuditto enables automated, scalable emulation of hybrid QKD-PQC networks on standard infrastructure, deploying 200-node systems in ~6 minutes with secure cryptographic material management based on standardized interfaces.
@informaq.bsky.socialEstablishes tight indistinguishability bounds for sum of permutations in classical and quantum settings using Fourier analysis, with applications to PRP-to-PRF conversion and variable-output constructions like LXoP.
@informaq.bsky.socialNew noise model reveals when high-dimensional time-bin entanglement outperforms qubits for quantum key distribution. Comprehensive analysis balances temporal resolution with information capacity for optimal secure communication.
@informaq.bsky.socialQuantum leakage resilience of Shamir secret sharing established: exponentially secure against single-qubit leakage at threshold rate >73.3% with various entanglement models. Using Fourier analysis & MDS codes for quantum-resistant cryptography.
@informaq.bsky.socialFirst provably untelegraphable quantum fire in standard model using one-shot signatures. Introduces conversable fire: cloneable quantum states transmissible via interactive classical communication despite one-way untelegraphability.
@informaq.bsky.socialProves exponential lower bounds on resources adversaries need to break position-based quantum cryptography through non-local quantum computation, advancing understanding of quantum security under low-degree polynomial constraints.
@informaq.bsky.socialFirst proof that succinct quantum argument verification can rely solely on collapsing hash functions—matching classical cryptography's minimal assumptions and advancing post-quantum security for quantum computation.
@informaq.bsky.socialOrganizations can implement hybrid encryption pairing classical and post-quantum cryptographic algorithms for immediate quantum-resistant protection without complete infrastructure overhaul, allowing phased transition while maintaining operational continuity.
@informaq.bsky.socialCreotech Quantum advances Superconducting Nanowire Single-Photon Detectors to TRL 5 for European space-to-ground quantum key distribution networks and deep-space optical communications.