Computer Security and Cryptography

April 12 – 16, 2010
Organizers: T. Lange (Technische Universiteit Eindhoven), K. Lauter (Microsoft), J. Silverman (Brown)

Among the exciting new directions in cryptography that this one-week workshop will attempt to touch upon are the following: proliferating hardness assumptions and protocols in pairing-based cryptography; provable security and the random oracle model in theory and practice; design and selection of new cryptographic hash functions; new security models for deterministic encryption and searchable encryption; new number theoretic constructs in cryptography such as expander graphs, lattice-based systems, elliptic divisibility sequences, etc.; the trade-off between security and privacy in emerging applications such as cloud storage; new applications of pairings to areas such as e-cash and Attribute Based Encryption. A major goal of the workshop will be to foster exchanges between mathematicians working on the theoretical end of cryptography and the leading practitioners in government, finance and industry, so that each community can be more aware of the other's basic assumptions and priorities.