Pseudorandom Functions Courses and Certifications

TheIACR

Pseudorandom Functions

Explore advanced cryptographic concepts through expert presentations on pseudorandom functions from the premier Crypto 2025 conference session.

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

TheIACR

Pseudorandom Functions - Eurocrypt 2023 Session

Explore cutting-edge research on pseudorandom functions in cryptography, featuring presentations from leading experts at the prestigious Eurocrypt 2023 conference.

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

TheIACR

Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN

Explore low-noise LPN-based pseudorandom functions in almost constant depth, covering LPN hardness, randomized PRGs, and noise extraction techniques.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

TheIACR

Key-Homomorphic Pseudorandom Functions from LWE with Small Modulus

Explore key-homomorphic pseudorandom functions based on Learning With Errors, focusing on small modulus applications, security implications, and potential limitations in cryptographic systems.

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

IEEE

Correlated Pseudorandom Functions from Variable-Density LPN

Explore correlated pseudorandom functions and variable-density LPN, delving into weak PRFs, secure multi-party computation, and pseudorandom correlation generators for enhanced cryptographic security.

• YouTube
• 20 minutes
• On-Demand
• Conference Talk

TheIACR

PRFs - Pseudorandom Functions

Explore the latest research on Pseudorandom Functions (PRFs) in this Eurocrypt 2025 session chaired by Dennis Hofheinz.

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

Foundations of Cryptography, IIIT Bangalore

Master the fundamental paradigms and principles of modern cryptography through formal definitions, constructions, and security properties of cryptographic objects.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

TheIACR

Substitution-Permutation Networks, Pseudorandom Function

Explores bridging theory-practice gap in cryptography, focusing on SP-networks, cryptanalysis, and new PRF designs with quasi-linear size and simple candidates.

• YouTube
• 21 minutes
• On-Demand
• Conference Talk

TheIACR

Isogeny-Based Cryptography

Explore isogeny-based cryptography, its contributions to post-quantum security, and key concepts like radical isogenies and efficient signatures in this comprehensive overview.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

TheIACR

Physical Unclonable Functions: Machine Learning and Security Challenges

Explore machine learning applications for Physical Unclonable Functions, addressing challenges in simulation, optimization, and security while examining various attack strategies.

• YouTube
• 1 hour
• On-Demand
• Free Video

TheIACR

Zero Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash

Explore zero-knowledge arguments for lattice-based pseudorandom functions and their applications in electronic cash systems, as presented at Asiacrypt 2017.

• YouTube
• 30 minutes
• On-Demand
• Conference Talk

TheIACR

Watermarking Cryptographic Functionalities from Standard Lattice Assumptions

Explore lattice-based cryptography for watermarking pseudorandom functions, focusing on implementation, private punctured OPRS, and homomorphic matrix encoding techniques.

• YouTube
• 26 minutes
• On-Demand
• Conference Talk

TheIACR

Private Puncturable PRFs From Standard Lattice Assumptions

Explore private puncturable PRFs based on lattice assumptions, covering pseudorandom functions, distributed point functions, and learning with errors, with insights on matrix circuit encoding.

• YouTube
• 24 minutes
• On-Demand
• Conference Talk

TheIACR

The Exact PRF Security of Truncation - Tight Bounds for Keyed Sponges and Truncated CBC

Explore pseudorandom functions, HMAC, sponge construction, and truncated CBC, examining security bounds and proof challenges in cryptographic primitives.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

TheIACR

Verifiable Delegation of Computation over Large Datasets - Crypto 2011

Explore efficient verification of computations on large datasets, including high-degree polynomial functions, verifiable keyword search, and proofs of retrievability, based on cryptographic assumptions.

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