[{"date_updated":"2023-01-10T10:31:49Z","date_created":"2022-12-24T00:16:39Z","author":[{"last_name":"Anonymous","full_name":"Anonymous, A","first_name":"A"}],"supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"title":"Cost of Privacy-preserving SMPC Protocols for NN-Based Inference","year":"2022","citation":{"ieee":"A. Anonymous, <i>Cost of Privacy-preserving SMPC Protocols for NN-Based Inference</i>. 2022.","chicago":"Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>, 2022.","ama":"Anonymous A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>.; 2022.","mla":"Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>. 2022.","bibtex":"@book{Anonymous_2022, title={Cost of Privacy-preserving SMPC Protocols for NN-Based Inference}, author={Anonymous, A}, year={2022} }","short":"A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference, 2022.","apa":"Anonymous, A. (2022). <i>Cost of Privacy-preserving SMPC Protocols for NN-Based Inference</i>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"34963","user_id":"41047","department":[{"_id":"34"},{"_id":"64"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"year":"2021","citation":{"short":"D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.","mla":"Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>. 2021.","bibtex":"@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }","apa":"Suermann, D. (2021). <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers</i>.","chicago":"Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>, 2021.","ieee":"D. Suermann, <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers</i>. 2021.","ama":"Suermann D. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>.; 2021."},"title":"Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers","date_updated":"2022-01-06T06:58:43Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"full_name":"Suermann, Dennis","last_name":"Suermann","first_name":"Dennis"}],"date_created":"2021-12-16T06:41:25Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"28998","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"15504"},{"citation":{"apa":"Mengshi, M. (2021). <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.","short":"M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.","mla":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021.","bibtex":"@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }","ama":"Mengshi M. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.; 2021.","ieee":"M. Mengshi, <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021.","chicago":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>, 2021."},"year":"2021","title":"Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2021-02-09T07:09:22Z","author":[{"first_name":"Ma","last_name":"Mengshi","full_name":"Mengshi, Ma"}],"date_updated":"2022-01-06T06:54:49Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"21197"},{"language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"thgoette","date_created":"2021-06-06T19:12:49Z","date_updated":"2021-06-06T19:12:49Z","access_level":"closed","file_id":"22284","file_name":"Wicked_Fast_Overlay_Construction(1).pdf","file_size":590875}],"abstract":[{"text":"    We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n    We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n    If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n    Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n    We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n    \r\n    Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n    Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n    For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n    Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$.","lang":"eng"}],"date_created":"2021-06-06T19:10:26Z","publisher":"ACM","title":"Time-Optimal Construction of Overlays","year":"2021","user_id":"477","department":[{"_id":"34"}],"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901"}],"_id":"22283","file_date_updated":"2021-06-06T19:12:49Z","type":"conference","status":"public","editor":[{"last_name":"Censor-Hillel","full_name":"Censor-Hillel, Keren","first_name":"Keren"}],"author":[{"id":"34727","full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten"},{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Julian","id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann"}],"date_updated":"2022-01-06T06:55:30Z","conference":{"start_date":"2021-07-26","name":"ACM Symposium on Principles of Distributed Computing (PODC)","location":"Virtual","end_date":"2021-07-30"},"doi":"10.1145/3465084.3467932","publication_status":"accepted","has_accepted_license":"1","citation":{"chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel. New York: ACM, n.d. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>.","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, Virtual.","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>","bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel, ACM, doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>.","apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>"},"place":"New York"},{"status":"public","type":"book_chapter","file_date_updated":"2021-05-10T16:02:02Z","department":[{"_id":"558"}],"user_id":"36113","_id":"22057","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"citation":{"chicago":"Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>.","ieee":"T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","ama":"Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>","mla":"Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>.","short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","bibtex":"@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }","apa":"Jager, T., Kurek, R., &#38; Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>"},"place":"Cham","has_accepted_license":"1","publication_identifier":{"isbn":["9783030752446","9783030752453"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/978-3-030-75245-3_22","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"first_name":"Rafael","full_name":"Kurek, Rafael","last_name":"Kurek"},{"first_name":"David","last_name":"Niehues","full_name":"Niehues, David","id":"36113"}],"date_updated":"2022-01-06T06:55:23Z","file":[{"file_size":701068,"file_id":"22058","access_level":"closed","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","date_updated":"2021-05-10T16:02:02Z","date_created":"2021-05-10T16:02:02Z","creator":"davnie","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We construct more efficient cryptosystems with provable\r\nsecurity against adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient, selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal, Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n– Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption, has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves full adaptive security with\r\npublic parameters of size only O(log λ). The other is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext is\r\nonly a single group element and the security reduction is quadrat-\r\nically tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n– A very efficient adaptively-secure verifiable random function where\r\nproofs, public keys, and secret keys have size O(log λ).\r\nAs a technical contribution we introduce blockwise partitioning, which\r\nleverages the assumption that a cryptographic hash function is weak\r\nnear-collision resistant to prove full adaptive security of cryptosystems."}],"publication":"Public-Key Cryptography – PKC 2021","language":[{"iso":"eng"}],"ddc":["000"],"year":"2021","title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","date_created":"2021-05-10T15:56:24Z"},{"citation":{"ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","chicago":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>.","ama":"Niehues D. Verifiable Random Functions with Optimal Tightness. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>","apa":"Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>","mla":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>.","short":"D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","bibtex":"@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }"},"year":"2021","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752477","9783030752484"]},"has_accepted_license":"1","doi":"10.1007/978-3-030-75248-4_3","title":"Verifiable Random Functions with Optimal Tightness","author":[{"last_name":"Niehues","id":"36113","full_name":"Niehues, David","first_name":"David"}],"date_created":"2021-05-10T16:07:50Z","date_updated":"2022-01-06T06:55:24Z","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"22060","access_level":"closed","file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","file_size":697361,"date_created":"2021-05-10T16:09:17Z","creator":"davnie","date_updated":"2021-05-10T16:09:17Z"}],"status":"public","abstract":[{"text":"Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan (FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public verification key and proofs accompanying the\r\noutput enable all parties to verify the correctness of the output. How-\r\never, all known standard model VRFs have a reduction loss that is much\r\nworse than what one would expect from known optimal constructions of\r\nclosely related primitives like unique signatures. We show that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries. To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16) to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We answer this ques-\r\ntion in the affirmative by presenting the first VRF with a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability of tight verifiable\r\nrandom functions: We show that a security loss of Q is unavoidable and\r\npresent the first construction that achieves this bound.","lang":"eng"}],"type":"book_chapter","publication":"Public-Key Cryptography – PKC 2021","language":[{"iso":"eng"}],"file_date_updated":"2021-05-10T16:09:17Z","ddc":["000"],"user_id":"36113","department":[{"_id":"558"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"22059"},{"date_created":"2021-10-21T07:51:32Z","author":[{"first_name":"Jan","last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan"},{"first_name":"Fabian","id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens"},{"first_name":"Raphael","last_name":"Heitjohann","full_name":"Heitjohann, Raphael"},{"full_name":"Fell, Jeremy","last_name":"Fell","first_name":"Jeremy"}],"oa":"1","publisher":"IACR eprint","date_updated":"2022-11-18T09:38:42Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/961"}],"title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","citation":{"ama":"Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.","chicago":"Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.","ieee":"J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.","apa":"Bobolz, J., Eidens, F., Heitjohann, R., &#38; Fell, J. (2021). <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint.","short":"J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).","mla":"Bobolz, Jan, et al. <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint, 2021.","bibtex":"@article{Bobolz_Eidens_Heitjohann_Fell_2021, title={Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}, publisher={IACR eprint}, author={Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell, Jeremy}, year={2021} }"},"year":"2021","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"26645","language":[{"iso":"eng"}],"type":"preprint","status":"public"},{"language":[{"iso":"eng"}],"_id":"29566","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"}],"user_id":"27207","status":"public","publication":"Cryptology and Network Security","type":"conference","title":"Issuer-Hiding Attribute-Based Credentials","doi":"10.1007/978-3-030-92548-2_9","date_updated":"2022-01-27T13:02:23Z","publisher":"Springer International Publishing","author":[{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"},{"last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian"},{"last_name":"Krenn","full_name":"Krenn, Stephan","first_name":"Stephan"},{"last_name":"Ramacher","full_name":"Ramacher, Sebastian","first_name":"Sebastian"},{"last_name":"Samelin","full_name":"Samelin, Kai","first_name":"Kai"}],"date_created":"2022-01-27T13:00:21Z","year":"2021","place":"Cham","citation":{"ama":"Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: <i>Cryptology and Network Security</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In <i>Cryptology and Network Security</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>.","ieee":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>.","short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.","mla":"Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” <i>Cryptology and Network Security</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>.","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>}, booktitle={Cryptology and Network Security}, publisher={Springer International Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher, Sebastian and Samelin, Kai}, year={2021} }","apa":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., &#38; Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. <i>Cryptology and Network Security</i>. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>"},"publication_identifier":{"isbn":["9783030925475","9783030925482"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"date_created":"2020-09-18T05:59:11Z","author":[{"first_name":"Rafael","full_name":"Kurek, Rafael","last_name":"Kurek"}],"volume":12248,"publisher":"Springer","date_updated":"2022-01-06T06:54:07Z","doi":"10.1007/978-3-030-55304-3\\_17","title":"Efficient Forward-Secure Threshold Public Key Encryption","citation":{"mla":"Kurek, Rafael. “Efficient Forward-Secure Threshold Public Key Encryption.” <i>Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings</i>, edited by Joseph K. Liu and Hui Cui, vol. 12248, Springer, 2020, pp. 330–49, doi:<a href=\"https://doi.org/10.1007/978-3-030-55304-3\\_17\">10.1007/978-3-030-55304-3\\_17</a>.","bibtex":"@inproceedings{Kurek_2020, series={Lecture Notes in Computer Science}, title={Efficient Forward-Secure Threshold Public Key Encryption}, volume={12248}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-55304-3\\_17\">10.1007/978-3-030-55304-3\\_17</a>}, booktitle={Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings}, publisher={Springer}, author={Kurek, Rafael}, editor={K. Liu, Joseph and Cui, HuiEditors}, year={2020}, pages={330–349}, collection={Lecture Notes in Computer Science} }","short":"R. Kurek, in: J. K. Liu, H. Cui (Eds.), Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings, Springer, 2020, pp. 330–349.","apa":"Kurek, R. (2020). Efficient Forward-Secure Threshold Public Key Encryption. In J. K. Liu &#38; H. Cui (Eds.), <i>Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings</i> (Vol. 12248, pp. 330–349). Springer. <a href=\"https://doi.org/10.1007/978-3-030-55304-3\\_17\">https://doi.org/10.1007/978-3-030-55304-3\\_17</a>","ama":"Kurek R. Efficient Forward-Secure Threshold Public Key Encryption. In: K. Liu J, Cui H, eds. <i>Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings</i>. Vol 12248. Lecture Notes in Computer Science. Springer; 2020:330-349. doi:<a href=\"https://doi.org/10.1007/978-3-030-55304-3\\_17\">10.1007/978-3-030-55304-3\\_17</a>","ieee":"R. Kurek, “Efficient Forward-Secure Threshold Public Key Encryption,” in <i>Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings</i>, 2020, vol. 12248, pp. 330–349.","chicago":"Kurek, Rafael. “Efficient Forward-Secure Threshold Public Key Encryption.” In <i>Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings</i>, edited by Joseph K. Liu and Hui Cui, 12248:330–49. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-55304-3\\_17\">https://doi.org/10.1007/978-3-030-55304-3\\_17</a>."},"intvolume":"     12248","page":"330-349","year":"2020","series_title":"Lecture Notes in Computer Science","user_id":"15504","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"19551","language":[{"iso":"eng"}],"type":"conference","publication":"Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings","status":"public","editor":[{"first_name":"Joseph","full_name":"K. Liu, Joseph","last_name":"K. Liu"},{"first_name":"Hui","last_name":"Cui","full_name":"Cui, Hui"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"19553","series_title":"Lecture Notes in Computer Science","user_id":"15504","language":[{"iso":"eng"}],"type":"conference","publication":"Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings","editor":[{"full_name":"Aoki, Kazumaro","last_name":"Aoki","first_name":"Kazumaro"},{"full_name":"Kanaoka, Akira","last_name":"Kanaoka","first_name":"Akira"}],"status":"public","date_updated":"2022-01-06T06:54:07Z","publisher":"Springer","author":[{"first_name":"Rafael","full_name":"Kurek, Rafael","last_name":"Kurek"}],"date_created":"2020-09-18T06:00:42Z","volume":12231,"title":"Efficient Forward-Secure Threshold Signatures","doi":"10.1007/978-3-030-58208-1\\_14","year":"2020","citation":{"short":"R. Kurek, in: K. Aoki, A. Kanaoka (Eds.), Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings, Springer, 2020, pp. 239–260.","bibtex":"@inproceedings{Kurek_2020, series={Lecture Notes in Computer Science}, title={Efficient Forward-Secure Threshold Signatures}, volume={12231}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58208-1\\_14\">10.1007/978-3-030-58208-1\\_14</a>}, booktitle={Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings}, publisher={Springer}, author={Kurek, Rafael}, editor={Aoki, Kazumaro and Kanaoka, AkiraEditors}, year={2020}, pages={239–260}, collection={Lecture Notes in Computer Science} }","mla":"Kurek, Rafael. “Efficient Forward-Secure Threshold Signatures.” <i>Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings</i>, edited by Kazumaro Aoki and Akira Kanaoka, vol. 12231, Springer, 2020, pp. 239–60, doi:<a href=\"https://doi.org/10.1007/978-3-030-58208-1\\_14\">10.1007/978-3-030-58208-1\\_14</a>.","apa":"Kurek, R. (2020). Efficient Forward-Secure Threshold Signatures. In K. Aoki &#38; A. Kanaoka (Eds.), <i>Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings</i> (Vol. 12231, pp. 239–260). Springer. <a href=\"https://doi.org/10.1007/978-3-030-58208-1\\_14\">https://doi.org/10.1007/978-3-030-58208-1\\_14</a>","ieee":"R. Kurek, “Efficient Forward-Secure Threshold Signatures,” in <i>Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings</i>, 2020, vol. 12231, pp. 239–260.","chicago":"Kurek, Rafael. “Efficient Forward-Secure Threshold Signatures.” In <i>Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings</i>, edited by Kazumaro Aoki and Akira Kanaoka, 12231:239–60. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58208-1\\_14\">https://doi.org/10.1007/978-3-030-58208-1\\_14</a>.","ama":"Kurek R. Efficient Forward-Secure Threshold Signatures. In: Aoki K, Kanaoka A, eds. <i>Advances in Information and Computer Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings</i>. Vol 12231. Lecture Notes in Computer Science. Springer; 2020:239-260. doi:<a href=\"https://doi.org/10.1007/978-3-030-58208-1\\_14\">10.1007/978-3-030-58208-1\\_14</a>"},"page":"239-260","intvolume":"     12231"},{"file":[{"file_size":973756,"file_name":"DissertationKurek.pdf","access_level":"closed","file_id":"24711","date_updated":"2021-09-20T11:40:38Z","creator":"florida","date_created":"2021-09-20T11:40:38Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"dissertation","ddc":["040"],"file_date_updated":"2021-09-20T11:40:38Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"24710","user_id":"15504","year":"2020","citation":{"apa":"Kurek, R. (2020). <i>Efficient Cryptographic Constructions with Strong Security Guarantees</i>.","mla":"Kurek, Rafael. <i>Efficient Cryptographic Constructions with Strong Security Guarantees</i>. 2020.","bibtex":"@book{Kurek_2020, title={Efficient Cryptographic Constructions with Strong Security Guarantees}, author={Kurek, Rafael}, year={2020} }","short":"R. Kurek, Efficient Cryptographic Constructions with Strong Security Guarantees, 2020.","ieee":"R. Kurek, <i>Efficient Cryptographic Constructions with Strong Security Guarantees</i>. 2020.","chicago":"Kurek, Rafael. <i>Efficient Cryptographic Constructions with Strong Security Guarantees</i>, 2020.","ama":"Kurek R. <i>Efficient Cryptographic Constructions with Strong Security Guarantees</i>.; 2020."},"has_accepted_license":"1","title":"Efficient Cryptographic Constructions with Strong Security Guarantees","date_updated":"2022-01-06T06:56:32Z","supervisor":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"}],"date_created":"2021-09-20T11:40:56Z","author":[{"full_name":"Kurek, Rafael","last_name":"Kurek","first_name":"Rafael"}]},{"date_created":"2021-03-08T16:50:31Z","title":"On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions","quality_controlled":"1","year":"2020","keyword":["Admissible hash functions","Verifiable random functions","Error-correcting codes","Provable security"],"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","abstract":[{"text":"Verifiable random functions (VRFs) are essentially digital signatures with additional properties, namely verifiable uniqueness and pseudorandomness, which make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated Denial of Existence and the CONIKS key management system, or in the random committee selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on admissible hash functions (AHFs) to achieve security against adaptive attacks in the standard model. Known AHF constructions are based on error-correcting codes, which yield asymptotically efficient constructions. However, previous works do not clarify how the code should be instantiated concretely in the real world. The rate and the minimal distance of the selected code have significant impact on the efficiency of the resulting cryptosystem, therefore it is unclear if and how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we explain inherent limitations of code-based AHFs. Concretely, we assume that even if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch bounds, existing AHF-based constructions of verifiable random functions (VRFs) can only be instantiated quite inefficiently. Then we introduce and construct computational AHFs (cAHFs). While classical AHFs are information-theoretic, and therefore work even in presence of computationally unbounded adversaries, cAHFs provide only security against computationally bounded adversaries. However, we show that cAHFs can be instantiated significantly more efficiently. Finally, we use our cAHF to construct the currently most efficient verifiable random function with full adaptive security in the standard model.","lang":"eng"}],"file":[{"file_id":"21399","file_name":"Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible Ha.pdf","access_level":"closed","file_size":706743,"date_created":"2021-03-08T17:02:37Z","creator":"davnie","date_updated":"2021-03-08T17:02:37Z","relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:54:58Z","author":[{"last_name":"Jager","full_name":"Jager, Tibor","first_name":"Tibor"},{"full_name":"Niehues, David","id":"36113","last_name":"Niehues","first_name":"David"}],"conference":{"end_date":"2019-08-16","location":"Waterloo, Canada","name":"Selected Areas in Cryptography","start_date":"2019-08-12"},"doi":"10.1007/978-3-030-38471-5_13","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf"}],"has_accepted_license":"1","publication_identifier":{"isbn":["9783030384708","9783030384715"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","related_material":{"link":[{"relation":"later_version","url":"https://eprint.iacr.org/2019/1335.pdf"}]},"place":"Cham","citation":{"ieee":"T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","chicago":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">https://doi.org/10.1007/978-3-030-38471-5_13</a>.","ama":"Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>","bibtex":"@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>}, booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues, David}, year={2020} }","mla":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>.","short":"T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020.","apa":"Jager, T., &#38; Niehues, D. (2020). On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">https://doi.org/10.1007/978-3-030-38471-5_13</a>"},"_id":"21396","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"558"}],"user_id":"36113","file_date_updated":"2021-03-08T17:02:37Z","type":"book_chapter","status":"public"},{"year":"2020","citation":{"apa":"Setzer, A. (2020). <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1026\">https://doi.org/10.17619/UNIPB/1-1026</a>","mla":"Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>.","bibtex":"@book{Setzer_2020, title={Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2020} }","short":"A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks, Universität Paderborn, 2020.","chicago":"Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-1026\">https://doi.org/10.17619/UNIPB/1-1026</a>.","ieee":"A. Setzer, <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020.","ama":"Setzer A. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>"},"title":"Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks","doi":"10.17619/UNIPB/1-1026","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:36Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2020-08-28T06:50:29Z","author":[{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"18520","user_id":"477","department":[{"_id":"79"}]},{"_id":"18637","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"7"},{"_id":"64"}],"user_id":"25078","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-10-23T08:36:34Z","extern":"1","type":"bachelorsthesis","status":"public","file":[{"date_updated":"2020-10-23T08:36:34Z","creator":"feidens","date_created":"2020-10-23T08:36:34Z","file_size":1060142,"description":"This is a bachelor thesis.","file_id":"20186","access_level":"open_access","file_name":"thesis_schuermann_published.pdf","content_type":"application/pdf","relation":"main_file"}],"date_updated":"2022-01-06T06:53:50Z","publisher":"Universität Paderborn","oa":"1","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"date_created":"2020-08-29T13:24:51Z","author":[{"first_name":"Patrick","last_name":"Schürmann","full_name":"Schürmann, Patrick"}],"title":"A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes","has_accepted_license":"1","year":"2020","citation":{"mla":"Schürmann, Patrick. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020.","short":"P. Schürmann, A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes, Universität Paderborn, 2020.","bibtex":"@book{Schürmann_2020, title={A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes}, publisher={Universität Paderborn}, author={Schürmann, Patrick}, year={2020} }","apa":"Schürmann, P. (2020). <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn.","ama":"Schürmann P. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn; 2020.","chicago":"Schürmann, Patrick. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020.","ieee":"P. Schürmann, <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020."}},{"language":[{"iso":"eng"}],"department":[{"_id":"7"},{"_id":"64"}],"user_id":"477","_id":"18639","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"status":"public","type":"bachelorsthesis","title":"Enhancing Security by Usage of Universal One-Way Hash Functions","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"last_name":"Terfort","full_name":"Terfort, Tobias","first_name":"Tobias"}],"date_created":"2020-08-29T13:30:56Z","date_updated":"2022-01-06T06:53:50Z","publisher":"Universität Paderborn","citation":{"ama":"Terfort T. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn; 2020.","chicago":"Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","ieee":"T. Terfort, <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","apa":"Terfort, T. (2020). <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn.","short":"T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions, Universität Paderborn, 2020.","bibtex":"@book{Terfort_2020, title={Enhancing Security by Usage of Universal One-Way Hash Functions}, publisher={Universität Paderborn}, author={Terfort, Tobias}, year={2020} }","mla":"Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020."},"year":"2020"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"15770","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2020-02-04T13:47:02Z","author":[{"first_name":"Daniel","full_name":"Warner, Daniel","last_name":"Warner"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:32Z","title":"On the complexity of local transformations in SDN overlays","citation":{"bibtex":"@book{Warner_2020, title={On the complexity of local transformations in SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020} }","short":"D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.","mla":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","apa":"Warner, D. (2020). <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn.","ama":"Warner D. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn; 2020.","chicago":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","ieee":"D. Warner, <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn, 2020."},"year":"2020"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Project Area T","_id":"82"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"name":"SFB 901 - Subproject B1","_id":"9"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Subproject C3","_id":"15"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Subproject C5","_id":"17"},{"_id":"83","name":"SFB 901 -Subproject T1"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901 -Subproject T3","_id":"107"},{"name":"SFB 901 - T4: SFB 901 -Subproject T4","_id":"158"}],"_id":"13770","user_id":"477","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"file_date_updated":"2019-12-12T10:24:47Z","type":"journal_article","status":"public","date_updated":"2022-12-02T09:27:17Z","author":[{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"volume":62,"doi":"10.1007/s12599-019-00627-x","publication_status":"published","has_accepted_license":"1","citation":{"ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>. 2020;62(6):467-481. doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>","chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>.","ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>}, number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38; Information Systems Engineering 62 (2020) 467–481.","apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>, <i>62</i>(6), 467–481. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>"},"page":"467-481","intvolume":"        62","ddc":["004"],"language":[{"iso":"eng"}],"publication":"Business & Information Systems Engineering","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"15311","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","file_size":454532,"date_created":"2019-12-12T10:24:47Z","creator":"ups","date_updated":"2019-12-12T10:24:47Z"}],"publisher":"Springer","date_created":"2019-10-10T13:41:06Z","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","issue":"6","year":"2020"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"25078","department":[{"_id":"7"},{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"18638","citation":{"chicago":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","ieee":"P. Kramer, <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","ama":"Kramer P. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn; 2020.","bibtex":"@book{Kramer_2020, title={Comparison of Zero-Knowledge Range Proofs}, publisher={Universität Paderborn}, author={Kramer, Paul}, year={2020} }","short":"P. Kramer, Comparison of Zero-Knowledge Range Proofs, Universität Paderborn, 2020.","mla":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","apa":"Kramer, P. (2020). <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn."},"year":"2020","title":"Comparison of Zero-Knowledge Range Proofs","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2020-08-29T13:27:11Z","author":[{"first_name":"Paul","last_name":"Kramer","full_name":"Kramer, Paul","id":"64594"}],"publisher":"Universität Paderborn","date_updated":"2022-10-17T10:56:59Z"},{"file_date_updated":"2019-01-26T16:09:08Z","department":[{"_id":"79"}],"user_id":"34727","_id":"6976","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"status":"public","type":"conference","conference":{"location":"Rio de Janeiro, Brazil","end_date":"24.05.19","start_date":"20.05.19","name":"2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS '19)"},"author":[{"first_name":"Thorsten","last_name":"Götte","id":"34727","full_name":"Götte, Thorsten"},{"first_name":"Vipin Ravindran","full_name":"Vijayalakshmi, Vipin Ravindran","last_name":"Vijayalakshmi"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T07:03:25Z","citation":{"ama":"Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. IEEE.","ieee":"T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary,” in <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>, Rio de Janeiro, Brazil.","chicago":"Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. IEEE, n.d.","apa":"Götte, T., Vijayalakshmi, V. R., &#38; Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. Rio de Janeiro, Brazil: IEEE.","mla":"Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>, IEEE.","bibtex":"@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE}, author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian} }","short":"T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d."},"has_accepted_license":"1","publication_status":"accepted","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"date_updated":"2019-01-26T16:09:08Z","creator":"thgoette","date_created":"2019-01-26T16:09:08Z","file_size":638020,"file_name":"Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf","file_id":"7007","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes joining and leaving the network. We assume an adversary that may churn a\r\nconstant fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds. In particular, the adversary has an almost up-to-date information of\r\nthe network topology as it can observe an only slightly outdated topology that\r\nis at least $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction that new nodes can only join the network via nodes that have taken\r\npart in the network for at least one round.\r\n  Our contributions are as follows: First, we show that it is impossible to\r\nmaintain a connected topology if adversary has up-to-date information about the\r\nnodes' connections. Further, we show that our restriction concerning the join\r\nis also necessary. As our main result present an algorithm that constructs a\r\nnew overlay- completely independent of all previous overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which will be maintained by the\r\nalgorithm. However, our approaches can be transferred to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."}],"publication":"Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS '19)","title":"Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary","date_created":"2019-01-24T18:53:11Z","publisher":"IEEE","year":"2019"},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"14830","status":"public","type":"journal_article","publication":"Theory Comput. Syst.","doi":"10.1007/s00224-017-9823-4","title":"Self-Stabilizing Metric Graphs","author":[{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"full_name":"Lefevre, Jonas","last_name":"Lefevre","first_name":"Jonas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2019-11-06T10:54:58Z","volume":63,"date_updated":"2022-01-06T06:52:07Z","citation":{"mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, 2019, pp. 177–99, doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>.","bibtex":"@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs}, volume={63}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>}, number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }","short":"R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.","apa":"Gmyr, R., Lefevre, J., &#38; Scheideler, C. (2019). Self-Stabilizing Metric Graphs. <i>Theory Comput. Syst.</i>, <i>63</i>(2), 177–199. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>","ama":"Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. <i>Theory Comput Syst</i>. 2019;63(2):177-199. doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>","ieee":"R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, pp. 177–199, 2019.","chicago":"Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i> 63, no. 2 (2019): 177–99. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>."},"intvolume":"        63","page":"177-199","year":"2019","issue":"2"}]