[{"extern":1,"publist_id":"3807","type":"report","date_created":"2018-12-11T12:00:24Z","date_updated":"2019-04-26T07:22:21Z","author":[{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","status":"public","title":"The power of linear programming for valued CSPs: a constructive characterization","publisher":"Unknown","year":"2012","_id":"2929","month":"01","day":"01","date_published":"2012-01-01T00:00:00Z","quality_controlled":0,"oa":1,"citation":{"ama":"Kolmogorov V. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown; 2012.","apa":"Kolmogorov, V. (2012). The power of linear programming for valued CSPs: a constructive characterization. Unknown.","ieee":"V. Kolmogorov, The power of linear programming for valued CSPs: a constructive characterization. Unknown, 2012.","ista":"Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive characterization, Unknown,p.","short":"V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.","mla":"Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown, 2012.","chicago":"Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown, 2012."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7213"}]},{"day":"01","month":"10","scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.1145/2382196.2382249","date_published":"2012-10-01T00:00:00Z","conference":{"name":"CCS: Computer and Communications Security","start_date":"2012-10-16","location":"Raleigh, NC, USA","end_date":"2012-10-18"},"page":"488 - 500","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2012/258"}],"citation":{"chicago":"Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In Proceedings of the 2012 ACM Conference on Computer and Communications Security, 488–500. ACM, 2012. https://doi.org/10.1145/2382196.2382249.","mla":"Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.","short":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.","ista":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. Proceedings of the 2012 ACM conference on Computer and communications security. CCS: Computer and Communications Security, 488–500.","apa":"Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., & Béguelin, S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In Proceedings of the 2012 ACM conference on Computer and communications security (pp. 488–500). Raleigh, NC, USA: ACM. https://doi.org/10.1145/2382196.2382249","ieee":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in Proceedings of the 2012 ACM conference on Computer and communications security, Raleigh, NC, USA, 2012, pp. 488–500.","ama":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security. ACM; 2012:488-500. doi:10.1145/2382196.2382249"},"publication":"Proceedings of the 2012 ACM conference on Computer and communications security","publist_id":"3798","abstract":[{"lang":"eng","text":"Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system."}],"type":"conference","oa_version":"Submitted Version","date_updated":"2021-01-12T07:39:53Z","date_created":"2018-12-11T12:00:26Z","author":[{"full_name":"Almeida, José","first_name":"José","last_name":"Almeida"},{"first_name":"Manuel","last_name":"Barbosa","full_name":"Barbosa, Manuel"},{"full_name":"Bangerter, Endre","first_name":"Endre","last_name":"Bangerter"},{"full_name":"Barthe, Gilles","first_name":"Gilles","last_name":"Barthe"},{"first_name":"Stephan","last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093","full_name":"Krenn, Stephan"},{"last_name":"Béguelin","first_name":"Santiago","full_name":"Béguelin, Santiago"}],"department":[{"_id":"KrPi"}],"publisher":"ACM","title":"Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols","status":"public","publication_status":"published","_id":"2937","acknowledgement":"This work was partially funded by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT, Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project S2009TIC-1465 PROMETIDOS.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012"},{"month":"10","doi":"10.1145/2380356.2380370","conference":{"name":"EMSOFT: Embedded Software ","end_date":"2012-10-12","start_date":"2012-10-07","location":"Tampere, Finland"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7019"}],"oa":1,"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publist_id":"3799","ec_funded":1,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak"}],"date_updated":"2021-01-12T07:39:53Z","date_created":"2018-12-11T12:00:26Z","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","year":"2012","publisher":"ACM","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","day":"01","scopus_import":1,"date_published":"2012-10-01T00:00:00Z","citation":{"ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","apa":"Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: Roceedings of the Tenth ACM International Conference on Embedded Software. ACM; 2012:43-52. doi:10.1145/2380356.2380370","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52."},"publication":"roceedings of the tenth ACM international conference on Embedded software","page":"43 - 52","abstract":[{"lang":"eng","text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM."}],"type":"conference","oa_version":"Preprint","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2936","status":"public","title":"Finite automata with time delay blocks"},{"type":"journal_article","abstract":[{"text":"Social insects have a very high potential to become invasive pest species. Here, we explore how their social lifestyle and their interaction with parasites may contribute to this invasive success. Similar to solitary species, parasite release followed by the evolution of increased competitive ability can promote establishment of introduced social insect hosts in their introduced range. Genetic bottlenecks during introduction of low numbers of founder individuals decrease the genetic diversity at three levels: the population, the colony and the individual, with the colony level being specific to social insects. Reduced genetic diversity can affect both the individual immune system and the collective colony-level disease defences (social immunity). Still, the dual immune system is likely to make social insects more robust to parasite attack. Changes in social structure from small, family-based, territorially aggressive societies in native populations towards huge networks of cooperating nests (unicoloniality) occur in some invasive social insects, for example, most invasive ants and some termites. Unicoloniality is likely to affect disease dynamics in multiple ways. The free exchange of individuals within the population leads to an increased genetic heterogeneity among individuals of a single nest, thereby decreasing disease transmission. However, the multitude of reproductively active queens per colony buffers the effect of individual diseased queens and their offspring, which may result in a higher level of vertical disease transmission in unicolonial societies. Lastly, unicoloniality provides a competitive advantage over native species, allowing them to quickly become the dominant species in the habitat, which in turn selects for parasite adaptation to this common host genotype and thus eventually a high parasite pressure. Overall, invasions by insect societies are characterized by general features applying to all introduced species, as well as idiosyncrasies that emerge from their social lifestyle. It is important to study these effects in concert to be able to develop efficient management and biocontrol strategies. © 2012 British Ecological Society.","lang":"eng"}],"issue":"6","publist_id":"3797","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2938","acknowledgement":"We thank Mark Brown, Christopher Pull, Meghan L. Vyleta, Miriam Stock, Barbara Casillas-Perez and three anonymous reviewers for valuable comments on the manuscript and Eva Sixt for ant drawings. Funding was obtained from the German Science Foundation (DFG, by an Individual Research Grant to S.C.) and the European Research Council (ERC, by an ERC-Starting Grant to SC and an Individual Marie Curie EIF fellowship to L.desU.). The authors declare no conflict of interests.","year":"2012","publication_status":"published","title":"Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies","status":"public","intvolume":" 26","publisher":"Wiley-Blackwell","department":[{"_id":"SyCr"}],"author":[{"orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","last_name":"Ugelvig","first_name":"Line V","full_name":"Ugelvig, Line V"},{"first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"}],"date_created":"2018-12-11T12:00:27Z","date_updated":"2021-01-12T07:39:54Z","volume":26,"oa_version":"None","scopus_import":1,"month":"01","day":"01","publication":"Functional Ecology","citation":{"chicago":"Ugelvig, Line V, and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” Functional Ecology. Wiley-Blackwell, 2012. https://doi.org/10.1111/1365-2435.12013.","mla":"Ugelvig, Line V., and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” Functional Ecology, vol. 26, no. 6, Wiley-Blackwell, 2012, pp. 1300–12, doi:10.1111/1365-2435.12013.","short":"L.V. Ugelvig, S. Cremer, Functional Ecology 26 (2012) 1300–1312.","ista":"Ugelvig LV, Cremer S. 2012. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. 26(6), 1300–1312.","ieee":"L. V. Ugelvig and S. Cremer, “Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies,” Functional Ecology, vol. 26, no. 6. Wiley-Blackwell, pp. 1300–1312, 2012.","apa":"Ugelvig, L. V., & Cremer, S. (2012). Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. Wiley-Blackwell. https://doi.org/10.1111/1365-2435.12013","ama":"Ugelvig LV, Cremer S. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. 2012;26(6):1300-1312. doi:10.1111/1365-2435.12013"},"quality_controlled":"1","page":"1300 - 1312","date_published":"2012-01-01T00:00:00Z","doi":"10.1111/1365-2435.12013","language":[{"iso":"eng"}]},{"scopus_import":1,"month":"05","day":"08","citation":{"chicago":"Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2012. https://doi.org/10.1109/TPAMI.2012.105.","mla":"Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:10.1109/TPAMI.2012.105.","short":"L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.","ista":"Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 35(2), 259–271.","apa":"Torresani, L., Kolmogorov, V., & Rother, C. (2012). A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2012.105","ieee":"L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2. IEEE, pp. 259–271, 2012.","ama":"Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2012;35(2):259-271. doi:10.1109/TPAMI.2012.105"},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"259 - 271","quality_controlled":"1","date_published":"2012-05-08T00:00:00Z","doi":"10.1109/TPAMI.2012.105","language":[{"iso":"eng"}],"type":"journal_article","issue":"2","publist_id":"3805","abstract":[{"lang":"eng","text":"In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.\r\n"}],"acknowledgement":"This research was funded in part by Microsoft Research.","_id":"2931","year":"2012","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 35","publisher":"IEEE","department":[{"_id":"VlKo"}],"publication_status":"published","status":"public","title":"A dual decomposition approach to feature correspondence","author":[{"last_name":"Torresani","first_name":"Lorenzo","full_name":"Torresani, Lorenzo"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"volume":35,"oa_version":"None","date_updated":"2021-01-12T07:00:46Z","date_created":"2018-12-11T12:00:24Z"}]