2013 Proceeding- Program Chairs:
- Martin Franz,
- Andreas Holzer,
- Rupak Majumdar,
- Bryan Parno,
- Helmut Veith
- Sponsor:
- sigsac
It is our great pleasure to welcome you to the First Workshop on Language Support for Privacy-Enhancing Technologies -- PETShop'13. The mission of this workshop is to bring together researchers from the areas of security, programming languages, compiler construction, and program verification to exchange ideas and research results to improve the practicality of state of the art cryptographic privacy-enhancing technologies.
The workshop accepted 7 papers that cover the construction of compilers and security protocols for privacy-enhancing technologies. In addition, the program includes invited talks by Benny Pinkas and Nigel Smart. We thank the authors and invited speakers for providing the content of the program, we thank the ACM Conference on Computer and Communications Security for hosting our workshop, and we thank the Austrian National Research Network S11403 and S11405 (RiSE) of the Austrian Science Fund (FWF) for their support.
We hope that you will find this program interesting and that the workshop will provide you with an opportunity to share ideas with other researchers from various research communities.
Proceeding Downloads
A brief history of practical multi-party computation
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 ...
Challenges in compiler construction for secure two-party computation
The problem of secure two-party computation has received great attention in the years that followed its introduction by Yao. The solutions proposed follow one of the two research directions of either using homomorphic encryption techniques or ...
Lessons learned with PCF: scaling secure computation
The Portable Circuit Format (PCF) system presented by Kreuter et al.[kmsb13] addressed an important bottleneck in the tools developed by the research community for secure computation. The PCF system is based on the idea that circuits can be represented ...
Efficient secure computation optimization
Secure computation has high computational resource requirements during run-time. Secure computation optimization can lower these requirements, but has high computational resource requirements during compile-time. This prevents automatic optimization of ...
Specifying sharemind's arithmetic black box
In this paper, we discuss the design choices and initial experiences with a domain-specific language and its optimizing compiler for specifying protocols for secure computation. We give the rationale of the design, describe the translation steps, the ...
Domain-polymorphic language for privacy-preserving applications
We present SecreC, a programming language for specifying privacy-preserving applications using a mix of techniques for secure multiparty computation. Building on the concept of protection domain as an abstraction of resources used to ensure the privacy ...
Pinocchio coin: building zerocoin from a succinct pairing-based proof system
Bitcoin is the first widely adopted distributed e-cash system and Zerocoin is a recent proposal to extend Bitcoin with anonymous transactions. The original Zerocoin protocol relies heavily on the Strong RSA assumption and double-discrete logarithm ...
Index Terms
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| PETShop '13 | 8 | 7 | 88% |
| Overall | 8 | 7 | 88% |