TheIACR Courses

On the Depth of Oblivious Parallel RAM

Explore the intricacies of Oblivious Parallel RAM depth in this cryptography research presentation, delving into theoretical foundations and potential applications.

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

Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE

Explore advancements in homomorphic encryption with faster packed operations and efficient circuit bootstrapping for TFHE, enhancing privacy-preserving computations.

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

Post Quantum Security of Fiat Shamir

Explore post-quantum security implications for the Fiat-Shamir transformation, a crucial cryptographic technique, in light of potential quantum computing threats.

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

Adaptive Oblivious Transfer with Access Control from Lattice Assumptions

Explore lattice-based cryptography through an adaptive oblivious transfer protocol with access control, enhancing privacy and security in data exchange systems.

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

New Key Recovery Attacks on Minimal Two Round Even Mansour Ciphers

Explores novel key recovery techniques for minimal two-round Even-Mansour ciphers, advancing cryptanalysis methods and enhancing understanding of cipher vulnerabilities.

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

Strengthening Access Control Encryption

Explore advanced encryption techniques for enhanced access control, focusing on security, use cases, and technical implementations.

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

An Efficient Pairing Based Shuffle Argument

Explore efficient pairing-based shuffle arguments for e-voting, covering non-interactive arguments, security models, and implementation in bilinear groups.

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

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Explore advanced cryptographic techniques for secure oblivious linear function evaluation, focusing on malicious security and constant overhead improvements.

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

Towards a Classification of Non-Interactive Computational Assumptions in Cyclic Groups

Explore non-interactive computational assumptions in cyclic groups, covering families, variants, and hierarchies. Gain insights into cryptographic foundations and their classifications.

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

Automatic Search of Bit Based Division Property for ARX Ciphers and Word Based Division Property

Explore advanced cryptanalysis techniques for ARX ciphers, focusing on automatic search methods for bit-based and word-based division properties to enhance cipher security.

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

Collisions and Semi Free Start Collisions for Round Reduced RIPEMD 160

Explore cryptographic vulnerabilities in RIPEMD-160 hash function, examining collision attacks and semi-free-start collisions for reduced-round variants.

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

Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence

Explore improved security bounds for lattice-based cryptography using Rényi divergence, enhancing the analysis of cryptographic schemes and their resistance to attacks.

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

Access Control Encryption for General Policies from Standard Assumptions

Explore advanced encryption techniques for access control policies, focusing on standard assumptions and innovative constructions like divide-and-conquer and credit encryption.

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

Quantum Fully Homomorphic Encryption with Verification

Explore quantum fully homomorphic encryption with verification, a cutting-edge cryptographic technique presented at Asiacrypt 2017, offering insights into secure quantum computation.

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

Kummer for Genus One over Prime Order Fields

Explore Kummer for genus one over prime order fields, covering hybrid elliptical receiver problem, conservative setup, implementation results, and comparisons in cryptography.

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