PETShop: Workshop on Language Support for Privacy Enhancing Technologies
Co-located with CCS 2013. Room B04.
Program
| 7:30 | – | 8:30 | Breakfast |
| 8:50 | – | 9:00 | Welcome |
| 9:00 | – | 10:00 | A Brief History of Practical Multi-Party Computation (Invited Talk) |
| Nigel Smart, University of Bristol, UK | |||
| In the last few years amazing progress has been made in turning the theoretical area of cryptography called Multi-Party Computation into a practical reality. In particular we can now use MPC to solve many security tasks which were thought impossible just a few years ago. In this talk I will overview this progress, and examine how far we have come in such a short space of time. | |||
| 10:00 | – | 10:30 | Session 1a: Protocols |
| Specifying Sharemind’s Arithmetic Black Box. Peeter Laud, Alisa Pankova, Martin Pettai and Jaak Randmets | |||
| 10:30 | – | 11:00 | Coffee Break |
| 11:00 | – | 12:30 | Session 1b: Protocols |
| Domain-Polymorphic Language for Privacy-Preserving Applications. Dan Bogdanov, Peeter Laud and Jaak Randmets | |||
| Pinocchio Coin: Building Zerocoin from a Succinct Pairing-based Proof System. George Danezis, Cedric Fournet, Markulf Kohlweiss and Bryan Parno | |||
| Towards an EasyCrypt Formalization of Garbling Schemes. José Carlos Bacelar Almeida, Manuel Bernardo Barbosa, Gilles Barthe, Guillaume Davy, François Dupressoir, Benjamin Grégoire and Pierre-Yves Strub | |||
| 12:30 | – | 14:00 | Lunch Break | 14:00 | – | 15:00 | Non-Interactive Secure Computation Systems (Invited Talk) |
| Benny Pinkas, Bar Ilan University, Israel | |||
| Secure computation enables parties to run a distributed computation of arbitrary functions of their private inputs while hiding everything but the final output of the computation. Protocols for secure computation are usually composed of multiple rounds of interaction. This property often limits the usability of the protocols, especially in if not all participants are guaranteed to be simultaneously online. The talk will describe the design and implementation of secure non-interactive protocols in the two-party and the multi-party settings, as well as in a web environment. | |||
| 15:00 | – | 15:30 | Session 2a: Compiler |
| Efficient Secure Computation Optimization. Raphael Urmoneit and Florian Kerschbaum | |||
| 15:30 | – | 16:00 | Coffee Break |
| 16:00 | – | 17:00 | Session 2b: Compiler |
| Lessons Learned with PCF: Scaling Secure Computation. Benjamin Kreuter and Abhi Shelat | |||
| Challenges in Compiler Construction for Secure Two-Party Computation. Andreas Holzer, Nikolaos P. Karvelas, Stefan Katzenbeisser, Helmut Veith and Martin Franz | |||
Call for Papers
To emphasize the workshop character and the focus on the discussion of open challenges, we ask for submissions of short (2 pages) work-in-progress/position papers/extended abstracts which describe applications, problems, and new ideas in the field of multi-party computation. Especially we want to encourage authors to later publish extended versions of their submissions at other venues.
Scope
Privacy enhancing technologies (PETs) are necessary when untrusted platforms compute on sensitive data, for example in a distributed setting or in cloud computing. Cryptography offers a rich set of PETs for such privacy-preserving computations, including secure multi-party computation (SMC) and zero-knowledge (ZK) protocols. These systems enable distrusting parties to collectively compute over their private inputs without revealing their data to the other parties. With the wide availability of distributed systems, social media, and cloud computing, there is a pressing need to make these technologies usable in practice. A key step towards practicality is the ability to compile from high-level languages, like C, into cryptographic protocols. Such cryptographic compilers have only recently begun to emerge, and they stand to benefit from decades of research in programming languages, compiler construction, and program verification. We believe that the concepts, methodologies, and tools developed in these areas of research can help to make cryptographic PETs practically available.
PETShop is located at the crossroads of security, programming languages, compiler construction, and program verification and aims to bring together researchers from these different communities to exchange ideas and research results to improve the practicality of state of the art cryptographic PETs. The one-day workshop will be a combination of invited talks, tutorials, tool presentations, and informal presentations.
The workshop solicits short/work-in-progress/position-papers. Submitted papers must be in ACM double-column format with at most 2 pages, including bibliography. A paper submitted to this workshop must not be in parallel submission to any other journal, magazine, conference or workshop with proceedings. It is up to the authors to decide whether a submission should be anonymous. Topics of interest include but are not limited to:
- Compiler optimizations for privacy-preserving computations, e.g., SMC or ZK protocols
- Programming language support for privacy-preserving computations
- Execution environments for privacy-preserving computations
- Experience reports, use cases, and implementations of privacy-preserving computations
- Tool demonstrations
Important Dates
| Submission Deadline: | |
| Notification of Authors: | |
| Camera ready due: | |
| Workshop: | November 4, 2013 |
Submission Instructions
Submissions will be handled via EasyChair, the link is: https://www.easychair.org/conferences/?conf=petshop2013
At least one author of each paper is expected to register and attend to present the work.
Program Chairs
| Martin Franz | Deutsche Bank |
| Andreas Holzer | Vienna University of Technology |
Organizers
| Martin Franz | Deutsche Bank |
| Andreas Holzer | Vienna University of Technology |
| Rupak Majumdar | MPI SWS Kaiserslautern |
| Bryan Parno | Microsoft Research |
| Helmut Veith | Vienna University of Technology |