A summary of a talk on a new language-agnostic approach using abstract interpretation to find critical vulnerabilities in Zero-Knowledge Proof (ZKP) programs by modeling and detecting mismatches between prover computations and verifier constraints.
Q-Day, the day a quantum computer will be powerful enough to break current encryption standards, is an inevitable threat. This summary explains how quantum algorithms like Shor’s and Grover’s will compromise both asymmetric and symmetric cryptography, the severe consequences for data confidentiality and digital trust, and why the "Harvest Now, Decrypt Later" attack vector makes immediate migration to post-quantum cryptography a critical priority for all organizations.
This video explains the imminent threat quantum computers pose to current cryptographic standards like RSA. It introduces lattice-based cryptography as a leading quantum-safe solution, using analogies to demystify how high-dimensional spaces and 'noise' create math problems that are intractable even for quantum machines. The summary provides a clear action plan for organizations, emphasizing the need for 'crypto-agility' and the urgency driven by the 'Harvest Now, Decrypt Later' attack strategy.
The talk presents CROSS and Morph, two compiler frameworks that enable existing AI accelerators, like Google's TPUs, to efficiently execute cryptographic workloads. CROSS focuses on Homomorphic Encryption (HE) and Morph on Zero-Knowledge Proofs (ZKP), demonstrating how to transform high-precision modular arithmetic into low-precision matrix operations that TPUs excel at, thereby achieving state-of-the-art performance and energy efficiency without any hardware modifications.
Author Laurentiu Spilca discusses his book 'Software Security for Developers', covering why developers avoid security, the dangers of reinventing standards like OAuth 2.0, the growing risks of AI-generated code, and the critical need to understand foundational concepts like encryption, hashing, and PKI.
This talk introduces Discrete CKKS, a framework that extends the approximate FHE scheme CKKS to support exact integer arithmetic. It achieves this through a hybrid bootstrapping technique that both cleans noise and raises the modulus, enabling a high-throughput, vectorized engine for general-purpose discrete computations on encrypted data.