Universiteit van Amsterdam

Archives

Institute for Logic, Language and Computation

Please note that this newsitem has been archived, and may contain outdated information or links.

15 April 2014, Theoretical Computer Science Seminar, Daniele Micciancio (University of California, San Diego)

Speaker: Daniele Micciancio (University of California, San Diego)
Title: An Equational Approach To Secure Computation
Date: Tuesday April 15 2014
Time: 16:00-17:00
Location: CWI room L016, Science Park 123, Amsterdam

Abstract

We present a framework for the description and analysis of secure computation protocols that is at the same time mathematically rigorous and notationally lightweight and concise. The distinguishing feature of the framework is that it allows to specify (and analyze) protocols in a manner that is largely independent of time, greatly simplifying the study of cryptographic protocols. At the notational level, protocols are described by systems of mathematical equations (over domains), and can be studied through simple algebraic manipulations like substitutions and variable elimination. The use of the framework is exemplified by applying it to the study of a classic oblivious transfer length extension protocol. The talk is based in part on joint work with Stefano Tessaro, presented at ITCS 2013.

Bio

Daniele Micciancio got his PhD from MIT in 1998 and joined the UCSD CSE faculty in 1999. He is the recipient of several awards, including an NSF CAREER award, Sloan Fellowship and Hellman Fellowship. He is most known for his research on the complexity of lattice problems and on lattice-based cryptography, but he has done influential work on various aspects of cryptography.

Please note that this newsitem has been archived, and may contain outdated information or links.