PETShop '13Pub Date : 2013-11-04DOI: 10.1145/2517872.2517878
G. Danezis, C. Fournet, Markulf Kohlweiss, Bryan Parno
{"title":"Pinocchio coin: building zerocoin from a succinct pairing-based proof system","authors":"G. Danezis, C. Fournet, Markulf Kohlweiss, Bryan Parno","doi":"10.1145/2517872.2517878","DOIUrl":"https://doi.org/10.1145/2517872.2517878","url":null,"abstract":"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 proofs, long-standing techniques with known performance restrictions. We show a variant of the Zerocoin protocol using instead elliptic curves and bilinear pairings. The proof system makes use of modern techniques based on quadratic arithmetic programs resulting in smaller proofs and quicker verification. We remark on several extensions to Zerocoin that are enabled by the general-purpose nature of these techniques.","PeriodicalId":102689,"journal":{"name":"PETShop '13","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134009802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PETShop '13Pub Date : 2013-11-04DOI: 10.1145/2517872.2517876
Andreas Holzer, Nikolaos P. Karvelas, S. Katzenbeisser, H. Veith, M. Franz
{"title":"Challenges in compiler construction for secure two-party computation","authors":"Andreas Holzer, Nikolaos P. Karvelas, S. Katzenbeisser, H. Veith, M. Franz","doi":"10.1145/2517872.2517876","DOIUrl":"https://doi.org/10.1145/2517872.2517876","url":null,"abstract":"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 implementing Yao's \"Garbled Circuit\" solution. The latter requires circuits to implement a given functionality. Recently, the compiler CBMC-GC was introduced, the first compiler capable of translating programs written in a general purpose language (ANSI-C) into circuits suitable for secure two-party computation. In this paper, we discuss the current limitations of CBMC-GC and propose directions for future research.","PeriodicalId":102689,"journal":{"name":"PETShop '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130961889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PETShop '13Pub Date : 2013-11-04DOI: 10.1145/2517872.2517873
Raphael Urmoneit, F. Kerschbaum
{"title":"Efficient secure computation optimization","authors":"Raphael Urmoneit, F. Kerschbaum","doi":"10.1145/2517872.2517873","DOIUrl":"https://doi.org/10.1145/2517872.2517873","url":null,"abstract":"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 most larger secure computations. In this paper we present an efficient optimization algorithm that does no longer require the use of a theorem prover. For a secure computation with m statements of which n are branching statements we lower the complexity from O(2^(2^n) m) to O(m^5 2^n). Using an implementation of our algorithm we can extend automatic optimization to further examples such as the AES key schedule.","PeriodicalId":102689,"journal":{"name":"PETShop '13","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117192506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PETShop '13Pub Date : 2013-11-04DOI: 10.1145/2517872.2517874
Peeter Laud, A. Pankova, Martin Pettai, Jaak Randmets
{"title":"Specifying sharemind's arithmetic black box","authors":"Peeter Laud, A. Pankova, Martin Pettai, Jaak Randmets","doi":"10.1145/2517872.2517874","DOIUrl":"https://doi.org/10.1145/2517872.2517874","url":null,"abstract":"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 location of the compiler in the whole Sharemind protocol stack, and the results we have obtained with the system.","PeriodicalId":102689,"journal":{"name":"PETShop '13","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124974870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PETShop '13Pub Date : 2013-11-04DOI: 10.1145/2517872.2517875
D. Bogdanov, Peeter Laud, Jaak Randmets
{"title":"Domain-polymorphic language for privacy-preserving applications","authors":"D. Bogdanov, Peeter Laud, Jaak Randmets","doi":"10.1145/2517872.2517875","DOIUrl":"https://doi.org/10.1145/2517872.2517875","url":null,"abstract":"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 of data, the SecreC language allows the specification of protection domains for different pieces of data, and the specification of the computation in domain-polymorphic manner. We have implemented the compiler for the language, integrated it with the existing SMC framework Sharemind, and are currently using it for new privacy-preserving applications.","PeriodicalId":102689,"journal":{"name":"PETShop '13","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PETShop '13Pub Date : 2013-11-04DOI: 10.1145/2517872.2517880
N. Smart
{"title":"A brief history of practical multi-party computation","authors":"N. Smart","doi":"10.1145/2517872.2517880","DOIUrl":"https://doi.org/10.1145/2517872.2517880","url":null,"abstract":"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.","PeriodicalId":102689,"journal":{"name":"PETShop '13","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115396583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PETShop '13Pub Date : 2013-11-04DOI: 10.1145/2517872.2517877
Ben Kreuter, Abhi Shelat
{"title":"Lessons learned with PCF: scaling secure computation","authors":"Ben Kreuter, Abhi Shelat","doi":"10.1145/2517872.2517877","DOIUrl":"https://doi.org/10.1145/2517872.2517877","url":null,"abstract":"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 as programs that emit gates on certain state transitions. By dealing with programs rather than circuits, functions have much smaller representations, the PCF compiler is able to apply automatic optimizations to much larger functions, and the runtime system requires far less memory. We present our future plans for the PCF system and our current work-in-progress.","PeriodicalId":102689,"journal":{"name":"PETShop '13","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125599412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}