ECE 598 AM
ECE 598 AM - Ideal Funct. in Cryptography
|Ideal Funct. in Cryptography||ECE598||AM||44432||LEC||4||0930 - 1050||T R||2015 Electrical & Computer Eng Bldg||Andrew Miller|
Subject offerings of new and developing areas of knowledge in electrical and computer engineering intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: May be repeated in the same or separate terms if topics vary.
Ideal Functionalities in Cryptography. The Ideal Functionalities model (or ?Universal Composability? (UC)) is considered the gold standard for defining security in many cryptographic tasks, such as multiparty computation and zero knowledge proofs. It is a unification of property-based definitions, where instead of describing one property at a time (i.e., one game for confidentiality, one game for integrity, and so on), we give a concrete instance of an idealized program that exhibits all these properties at once. While UC is broadly adopted in cryptography, it has yet to gain traction elsewhere in software engineering and in distributed systems. The aim of this course is to explore the connections between UC in cryptography versus in other domains like fault tolerant systems, and to see what UC can offer to software engineers concerned with implementing large systems and not just modelling small primitives. Prerequisites: Cryptography (ECE/CS 407, CS/ECE 507 / CS/ECE 598 DK); Compu
- Graduate Seminar and Thesis Research