@inproceedings{3121,
  author       = {{Jager, Tibor and Schwenk, Jörg and Somorovsky, Juraj}},
  booktitle    = {{Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015}},
  pages        = {{1185----1196}},
  title        = {{{On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption}}},
  doi          = {{10.1145/2810103.2813657}},
  year         = {{2015}},
}

@inproceedings{3122,
  author       = {{Jager, Tibor and Schwenk, Jörg and Somorovsky, Juraj}},
  booktitle    = {{Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I}},
  pages        = {{407----425}},
  title        = {{{Practical Invalid Curve Attacks on TLS-ECDH}}},
  doi          = {{10.1007/978-3-319-24174-6_21}},
  year         = {{2015}},
}

@inproceedings{3123,
  author       = {{Heuer, Felix and Jager, Tibor and Kiltz, Eike and Schäge, Sven}},
  booktitle    = {{Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings}},
  pages        = {{27----51}},
  title        = {{{On the Selective Opening Security of Practical Public-Key Encryption Schemes}}},
  doi          = {{10.1007/978-3-662-46447-2_2}},
  year         = {{2015}},
}

@inproceedings{3124,
  author       = {{Bergsma, Florian and Jager, Tibor and Schwenk, Jörg}},
  booktitle    = {{Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings}},
  pages        = {{477----494}},
  title        = {{{One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model}}},
  doi          = {{10.1007/978-3-662-46447-2_21}},
  year         = {{2015}},
}

@inproceedings{3125,
  author       = {{Jager, Tibor}},
  booktitle    = {{Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}}},
  pages        = {{121----143}},
  title        = {{{Verifiable Random Functions from Weaker Assumptions}}},
  doi          = {{10.1007/978-3-662-46497-7_5}},
  year         = {{2015}},
}

@inproceedings{3126,
  author       = {{Bader, Christoph and Hofheinz, Dennis and Jager, Tibor and Kiltz, Eike and Li, Yong}},
  booktitle    = {{Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I}},
  pages        = {{629----658}},
  title        = {{{Tightly-Secure Authenticated Key Exchange}}},
  doi          = {{10.1007/978-3-662-46494-6_26}},
  year         = {{2015}},
}

@inproceedings{313,
  abstract     = {{Nowadays, many service providers offer software components in the form of Software as a Service. Requesters that want to discover those services in order to use or to integrate them, need to find out which service satisfies their requirements best. For this purpose, service matching approaches determine how well the specifications of provided services satisfy their requirements (including structural, behavioral, and non-functional requirements). In this paper, we describe the tool-suite MatchBox that allows the integration of existing service matchers and their combination as part of flexibly configurable matching processes. Taking requirements and service specifications as an input, MatchBox is able to execute such matching processes and deliver rich matching results. In contrast to related tools, MatchBox allows users to take into account many different kinds of requirements, while it also provides the flexibility to control the matching process in many different ways. }},
  author       = {{Börding, Paul and Bruns, Melanie and Platenius, Marie Christin}},
  booktitle    = {{10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE'15)}},
  pages        = {{974----977}},
  title        = {{{Comprehensive Service Matching with MatchBox}}},
  doi          = {{10.1145/2786805.2803181}},
  year         = {{2015}},
}

@techreport{314,
  abstract     = {{On an intermediate goods market we allow for vertical and horizontal product differentiation and analyze the influence of simultaneous competition for resources and customers on the market outcome. Asymmetries between intermediaries cannot arise just from distinct product qualities, but also from different production technologies. The intermediaries face either price or quantity competition on the output market and a monopolistic input supplier on the input market. We find that there exist quality and productivity differences such that for quantity competition only one intermediary is willing to procure inputs from the input supplier, while for price competition both intermediaries are willing to purchase inputs. Considering product innovation for symmetric productivities we derive equilibrium conditions on the investment costs and compare price and quantity competition. It turns out that on the one hand there exist product qualities and degrees of horizontal product differentiation for complements such that asymmetric investment equilibria fail to exist. On the other hand we find that there also exist product qualities and degrees of horizontal product differentiation for substitutes such that existence can be guaranteed if the investment costs are chosen accordingly.}},
  author       = {{Brangewitz, Sonja and Manegold, Jochen}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Competition and Product Innovation of Intermediaries in a Differentiated Duopoly}}},
  year         = {{2015}},
}

