@article{3113, author = {{Heuer, Felix and Jager, Tibor and Schäge, Sven and Kiltz, Eike}}, journal = {{IET Information Security}}, number = {{6}}, pages = {{304----318}}, title = {{{Selective opening security of practical public-key encryption schemes}}}, doi = {{10.1049/iet-ifs.2015.0507}}, year = {{2016}}, } @article{3114, author = {{Jager, Tibor and Rupp, Andy}}, journal = {{PoPETs}}, number = {{3}}, pages = {{62----82}}, title = {{{Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way}}}, year = {{2016}}, } @inproceedings{3115, author = {{Hofheinz, Dennis and Jager, Tibor and Khurana, Dakshita and Sahai, Amit and Waters, Brent and Zhandry, Mark}}, booktitle = {{Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II}}, pages = {{715----744}}, title = {{{How to Generate and Use Universal Samplers}}}, doi = {{10.1007/978-3-662-53890-6_24}}, year = {{2016}}, } @inproceedings{3116, author = {{Horst, Matthias and Grothe, Martin and Jager, Tibor and Schwenk, Jörg}}, booktitle = {{Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings}}, pages = {{159----175}}, title = {{{Breaking PPTP VPNs via RADIUS Encryption}}}, doi = {{10.1007/978-3-319-48965-0_10}}, year = {{2016}}, } @inproceedings{3117, author = {{Bader, Christoph and Jager, Tibor and Li, Yong and Schäge, Sven}}, booktitle = {{Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II}}, pages = {{273----304}}, title = {{{On the Impossibility of Tight Cryptographic Reductions}}}, doi = {{10.1007/978-3-662-49896-5_10}}, year = {{2016}}, } @inproceedings{3118, author = {{Hofheinz, Dennis and Jager, Tibor and Rupp, Andy}}, booktitle = {{Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II}}, pages = {{146----168}}, title = {{{Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts}}}, doi = {{10.1007/978-3-662-53644-5_6}}, year = {{2016}}, } @inproceedings{3119, author = {{Hofheinz, Dennis and Jager, Tibor}}, booktitle = {{Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I}}, pages = {{336----362}}, title = {{{Verifiable Random Functions from Standard Assumptions}}}, doi = {{10.1007/978-3-662-49096-9_14}}, year = {{2016}}, } @inproceedings{3157, author = {{Beringer, Steffen and Wehrheim, Heike}}, booktitle = {{Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}}, editor = {{H. ter Beek, Maurice and Gnesi, Stefania and Knapp, Alexander}}, pages = {{189----204}}, title = {{{Verification of AUTOSAR Software Architectures with Timed Automata}}}, doi = {{10.1007/978-3-319-45943-1_13}}, year = {{2016}}, } @inproceedings{3158, author = {{Travkin, Oleg and Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}}, editor = {{Sampaio, Augusto and Wang, Farn}}, pages = {{3----24}}, title = {{{Verification of Concurrent Programs on Weak Memory Models}}}, doi = {{10.1007/978-3-319-46750-4_1}}, year = {{2016}}, } @inproceedings{3159, author = {{Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}}, booktitle = {{Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings}}, editor = {{Huisman, Marieke}}, pages = {{193----209}}, title = {{{Towards a Thread-Local Proof Technique for Starvation Freedom}}}, doi = {{10.1007/978-3-319-33693-0_13}}, year = {{2016}}, } @inproceedings{3160, author = {{Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain}}, editor = {{Fatourou, Panagiota and Jim{\'{e}}nez, Ernesto and Pedone, Fernando}}, pages = {{35:1----35:17}}, title = {{{Proving Opacity of a Pessimistic {STM}}}}, doi = {{10.4230/LIPIcs.OPODIS.2016.35}}, year = {{2016}}, } @article{3161, author = {{Isenberg, Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}}, journal = {{CoRR}}, title = {{{Deriving approximation tolerance constraints from verification runs}}}, year = {{2016}}, } @misc{210, author = {{Leder, Lennart}}, publisher = {{Universität Paderborn}}, title = {{{Congestion Games with Mixed Objectives}}}, year = {{2016}}, } @misc{213, author = {{Porzenheim, Laurens}}, publisher = {{Universität Paderborn}}, title = {{{Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}}}, year = {{2016}}, } @misc{214, author = {{Bemmann, Kai Sören}}, publisher = {{Universität Paderborn}}, title = {{{Commitment Schemes - Definitions, Variants, and Security}}}, year = {{2016}}, } @inproceedings{215, abstract = {{We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.}}, author = {{Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}}, booktitle = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{417----427}}, title = {{{Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}}}, doi = {{10.1145/2935764.2935783}}, year = {{2016}}, } @article{175, abstract = {{Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.}}, author = {{Walther, Sven and Wehrheim, Heike}}, journal = {{Science of Computer Programming}}, pages = {{2----23}}, publisher = {{Elsevier}}, title = {{{On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}}}, doi = {{10.1016/j.scico.2016.04.002}}, year = {{2016}}, } @inproceedings{17655, author = {{Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}}, booktitle = {{Proceedings of the 2016 European Conference on Artificial Intelligence}}, keywords = {{agents, action, repeated reciprocation, fixed, floating, network, Nash equilibrium, social welfare, price of anarchy, price of stability, convex combination}}, pages = {{417--425}}, title = {{{The Game of Reciprocation Habits}}}, doi = {{10.3233/978-1-61499-672-9-417}}, volume = {{Volume 285: ECAI 2016}}, year = {{2016}}, } @inproceedings{17656, author = {{Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}}, booktitle = {{Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}}, isbn = {{978-1-4503-4239-1}}, keywords = {{agent's influence, behavior, convergence, perron-frobenius, reciprocal interaction, repeated reciprocation}}, pages = {{1431--1432}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{The Convergence of Reciprocation}}}, year = {{2016}}, } @inproceedings{177, abstract = {{Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus.}}, author = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, booktitle = {{Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{477--488}}, title = {{{On the Parameterized Parallel Complexity and the Vertex Cover Problem}}}, doi = {{10.1007/978-3-319-48749-6_35}}, year = {{2016}}, }