TheIACR Courses

Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model

Explore efficient public-key encryption based on Computational Diffie-Hellman, presented at PKC 2010. Learn about advancements in cryptographic techniques and their implications for secure communication.

• YouTube
• 21 minutes
• On-Demand
• Free Video

On the Feasibility of Consistent Computations

Explore the feasibility of consistent computations in cryptography, covering privacy, two-party security models, and complaint handling, with insights on construction and simulation.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Efficient Set Operations in the Presence of Malicious Adversaries

Explore efficient set operations with malicious adversaries, focusing on cryptographic techniques for secure multi-party computation and privacy-preserving data analysis.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval

Explore techniques to accelerate solving the discrete logarithm problem using equivalence classes, including fast inversion, distinguishing points, and random walks.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Secure Network Coding Over the Integers

Explore secure network coding techniques using integer-based methods, focusing on cryptographic applications and theoretical foundations.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Security of Encryption Schemes in Weakened Random Oracle Models

Explore encryption scheme security in weakened random oracle models, examining vulnerabilities and implications for cryptographic systems.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Explore efficient squaring techniques in cyclotomic subgroups of sixth degree extensions, with applications to pairing-based cryptography and advantages of using twists.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

Explore advanced cryptographic techniques for fully homomorphic encryption, focusing on optimizing key and ciphertext sizes for improved efficiency and practicality.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Algebraic Cryptanalysis of the PKC 2009 Algebraic Surface Cryptosystem

Explore algebraic cryptanalysis techniques applied to the PKC'2009 Algebraic Surface Cryptosystem in this concise presentation by Faugère and Spaenlehauer.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Faster Pairing Computations on Curves with High-Degree Twists

Explore faster pairing computations on curves with high-degree twists, focusing on techniques like Miller's Algorithm and sexy twists to enhance cryptographic efficiency.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Preventing Pollution Attacks in Multi-Source Network Coding

Explore strategies to safeguard multi-source network coding systems against pollution attacks, enhancing data integrity and network security.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA

Explore techniques for maximizing small root bounds through linearization, with applications to enhancing security in RSA cryptosystems using small secret exponents.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Text Search Protocols with Simulation Based Security

Explore text search protocols with simulation-based security, covering applications, automata encryption, and evaluation techniques for secure and efficient data retrieval.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions

Explore cryptographic techniques for achieving chosen-ciphertext security using slightly lossy trapdoor functions, as presented by researchers Petros Mol and Scott Yilek at PKC 2010.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments

Explore advanced cryptographic concepts: concurrent non-malleable statistically binding commitments and decommitments in constant rounds, presented by experts at PKC 2010.

• YouTube
• 20 minutes
• On-Demand
• Free Video