Public Key Encryption and New Methods of Crypto
Explore cutting-edge encryption methods, from RSA to quantum-robust algorithms, and their impact on cybersecurity. Learn about mathematical foundations and emerging technologies in cryptography.
Quantum Cloud Computing - Prof Elham Kashefi
Explore quantum technology's impact on cloud computing, covering verification, protocols, and secure multi-party computing with Prof Elham Kashefi.
Quantum Computing and Impact On Public Key Encryption - Prof Alan Woodward
Explore quantum computing principles, their impact on encryption, and cutting-edge developments in qubit technology. Gain insights into Shor's algorithm and its implications for cryptography.
Introduction to Side-Channel Power Analysis - SCA, DPA
Learn about side-channel power analysis, its applications in encryption, and how to perform attacks. Covers basics, implementation, and real-world examples of vulnerable devices.
Fast Homomorphic Evaluation of Deep Discretized Neural Networks
Explore fast homomorphic evaluation techniques for deep discretized neural networks, focusing on digit recognition and addressing challenges in activation and dynamic message space.
Fast Large Scale Honest Majority MPC for Malicious Adversaries
Explore advanced techniques for secure multi-party computation, focusing on fast, large-scale protocols resistant to malicious adversaries. Learn about cheating detection, optimization, and efficient sum-of-products computation.
Correcting Subverted Random Oracles
Explores techniques to correct subverted random oracles in cryptography, addressing security vulnerabilities and proposing solutions for preventing attacks on hash functions and chain takeovers.
Verifiable Delay Functions
Explore verifiable delay functions, their security properties, and applications in random beacons and stock price manipulation prevention. Learn about various constructions and optimizations.
Threshold Cryptosystems From Threshold Fully Homomorphic Encryption
Explore threshold cryptosystems derived from threshold fully homomorphic encryption, covering key management, signatures, and public key encryption, with insights on security definitions and techniques.
Certified Randomness from Quantum Supremacy
Explore quantum supremacy, certified randomness, and their implications in cryptography with Scott Aaronson's insightful presentation on cutting-edge quantum computing concepts.
From Idea to Impact, the Crypto Story - What's Next?
Explore the intersection of cryptography and machine learning, examining challenges, impacts, and future directions in digital privacy, adversarial learning, and quantum resilience.
Statistical Witness Indistinguishability -and More- in Two Messages
Explore statistical witness indistinguishability in interactive proofs, focusing on reducing interaction while maintaining secrecy and statistical zero knowledge.
A New Distribution Sensitive Secure Sketch and Popularity Proportional Hashing
Explores new techniques for secure password storage and authentication, including distribution-sensitive secure sketches and popularity proportional hashing, to enhance security against online and offline attacks.
Information Theoretic Indistinguishability via the Chi Squared Method
Explore information theoretic indistinguishability using the Chi squared method, covering problem overview, description, and conclusions in cryptography research.
Indifferentiability of Iterated Even Mansour Ciphers with Non Idealized Key Schedules
Explores indifferentiability of iterated Even-Mansour ciphers with non-idealized key schedules, presenting novel approaches and strategies for enhancing block cipher security.
Key Rotation for Authenticated Encryption
Explores key rotation techniques for authenticated encryption, discussing hybrid approaches, confidentiality, secret sharing, and attack models. Analyzes performance and concludes with insights.
Ratcheted Encryption and Key Exchange - The Security of Messaging
Explore ratcheted encryption and key exchange in secure messaging, covering concepts, generic compilation, and a tricky exchange implementation with motivation and proof.
"Many-out-of-Many" Proofs and Applications to Anonymous Zether
Explore privacy-enhancing techniques for cryptocurrencies, focusing on Anonymous Zether and the innovative "Many-out-of-Many" zero-knowledge proofs, with technical insights and practical examples.
Double-Efficient ZkSNARKs Without Trusted Setup
Explores efficient zkSNARKs without trusted setup, introducing Hyrax - a new zero-knowledge argument for NP with low communication complexity and concrete costs, based on standard cryptographic assumptions.
VRAM: Faster Verifiable RAM With Program-Independent Preprocessing
Explore faster verifiable RAM with program-independent preprocessing, reducing prover's memory and time while scaling to larger computations. Optimal prover overhead and comparable performance to program-specific schemes.
Cryptographic Function Detection in Obfuscated Binaries via Bit-Precise Symbolic Loop Mapping
Explore bit-precise symbolic loop mapping for identifying cryptographic functions in obfuscated binaries, enhancing malware defense and forensics through innovative detection techniques.