PROGRAM
| November 29 | |
| 9:00 - 9:30 | Registration and welcome coffee |
| 9:30 - 10:30 | Session I: Side Channel Attacks and RFID
|
| 10:30 - 10:45 | Coffee break |
| 10:45 - 11:30 | Invited talk: Srdjan Capkun - 'Wireless Security gets Physical' |
| 11:30 - 12:30 | Session II: Public Key Cryptography
|
| 12:30 - 13:30 | Lunch |
| 13:30 - 14:30 | Session III: Software Security and Applications
|
| 14:30 - 14:40 | Short break |
| 14:40 - 15:25 | Invited talk: Ronald Leenes - Who needs Facebook anyway: Privacy and Sociability in social network sites |
| 15:25 - 15:45 | Coffee break |
| 15:45 - 17:45 | Session of Short Talks
|
| 19:00 | Dinner |
| November 30 | |
| 8:30 - 9:00 | Welcome coffee |
| 9:00 - 10:00 | Session IV: Secret Key Cryptography and Watermarking
|
| 10:00 - 10:45 | Invited talk: Lars Knudsen - Present Block Ciphers Erik Poll - EMV - the end of skimming? Formal analysis of the EMV protocol suite |
| 10:45 - 11:00 | Coffee break |
| 11:00 - 12:20 | Session V: Hardware Security and Privacy
|
| 12:20 - 12:30 | Closing |
| 12:30 | Lunch |
INVITED TALKS
Prof. Dr. Srdjan Capkun - 'Wireless Security gets Physical'
This talk is concerned with the impact of the physical layer and physical locations on the security of wireless networks and their applications. We discuss the problem of secure location verification, and show applications of proximity verification protocols in medical and automotive domains. We further look at the problem of anti-jamming broadcast communication and show how the limitations of the wireless channel introduce a key-establishment/anti-jamming dependency cycle; we then describe a solution that breaks this cycle that is based on novel Uncoordinated Spread Spectrum techniques.
Prof. Dr. Lars Knudsen - Present Block Ciphers
For most block cipher applications the AES is a good and preferred choice. However, AES it not well suited for extremely constrained environments such as RFID tags. Therefore, one trend in block cipher design is to find ultra-lightweight block ciphers with good security and hardware efficiency. We present the ciphers Present (from CHES 2007) and PrintCipher (from CHES 2010). Another trend in block cipher design is try to increase the efficiency by making certain components part of the secret key, e.g., to be able to reduce the number of rounds of a cipher. We outline attacks on two such proposals, C2 (presented at Crypto 2009) and the cipher Maya from Princeton.
Prof. Dr. Ronald Leenes - Who needs Facebook anyway: Privacy and Sociability in social network sites
SNSs pose a plethora of privacy issues that are reasonably well known and understood. Many issues boil down to the same problem: information makes it to the wrong audience. This problem is inherent to the design and business model of many current social network sites. How to cope with this? Two approaches seem obvious: address user behaviour and/or address the architecture of social network sites. In this presentation I will argue that the options for changing users' behaviour are limited by highlighting some of the social dynamics of SNS. Next I will focus on three areas of privacy issues: those caused by individual SNS users, those used by the SNS platform providers and those caused by the non subscribers. I will show how these issues are addressed within the EU FP7 project PrimeLife in the Clique prototype.

