MATH M209BCryptographic Protocols
Mathematics · 4 units · Graduate courses (200-299)
(Same as Computer Science M282B.) Consideration of advanced cryptographic protocol design and analysis. Topics include noninteractive zero-knowledge proofs; zero-knowledge arguments; concurrent and non-black-box zero-knowledge; IP=PSPACE proof, stronger notions of security for public-key encryption, including chosen-ciphertext security; secure multiparty computation; dealing with dynamic adversary; nonmalleability and composability of secure protocols; software protection; threshold cryptography; identity-based cryptography; private information retrieval; protection against man-in-middle attacks; voting protocols; identification protocols; digital cash schemes; lower bounds on use of cryptographic primitives, software obfuscation. May be repeated for credit with topic change.
Letter grading.
When it runs
- Winter 2026
- Spring 2026
- Spring 2027
Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.
Requisites
Official UCLA wording
Requisite: course M209A.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
Everything that has to come before this course, not just the courses named in the requisite above.
MATH M209B
- MATH M209ACryptography
1 direct requisite. The whole upstream is here — 1 course over 1 level. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.