University of Birmingham > Talks@bham > Lab Lunch > Efficient secure computation via hardware compilation

Efficient secure computation via hardware compilation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dan Ghica.

Automata representing game-semantic models of programs are meant to operate in environments whose input-output behaviour is constrained by the rules of a game. This can lead to a notion of equivalence between states which is stronger than the conventional notion of bisimulation, since not all actions are available to the environment. An environment which attempts to break the rules of the game is, effectively, mounting a low-level attack against a system. In this paper we show how (and why) to enforce game rules in games-based hardware synthesis and how to use this stronger notion of equivalence, called coherent equivalence, to aggressively minimise automata.

This talk is part of the Lab Lunch series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.