"An equational approach to secure multiparty computation"
Monday, April 8, 2013, 2:00 pm
EBU3B, Room 4140
We present a novel 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.
Talk based on joint work with Stefano Tessaro. See ITCS 2013 http://dl.acm.org/citation.cfm?doid=2422436.2422478 paper.