@inproceedings{315,
  abstract     = {{In this paper, we introduce an approach for combining embedded systems with Service-oriented Computing techniques based on a concrete application scenario from the robotics domain. Our proposed Service-oriented Architecture allows for incorporating computational expensive functionality as services into a distributed computing environment. Furthermore, our framework facilitates a seamless integration of embedded systems such as robots as service providers into the computing environment. The entire communication is based on so-called recipes, which can be interpreted as autonomous messages that contain all necessary information for executing compositions of services.}},
  author       = {{Jungmann, Alexander and Jatzkowski, Jan and Kleinjohann, Bernd}},
  booktitle    = {{Proceedings of the 5th IFIP International Embedded Systems Symposium}},
  title        = {{{Combining Service-oriented Computing with Embedded Systems - A Robotics Case Study}}},
  year         = {{2015}},
}

@misc{316,
  author       = {{Pautz, Jannis}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Budget Games with priced strategies}}},
  year         = {{2015}},
}

@article{3162,
  author       = {{Ziegert, Steffen and Wehrheim, Heike}},
  journal      = {{Computer Science - R & D}},
  number       = {{3-4}},
  pages        = {{303----320}},
  title        = {{{Temporal plans for software architecture reconfiguration}}},
  doi          = {{10.1007/s00450-014-0259-7}},
  year         = {{2015}},
}

@inproceedings{3163,
  author       = {{Meyer, Roland and Wehrheim, Heike}},
  booktitle    = {{Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}},
  editor       = {{Meyer, Roland and Platzer, Andr{\'{e}} and Wehrheim, Heike}},
  pages        = {{3----4}},
  title        = {{{From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog}}},
  doi          = {{10.1007/978-3-319-23506-6_1}},
  year         = {{2015}},
}

@inproceedings{3164,
  author       = {{Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}},
  booktitle    = {{{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings}},
  editor       = {{Bj{\o}rner, Nikolaj and S. de Boer, Frank}},
  pages        = {{161----177}},
  title        = {{{Verifying Opacity of a Transactional Mutex Lock}}},
  doi          = {{10.1007/978-3-319-19249-9_11}},
  year         = {{2015}},
}

@inproceedings{3165,
  author       = {{Wehrheim, Heike and Travkin, Oleg}},
  booktitle    = {{Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings}},
  editor       = {{Piterman, Nir}},
  pages        = {{104----119}},
  title        = {{{{TSO} to {SC} via Symbolic Execution}}},
  doi          = {{10.1007/978-3-319-26287-1_7}},
  year         = {{2015}},
}

@proceedings{3166,
  editor       = {{Meyer, Roland and Platzer, Andr{\'{e}} and Wehrheim, Heike}},
  isbn         = {{978-3-319-23505-9}},
  title        = {{{Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}}},
  doi          = {{10.1007/978-3-319-23506-6}},
  year         = {{2015}},
}

@phdthesis{317,
  author       = {{Jähn, Claudius}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen}}},
  year         = {{2015}},
}

@phdthesis{318,
  author       = {{Huma, Zille}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Automatic Service Discovery and Composition for heterogeneous service partners}}},
  year         = {{2015}},
}

@inproceedings{319,
  abstract     = {{Services are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches.}},
  author       = {{Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans}},
  booktitle    = {{Proceedings of the 12th IEEE International Conference on Services Computing (SCC)}},
  pages        = {{57----64}},
  title        = {{{Automated Online Service Composition}}},
  doi          = {{10.1109/SCC.2015.18}},
  year         = {{2015}},
}

@phdthesis{270,
  author       = {{Abshoff, Sebastian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}}},
  year         = {{2015}},
}

@article{27012,
  author       = {{Augustin, L.S.A. and Kendall, C.W.C. and Jenkins, D.J.A. and Willett, W.C. and Astrup, A. and Barclay, A.W. and Björck, I. and Brand-Miller, J.C. and Brighenti, F. and Buyken, Anette and Ceriello, A. and La Vecchia, C. and Livesey, G. and Liu, S. and Riccardi, G. and Rizkalla, S.W. and Sievenpiper, J.L. and Trichopoulou, A. and Wolever, T.M.S. and Baer-Sinnott, S. and Poli, A.}},
  issn         = {{0939-4753}},
  journal      = {{Nutrition, Metabolism and Cardiovascular Diseases}},
  pages        = {{795--815}},
  title        = {{{Glycemic index, glycemic load and glycemic response: An International Scientific Consensus Summit from the International Carbohydrate Quality Consortium (ICQC)}}},
  doi          = {{10.1016/j.numecd.2015.05.005}},
  year         = {{2015}},
}