TheIACR Courses

Generic-Group Delay Functions Require Hidden-Order Groups

Explores impossibility results for generic-group delay functions, demonstrating their requirement for hidden-order groups and analyzing challenges in polynomial-based emulation and equality queries.

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

Finding Hash Collisions with Quantum Computers by Using Differential Trails with Smaller Probabilities

Explore quantum computing's impact on cryptography, focusing on hash collision detection using differential trails with reduced probabilities in this cutting-edge research presentation.

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

Evolving Ramp Secret Sharing with a Small Gap

Explore advancements in ramp secret sharing schemes with a small gap, focusing on improved efficiency and security for distributed data protection.

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

Impossibility Results for Lattice-Based Functional Encryption Schemes

Explores impossibility results in lattice-based functional encryption, presenting key findings and implications for cryptographic research and applications.

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

On the Streaming Indistinguishability of a Random Permutation and a Random Function

Cryptographic analysis comparing random permutations and functions, focusing on streaming indistinguishability and introducing new techniques for memory-restricted adversaries.

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

Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications

Explores advanced cryptographic techniques, focusing on time-space tradeoffs in collision search algorithms and their applications to double encryption attacks.

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

On the Memory-Tightness of Hashed ElGamal

Explore the memory-tightness of Hashed ElGamal encryption, examining its security properties and implications for cryptographic systems.

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

On a Generalization of Substitution-Permutation Networks - The HADES Design Strategy

Explore innovative cryptographic design strategies, focusing on the HADES approach that generalizes substitution-permutation networks for enhanced security and efficiency in various applications.

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

Adaptively Secure ABE for DFA from k-Lin and More

Explore advanced cryptographic techniques for Attribute-Based Encryption, focusing on Deterministic Finite Automata and k-Linear assumptions in this research presentation.

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

OptORAMa - Optimal Oblivious RAM

Optimal Oblivious RAM techniques for enhanced data privacy, exploring tight compaction, hierarchical structures, and innovative algorithms to minimize access pattern leakage in encrypted storage systems.

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

Low Error Efficient Computational Extractors in the CRS Model

Explore efficient computational extractors with low error in the CRS model, covering weak sources, two-source extractors, and non-malleable extractors. Gain insights into cutting-edge cryptographic research.

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

Signatures from Sequential-OR Proofs

Explore innovative signature schemes using sequential-OR proofs, enhancing cryptographic security. Learn design strategies, protocols, and applications in multi-party scenarios.

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

Measure-Rewind-Measure - Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and Collision Resistance

Explore quantum cryptography proofs, focusing on One-Way to Hiding and Compressed Certificates, with improved techniques for tighter security bounds in the Random Oracle Model.

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

Efficient Simulation of Random States and Random Unitaries

Explore efficient simulation techniques for random quantum states and unitaries, covering applications, limitations, and technical contributions in quantum theory.

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

Statistical ZAPR Arguments from Bilinear Maps

Explore advanced cryptographic techniques using bilinear maps to construct statistical zero-knowledge arguments of partial knowledge with improved efficiency and security.

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