TheIACR Courses

Selective Opening Security from Simulatable Data Encapsulation

Explore advanced cryptographic concepts of selective opening security and simulatable data encapsulation in this technical talk from Asiacrypt 2016.

• YouTube
• 27 minutes
• Self-Paced
• Conference Talk

Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions

Explore advanced cryptographic techniques for secure public key encryption, focusing on efficient KDM CCA security for polynomial functions.

• YouTube
• 23 minutes
• Self-Paced
• Conference Talk

Zero Knowledge Accumulators and Set Algebra

Explore cryptographic techniques for zero-knowledge proofs, accumulators, and set operations in this advanced talk on secure data structures and privacy-preserving protocols.

• YouTube
• 24 minutes
• Self-Paced
• Conference Talk

Selective Opening Security in the Presence of Randomness Failures

Explore cryptographic security against selective opening attacks, considering scenarios with imperfect randomness generation and their implications for secure communication.

• YouTube
• 26 minutes
• Self-Paced
• Conference Talk

Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings

Explore digital signatures based on ideal lattice problems across all rings, examining their security and efficiency in cryptographic applications.

• YouTube
• 25 minutes
• Self-Paced
• Conference Talk

Collapse Binding Quantum Commitments Without Random Oracles

Explore collapse binding quantum commitments, including collapsed hash functions and techniques for hashing long messages, without relying on random oracles.

• YouTube
• 22 minutes
• Self-Paced
• Conference Talk

From 5 Pass MQ Based Identification to MQ Based Signatures

Explore the evolution from 5-pass MQ-based identification to efficient MQ-based signatures, covering conversion techniques, signature schemes, and size reduction strategies.

• YouTube
• 30 minutes
• Self-Paced
• Conference Talk

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

Explore zero-knowledge proofs for matrix-vector relations and lattice-based group encryption, covering Stern's ideas and techniques for handling quadratic relations in cryptography.

• YouTube
• 26 minutes
• Self-Paced
• Conference Talk

On the Security of Supersingular Isogeny Cryptosystems

Explore the security aspects of supersingular isogeny cryptosystems, examining potential vulnerabilities and cryptographic implications in this advanced mathematical discussion.

• YouTube
• 24 minutes
• Self-Paced
• Conference Talk

A General Polynomial Selection Method and New Asymptotic Complexities

Explore a novel polynomial selection technique and its impact on asymptotic complexities in cryptography, presented by experts at Asiacrypt 2016.

• YouTube
• 25 minutes
• Self-Paced
• Conference Talk

Faster Fully Homomorphic Encryption - Bootstrapping in Less Than 0.1 Seconds

Explore advancements in fully homomorphic encryption, focusing on accelerated bootstrapping techniques and their impact on cryptographic efficiency and security.

• YouTube
• 36 minutes
• Self-Paced
• Conference Talk

The Reality of Cryptographic Deployments on the Internet

Explore cryptographic deployments on the Internet, focusing on Diffie-Hellman key exchange, implementation flaws, policy impacts, and lessons for better security practices.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Conference Talk

When Are Fuzzy Extractors Possible

Explore the feasibility and limitations of fuzzy extractors in cryptography, examining their potential applications and theoretical foundations.

• YouTube
• 25 minutes
• Self-Paced
• Conference Talk

Linear Structures - Applications to Cryptanalysis of Round Reduced Keccak

Explore cryptanalysis techniques for round-reduced Keccak, focusing on linear structures and their applications in breaking this widely-used hash function.

• YouTube
• 30 minutes
• Self-Paced
• Conference Talk

Balloon Hashing - A Memory Hard Function Providing Provable Protection Against Sequential Attacks

Explore a memory-hard function that offers proven defense against sequential attacks, enhancing cryptographic security and computational resilience.

• YouTube
• 25 minutes
• Self-Paced
• Conference Talk