[{"publist_id":"3815","extern":1,"type":"book_chapter","author":[{"full_name":"Vicente, Sara","last_name":"Vicente","first_name":"Sara"},{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"date_updated":"2021-01-12T07:00:43Z","date_created":"2018-12-11T12:00:21Z","year":"2011","_id":"2922","publication_status":"published","status":"public","title":"Graph-cut Based Image Segmentation with Connectivity Priors","editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"publisher":"Massachusetts Institute of Technology Press","day":"01","month":"01","date_published":"2011-01-01T00:00:00Z","publication":"Markov Random Fields for Vision and Image Processing","citation":{"ama":"Vicente S, Kolmogorov V, Rother C. Graph-cut Based Image Segmentation with Connectivity Priors. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press; 2011.","apa":"Vicente, S., Kolmogorov, V., & Rother, C. (2011). Graph-cut Based Image Segmentation with Connectivity Priors. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press.","ieee":"S. Vicente, V. Kolmogorov, and C. Rother, “Graph-cut Based Image Segmentation with Connectivity Priors,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","ista":"Vicente S, Kolmogorov V, Rother C. 2011.Graph-cut Based Image Segmentation with Connectivity Priors. In: Markov Random Fields for Vision and Image Processing. .","short":"S. Vicente, V. Kolmogorov, C. Rother, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","mla":"Vicente, Sara, et al. “Graph-Cut Based Image Segmentation with Connectivity Priors.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","chicago":"Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Graph-Cut Based Image Segmentation with Connectivity Priors.” In Markov Random Fields for Vision and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011."},"quality_controlled":0},{"month":"01","day":"01","date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"citation":{"ama":"Kumar MP, Kolmogorov V, Torr P. Analyzing Convex Relaxations for MAP Estimation. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press; 2011.","ista":"Kumar MP, Kolmogorov V, Torr P. 2011.Analyzing Convex Relaxations for MAP Estimation. In: Markov Random Fields for Vision and Image Processing. .","ieee":"M. P. Kumar, V. Kolmogorov, and P. Torr, “Analyzing Convex Relaxations for MAP Estimation,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","apa":"Kumar, M. P., Kolmogorov, V., & Torr, P. (2011). Analyzing Convex Relaxations for MAP Estimation. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press.","mla":"Kumar, M. Pawan, et al. “Analyzing Convex Relaxations for MAP Estimation.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","short":"M.P. Kumar, V. Kolmogorov, P. Torr, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","chicago":"Kumar, M Pawan, Vladimir Kolmogorov, and Philip Torr. “Analyzing Convex Relaxations for MAP Estimation.” In Markov Random Fields for Vision and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011."},"publication":"Markov Random Fields for Vision and Image Processing","extern":1,"publist_id":"3814","type":"book_chapter","date_updated":"2021-01-12T07:00:43Z","date_created":"2018-12-11T12:00:21Z","author":[{"first_name":"M Pawan","last_name":"Kumar","full_name":"Kumar, M Pawan"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Philip","last_name":"Torr","full_name":"Torr, Philip H"}],"editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"first_name":"Pushmeet","last_name":"Kohli","full_name":"Kohli, Pushmeet"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"}],"publisher":"Massachusetts Institute of Technology Press","title":"Analyzing Convex Relaxations for MAP Estimation","status":"public","publication_status":"published","_id":"2923","year":"2011"},{"date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"citation":{"ieee":"A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer Segmentation of Video,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","apa":"Criminisi, A., Cross, G., Blake, A., & Kolmogorov, V. (2011). Bilayer Segmentation of Video. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press.","ista":"Criminisi A, Cross G, Blake A, Kolmogorov V. 2011.Bilayer Segmentation of Video. In: Markov Random Fields for Vision and Image Processing. .","ama":"Criminisi A, Cross G, Blake A, Kolmogorov V. Bilayer Segmentation of Video. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press; 2011.","chicago":"Criminisi, Antonio, Geoffrey Cross, Andrew Blake, and Vladimir Kolmogorov. “Bilayer Segmentation of Video.” In Markov Random Fields for Vision and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011.","short":"A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","mla":"Criminisi, Antonio, et al. “Bilayer Segmentation of Video.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011."},"publication":"Markov Random Fields for Vision and Image Processing","day":"01","month":"01","date_updated":"2021-01-12T07:00:43Z","date_created":"2018-12-11T12:00:22Z","author":[{"full_name":"Criminisi, Antonio","last_name":"Criminisi","first_name":"Antonio"},{"last_name":"Cross","first_name":"Geoffrey","full_name":"Cross, Geoffrey"},{"full_name":"Blake, Andrew","last_name":"Blake","first_name":"Andrew"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"}],"publisher":"Massachusetts Institute of Technology Press","editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"first_name":"Pushmeet","last_name":"Kohli","full_name":"Kohli, Pushmeet"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"}],"title":"Bilayer Segmentation of Video","status":"public","publication_status":"published","year":"2011","_id":"2924","extern":1,"publist_id":"3813","type":"book_chapter"},{"year":"2011","_id":"2925","editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"publisher":"Massachusetts Institute of Technology Press","status":"public","title":"Interactive Foreground Extraction using graph cut","publication_status":"published","author":[{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"full_name":"Boykov, Yuri","first_name":"Yuri","last_name":"Boykov"},{"full_name":"Blake, Andrew","first_name":"Andrew","last_name":"Blake"}],"date_updated":"2021-01-12T07:00:44Z","date_created":"2018-12-11T12:00:22Z","type":"book_chapter","publist_id":"3812","extern":1,"citation":{"chicago":"Rother, Carsten, Vladimir Kolmogorov, Yuri Boykov, and Andrew Blake. “Interactive Foreground Extraction Using Graph Cut.” In Markov Random Fields for Vision and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011.","short":"C. Rother, V. Kolmogorov, Y. Boykov, A. Blake, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","mla":"Rother, Carsten, et al. “Interactive Foreground Extraction Using Graph Cut.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","ieee":"C. Rother, V. Kolmogorov, Y. Boykov, and A. Blake, “Interactive Foreground Extraction using graph cut,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","apa":"Rother, C., Kolmogorov, V., Boykov, Y., & Blake, A. (2011). Interactive Foreground Extraction using graph cut. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press.","ista":"Rother C, Kolmogorov V, Boykov Y, Blake A. 2011.Interactive Foreground Extraction using graph cut. In: Markov Random Fields for Vision and Image Processing. .","ama":"Rother C, Kolmogorov V, Boykov Y, Blake A. Interactive Foreground Extraction using graph cut. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press; 2011."},"publication":"Markov Random Fields for Vision and Image Processing","quality_controlled":0,"date_published":"2011-01-01T00:00:00Z","day":"01","month":"01"},{"month":"07","day":"22","date_published":"2011-07-22T00:00:00Z","publication":"Markov Random Fields for Vision and Image Processing","citation":{"ista":"Boykov Y, Kolmogorov V. 2011.Basic graph cut algorithms. In: Markov Random Fields for Vision and Image Processing. , 31–50.","apa":"Boykov, Y., & Kolmogorov, V. (2011). Basic graph cut algorithms. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields for Vision and Image Processing (pp. 31–50). Massachusetts Institute of Technology Press.","ieee":"Y. Boykov and V. Kolmogorov, “Basic graph cut algorithms,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011, pp. 31–50.","ama":"Boykov Y, Kolmogorov V. Basic graph cut algorithms. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image Processing. Massachusetts Institute of Technology Press; 2011:31-50.","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” In Markov Random Fields for Vision and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother, 31–50. Massachusetts Institute of Technology Press, 2011.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011, pp. 31–50.","short":"Y. Boykov, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011, pp. 31–50."},"quality_controlled":0,"page":"31 - 50","publist_id":"3801","extern":1,"type":"book_chapter","author":[{"full_name":"Boykov, Yuri","last_name":"Boykov","first_name":"Yuri"},{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T07:39:53Z","date_created":"2018-12-11T12:00:26Z","year":"2011","_id":"2935","publication_status":"published","status":"public","title":"Basic graph cut algorithms","editor":[{"full_name":"Blake, Andrew","first_name":"Andrew","last_name":"Blake"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"}],"publisher":"Massachusetts Institute of Technology Press"},{"type":"journal_article","extern":1,"publist_id":"3764","issue":"1","abstract":[{"text":"Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specic phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher's exact test. To\nperform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs).","lang":"eng"}],"publisher":"Public Knowledge Project","intvolume":" 2","title":"Detecting epistasis via Markov bases","publication_status":"published","status":"public","year":"2011","_id":"2961","acknowledgement":"Anna-Sapfo Malaspinas is supported by a Janggen-Poehn Fellowship. Caroline Uhler is supported by an International Fulbright Science and Technology Fellowship.","volume":2,"date_created":"2018-12-11T12:00:34Z","date_updated":"2021-01-12T07:40:05Z","author":[{"full_name":"Malaspinas, Anna-Sapfo ","first_name":"Anna","last_name":"Malaspinas"},{"full_name":"Caroline Uhler","last_name":"Uhler","first_name":"Caroline","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"}],"month":"01","day":"01","page":"36 - 53","quality_controlled":0,"oa":1,"citation":{"apa":"Malaspinas, A., & Uhler, C. (2011). Detecting epistasis via Markov bases. Journal of Algebraic Statistics. Public Knowledge Project. http://dx.doi.org/10.18409/jas.v2i1.27","ieee":"A. Malaspinas and C. Uhler, “Detecting epistasis via Markov bases,” Journal of Algebraic Statistics, vol. 2, no. 1. Public Knowledge Project, pp. 36–53, 2011.","ista":"Malaspinas A, Uhler C. 2011. Detecting epistasis via Markov bases. Journal of Algebraic Statistics. 2(1), 36–53.","ama":"Malaspinas A, Uhler C. Detecting epistasis via Markov bases. Journal of Algebraic Statistics. 2011;2(1):36-53. doi:http://dx.doi.org/10.18409/jas.v2i1.27","chicago":"Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.” Journal of Algebraic Statistics. Public Knowledge Project, 2011. http://dx.doi.org/10.18409/jas.v2i1.27.","short":"A. Malaspinas, C. Uhler, Journal of Algebraic Statistics 2 (2011) 36–53.","mla":"Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.” Journal of Algebraic Statistics, vol. 2, no. 1, Public Knowledge Project, 2011, pp. 36–53, doi:http://dx.doi.org/10.18409/jas.v2i1.27."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.4929"}],"publication":"Journal of Algebraic Statistics","date_published":"2011-01-01T00:00:00Z","doi":"http://dx.doi.org/10.18409/jas.v2i1.27"},{"type":"conference","abstract":[{"lang":"eng","text":"Traditional statistical methods for the confidentiality protection for statistical databases do not scale well to deal with GWAS (genome-wide association studies) databases and external information on them. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual's privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially private approach to penalized logistic regression."}],"publist_id":"3766","extern":1,"year":"2011","_id":"2960","status":"public","publication_status":"published","title":"Privacy Preserving GWAS Data Sharing","publisher":"IEEE","author":[{"last_name":"Fienberg","first_name":"Stephen","full_name":"Fienberg, Stephen E"},{"first_name":"Aleksandra","last_name":"Slavkovic","full_name":"Slavkovic, Aleksandra"},{"full_name":"Caroline Uhler","first_name":"Caroline","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216"}],"date_updated":"2021-01-12T07:40:05Z","date_created":"2018-12-11T12:00:34Z","day":"01","month":"01","citation":{"chicago":"Fienberg, Stephen, Aleksandra Slavkovic, and Caroline Uhler. “Privacy Preserving GWAS Data Sharing.” IEEE, 2011. https://doi.org/10.1109/ICDMW.2011.140.","short":"S. Fienberg, A. Slavkovic, C. Uhler, in:, IEEE, 2011.","mla":"Fienberg, Stephen, et al. Privacy Preserving GWAS Data Sharing. IEEE, 2011, doi:10.1109/ICDMW.2011.140.","apa":"Fienberg, S., Slavkovic, A., & Uhler, C. (2011). Privacy Preserving GWAS Data Sharing. Presented at the Proceedings of the 11th IEEE International Conference on Data Mining, IEEE. https://doi.org/10.1109/ICDMW.2011.140","ieee":"S. Fienberg, A. Slavkovic, and C. Uhler, “Privacy Preserving GWAS Data Sharing,” presented at the Proceedings of the 11th IEEE International Conference on Data Mining, 2011.","ista":"Fienberg S, Slavkovic A, Uhler C. 2011. Privacy Preserving GWAS Data Sharing. Proceedings of the 11th IEEE International Conference on Data Mining.","ama":"Fienberg S, Slavkovic A, Uhler C. Privacy Preserving GWAS Data Sharing. In: IEEE; 2011. doi:10.1109/ICDMW.2011.140"},"quality_controlled":0,"conference":{"name":"Proceedings of the 11th IEEE International Conference on Data Mining"},"doi":"10.1109/ICDMW.2011.140","date_published":"2011-01-01T00:00:00Z"},{"conference":{"name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"doi":"10.1007/978-3-642-25385-0","date_published":"2011-11-21T00:00:00Z","quality_controlled":0,"page":"449 - 467","citation":{"ama":"Camenisch J, Krenn S, Shoup V. A Framework for Practical Universally Composable Zero-Knowledge Protocols. In: Lee D, Wang X, eds. Vol 7073. Springer; 2011:449-467. doi:10.1007/978-3-642-25385-0","ista":"Camenisch J, Krenn S, Shoup V. 2011. A Framework for Practical Universally Composable Zero-Knowledge Protocols. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7073, 449–467.","ieee":"J. Camenisch, S. Krenn, and V. Shoup, “A Framework for Practical Universally Composable Zero-Knowledge Protocols,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, 2011, vol. 7073, pp. 449–467.","apa":"Camenisch, J., Krenn, S., & Shoup, V. (2011). A Framework for Practical Universally Composable Zero-Knowledge Protocols. In D. Lee & X. Wang (Eds.) (Vol. 7073, pp. 449–467). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Springer. https://doi.org/10.1007/978-3-642-25385-0","mla":"Camenisch, Jan, et al. A Framework for Practical Universally Composable Zero-Knowledge Protocols. Edited by Dong Lee and Xiaoyun Wang, vol. 7073, Springer, 2011, pp. 449–67, doi:10.1007/978-3-642-25385-0.","short":"J. Camenisch, S. Krenn, V. Shoup, in:, D. Lee, X. Wang (Eds.), Springer, 2011, pp. 449–467.","chicago":"Camenisch, Jan, Stephan Krenn, and Victor Shoup. “A Framework for Practical Universally Composable Zero-Knowledge Protocols.” edited by Dong Lee and Xiaoyun Wang, 7073:449–67. Springer, 2011. https://doi.org/10.1007/978-3-642-25385-0."},"main_file_link":[{"url":"http://eprint.iacr.org/2011/228.pdf","open_access":"0"}],"month":"11","day":"21","date_created":"2018-12-11T12:00:39Z","date_updated":"2021-01-12T07:40:11Z","volume":7073,"author":[{"full_name":"Camenisch, Jan","last_name":"Camenisch","first_name":"Jan"},{"full_name":"Stephan Krenn","last_name":"Krenn","first_name":"Stephan","orcid":"0000-0003-2835-9093","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Shoup, Victor","last_name":"Shoup","first_name":"Victor"}],"publication_status":"published","title":"A Framework for Practical Universally Composable Zero-Knowledge Protocols","status":"public","publisher":"Springer","intvolume":" 7073","editor":[{"first_name":"Dong","last_name":"Lee","full_name":"Lee, Dong Hoon"},{"full_name":"Wang, Xiaoyun","first_name":"Xiaoyun","last_name":"Wang"}],"_id":"2975","acknowledgement":"This work was in part funded by the Swiss Hasler Foundation, and the EU FP7 grants 216483 and 216499, as well as by the NSF grant CNS-0716690.","year":"2011","extern":1,"abstract":[{"lang":"eng","text":"Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. Recently, Camenisch, Kiayias, and Yung provided a specification language (the CKY-language) for such protocols which allows for a modular design and protocol analysis: for every zero-knowledge proof specified in this language, protocol designers are ensured that there exists an efficient protocol which indeed proves the specified statement.\n\nHowever, the protocols resulting from their compilation techniques only satisfy the classical notion of ZK-PoK, which is not retained are when they used as building blocks for higher-level applications or composed with other protocols.\nThis problem can be tackled by moving to the Universal Composability (UC) framework, which guarantees retention of security when composing protocols in arbitrary ways. \nWhile there exist generic transformations from $\\Sigma$-protocols to UC-secure protocols, these transformation are often too inefficient for practice.\n \nIn this paper we introduce a specification language akin to the CKY-language and a compiler such that the resulting protocols are UC-secure and efficient. \nTo this end, we propose an extension of the UC-framework addressing the \nissue that UC-secure zero-knowledge proofs are by definition proofs of knowledge, and state a special composition theorem which allows one to use the weaker -- but more efficient and often sufficient -- notion of proofs of membership in the UC-framework. \nWe believe that our contributions enable the design of practically efficient protocols that are UC-secure and thus themselves can be used as building blocks."}],"publist_id":"3728","alternative_title":["LNCS"],"type":"conference"},{"date_updated":"2021-01-12T07:40:12Z","date_created":"2018-12-11T12:00:39Z","author":[{"first_name":"Endre","last_name":"Bangerter","full_name":"Bangerter, Endre"},{"full_name":"Stephan Krenn","first_name":"Stephan","last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093"},{"full_name":"Seifriz, Martial","first_name":"Martial","last_name":"Seifriz"},{"full_name":"Ultes-Nitsche, Ulrich","first_name":"Ulrich","last_name":"Ultes Nitsche"}],"title":"cPLC - A Cryptographic Programming Language and Compiler","publication_status":"published","status":"public","publisher":"IEEE","editor":[{"full_name":"Venter, Hein S.","first_name":"Hein","last_name":"Venter"},{"full_name":"Coetzee, Marijke","first_name":"Marijke","last_name":"Coetzee"},{"last_name":"Loock","first_name":"Marianne","full_name":"Loock, Marianne"}],"_id":"2977","acknowledgement":"This work was in part funded by the European Community’s Seventh Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler Foundation under projects no. 09037 and 10069.","year":"2011","extern":1,"abstract":[{"lang":"eng","text":"Cryptographic two-party protocols are used ubiquitously in\n everyday life. While some of these protocols are easy to\n understand and implement (e.g., key exchange or transmission of\n encrypted data), many of them are much more complex (e.g.,\n e-banking and e-voting applications, or anonymous authentication\n and credential systems).\n\n For a software engineer without appropriate cryptographic skills\n the implementation of such protocols is often difficult, time\n consuming and error-prone. For this reason, a number of compilers\n supporting programmers have been published in recent\n years. However, they are either designed for very specific\n cryptographic primitives (e.g., zero-knowledge proofs of\n knowledge), or they only offer a very low level of abstraction and\n thus again demand substantial mathematical and cryptographic\n skills from the programmer. Finally, some of the existing\n compilers do not produce executable code, but only metacode which\n has to be instantiated with mathematical libraries, encryption\n routines, etc. before it can actually be used.\n \n In this paper we present a cryptographically aware compiler which\n is equally useful to cryptographers who want to benchmark\n protocols designed on paper, and to programmers who want to\n implement complex security sensitive protocols without having to\n understand all subtleties. Our tool offers a high level of\n abstraction and outputs well-structured and documented Java\n code. We believe that our compiler can contribute to shortening\n the development cycles of cryptographic applications and to\n reducing their error-proneness."}],"publist_id":"3726","type":"conference","conference":{"name":"ISSA: Information Security South Africa"},"date_published":"2011-08-01T00:00:00Z","doi":"10.1109/ISSA.2011.6027533","quality_controlled":0,"citation":{"chicago":"Bangerter, Endre, Stephan Krenn, Martial Seifriz, and Ulrich Ultes Nitsche. “CPLC - A Cryptographic Programming Language and Compiler.” edited by Hein Venter, Marijke Coetzee, and Marianne Loock. IEEE, 2011. https://doi.org/10.1109/ISSA.2011.6027533.","short":"E. Bangerter, S. Krenn, M. Seifriz, U. Ultes Nitsche, in:, H. Venter, M. Coetzee, M. Loock (Eds.), IEEE, 2011.","mla":"Bangerter, Endre, et al. CPLC - A Cryptographic Programming Language and Compiler. Edited by Hein Venter et al., IEEE, 2011, doi:10.1109/ISSA.2011.6027533.","ieee":"E. Bangerter, S. Krenn, M. Seifriz, and U. Ultes Nitsche, “cPLC - A Cryptographic Programming Language and Compiler,” presented at the ISSA: Information Security South Africa, 2011.","apa":"Bangerter, E., Krenn, S., Seifriz, M., & Ultes Nitsche, U. (2011). cPLC - A Cryptographic Programming Language and Compiler. In H. Venter, M. Coetzee, & M. Loock (Eds.). Presented at the ISSA: Information Security South Africa, IEEE. https://doi.org/10.1109/ISSA.2011.6027533","ista":"Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. 2011. cPLC - A Cryptographic Programming Language and Compiler. ISSA: Information Security South Africa.","ama":"Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. cPLC - A Cryptographic Programming Language and Compiler. In: Venter H, Coetzee M, Loock M, eds. IEEE; 2011. doi:10.1109/ISSA.2011.6027533"},"day":"01","month":"08"},{"abstract":[{"text":"Side channel attacks on cryptographic systems exploit information\ngained from physical implementations rather than theoretical\nweaknesses of a scheme. In recent years, major achievements were made\nfor the class of so called access-driven cache attacks. Such attacks\nexploit the leakage of the memory locations accessed by a victim\nprocess.\n\nIn this paper we consider the AES block cipher and present an attack\nwhich is capable of recovering the full secret key in almost realtime\nfor AES-128, requiring only a very limited number of observed\nencryptions. Unlike previous attacks, we do not require any\ninformation about the plaintext (such as its distribution, etc.).\nMoreover, for the first time, we also show how the plaintext can be\nrecovered without having access to the ciphertext at all. It is the\nfirst working attack on AES implementations using compressed\ntables. There, no efficient techniques to identify the beginning\nof AES rounds is known, which is the fundamental assumption underlying previous\nattacks.\n\nWe have a fully working implementation of our attack which is able to\nrecover AES keys after observing as little as 100 encryptions. It\nworks against the OpenSSL 0.9.8n implementation of AES on Linux\nsystems. Our spy process does not require any special privileges\nbeyond those of a standard Linux user. A contribution of probably\nindependent interest is a denial of service attack on the task scheduler of\ncurrent Linux systems (CFS), which allows one to observe (on average)\nevery single memory access of a victim process.","lang":"eng"}],"publist_id":"3727","extern":1,"type":"conference","author":[{"first_name":"David","last_name":"Gullasch","full_name":"Gullasch, David"},{"full_name":"Bangerter, Endre","first_name":"Endre","last_name":"Bangerter"},{"id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093","first_name":"Stephan","last_name":"Krenn","full_name":"Stephan Krenn"}],"date_updated":"2021-01-12T07:40:11Z","date_created":"2018-12-11T12:00:39Z","year":"2011","_id":"2976","acknowledgement":"This work was in part funded by the European Community’s Seventh Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler Foundation.\nAn extended abstract was also accepted for COSADE 2011.","title":"Cache Games - Bringing Access-Based Cache Attacks on AES to Practice","publication_status":"published","status":"public","publisher":"IEEE","month":"01","day":"01","conference":{"name":"S&P: IEEE Symposium on Security and Privacy"},"doi":"10.1109/SP.2011.22","date_published":"2011-01-01T00:00:00Z","citation":{"short":"D. Gullasch, E. Bangerter, S. Krenn, in:, IEEE, 2011, pp. 490–505.","mla":"Gullasch, David, et al. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. IEEE, 2011, pp. 490–505, doi:10.1109/SP.2011.22.","chicago":"Gullasch, David, Endre Bangerter, and Stephan Krenn. “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” 490–505. IEEE, 2011. https://doi.org/10.1109/SP.2011.22.","ama":"Gullasch D, Bangerter E, Krenn S. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. In: IEEE; 2011:490-505. doi:10.1109/SP.2011.22","ieee":"D. Gullasch, E. Bangerter, and S. Krenn, “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” presented at the S&P: IEEE Symposium on Security and Privacy, 2011, pp. 490–505.","apa":"Gullasch, D., Bangerter, E., & Krenn, S. (2011). Cache Games - Bringing Access-Based Cache Attacks on AES to Practice (pp. 490–505). Presented at the S&P: IEEE Symposium on Security and Privacy, IEEE. https://doi.org/10.1109/SP.2011.22","ista":"Gullasch D, Bangerter E, Krenn S. 2011. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. S&P: IEEE Symposium on Security and Privacy, 490–505."},"main_file_link":[{"open_access":"0","url":"http://eprint.iacr.org/2010/594.pdf"}],"quality_controlled":0,"page":"490 - 505"}]