@misc{326, author = {{Heihoff, Frederic}}, publisher = {{Universität Paderborn}}, title = {{{A group signature scheme based on the LSRW assumption}}}, year = {{2015}}, } @article{327, abstract = {{We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.}}, author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}}, journal = {{Theoretical Computer Science}}, pages = {{67--79}}, publisher = {{Elsevier}}, title = {{{A deterministic worst-case message complexity optimal solution for resource discovery}}}, doi = {{10.1016/j.tcs.2014.11.027}}, year = {{2015}}, } @misc{3364, author = {{Knorr, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten}}}, year = {{2015}}, } @inproceedings{3815, author = {{Wachsmuth, Henning and Kiesel, Johannes and Stein, Benno}}, booktitle = {{Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing}}, editor = {{Tsujii, Junichi and Hajic, Jan}}, isbn = {{978-3-319-25740-2}}, pages = {{601--611}}, title = {{{Sentiment Flow - A General Model of Web Review Argumentation}}}, doi = {{10.18653/v1/D15-1072}}, year = {{2015}}, } @book{3879, author = {{Wachsmuth, Henning}}, isbn = {{978-3-319-25740-2}}, title = {{{Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining}}}, doi = {{http://dx.doi.org/10.1007/978-3-319-25741-9}}, year = {{2015}}, } @article{290, abstract = {{Model transformation is a key concept in model-driven software engineering. The definition of model transformations is usually based on meta-models describing the abstract syntax of languages. While meta-models are thereby able to abstract from uperfluous details of concrete syntax, they often loose structural information inherent in languages, like information on model elements always occurring together in particular shapes. As a consequence, model transformations cannot naturally re-use language structures, thus leading to unnecessary complexity in their development as well as in quality assurance.In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic.}}, author = {{Besova, Galina and Steenken, Dominik and Wehrheim, Heike}}, journal = {{Computer Languages, Systems & Structures}}, pages = {{116--138}}, publisher = {{Elsevier}}, title = {{{Grammar-based model transformations: Definition, execution, and quality properties}}}, doi = {{10.1016/j.cl.2015.05.003}}, year = {{2015}}, } @inbook{2921, author = {{Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783662464465}}, issn = {{0302-9743}}, pages = {{256--279}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Tightly-Secure Signatures from Chameleon Hash Functions}}}, doi = {{10.1007/978-3-662-46447-2_12}}, year = {{2015}}, } @misc{297, author = {{Sosniak, Martin}}, publisher = {{Universität Paderborn}}, title = {{{Evaluation of Pairing Optimization for Embedded Platforms}}}, year = {{2015}}, } @misc{299, author = {{Gerken, Britta}}, publisher = {{Universität Paderborn}}, title = {{{Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}}}, year = {{2015}}, } @misc{301, author = {{Bobolz, Jan}}, publisher = {{Universität Paderborn}}, title = {{{Efficient Verifier-Local Revocation for Anonymous Credentials}}}, year = {{2015}}, } @misc{302, author = {{Stroh, Christian}}, publisher = {{Universität Paderborn}}, title = {{{Efficient Attributes for Pairing-Based Anonymous Credentials}}}, year = {{2015}}, } @phdthesis{304, author = {{Koutsopoulos, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Dynamics and Efficiency in Topological Self-Stabilization}}}, year = {{2015}}, } @phdthesis{305, author = {{Kniesburges, Sebastian}}, publisher = {{Universität Paderborn}}, title = {{{Distributed Data Structures and the Power of topological Self-Stabilization}}}, year = {{2015}}, } @misc{312, author = {{Schleiter, Patrick}}, publisher = {{Universität Paderborn}}, title = {{{Constructions of Fully Secure Predicate Encryption Schemes}}}, year = {{2015}}, } @article{3120, author = {{Böhl, Florian and Hofheinz, Dennis and Jager, Tibor and Koch, Jessica and Striecks, Christoph}}, journal = {{J. Cryptology}}, number = {{1}}, pages = {{176----208}}, title = {{{Confined Guessing: New Signatures From Standard Assumptions}}}, doi = {{10.1007/s00145-014-9183-z}}, year = {{2015}}, } @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}}, }