[{"author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Brauer, Sascha","id":"13291","last_name":"Brauer","first_name":"Sascha"},{"full_name":"Bujna, Kathrin","last_name":"Bujna","first_name":"Kathrin"}],"date_created":"2018-06-04T12:26:51Z","publisher":"Computing Research Repository","oa":"1","date_updated":"2022-01-06T06:58:49Z","main_file_link":[{"url":"https://arxiv.org/abs/1603.06478","open_access":"1"}],"title":"Hard-Clustering with Gaussian Mixture Models","citation":{"ama":"Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 2016.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","short":"J. Blömer, S. Brauer, K. Bujna, (2016).","bibtex":"@article{Blömer_Brauer_Bujna_2016, title={Hard-Clustering with Gaussian Mixture Models}, publisher={Computing Research Repository}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016} }","mla":"Blömer, Johannes, et al. <i>Hard-Clustering with Gaussian Mixture Models</i>. Computing Research Repository, 2016.","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository."},"year":"2016","department":[{"_id":"64"}],"user_id":"25078","_id":"2969","type":"preprint","status":"public"},{"user_id":"25078","department":[{"_id":"64"}],"_id":"2970","type":"book_chapter","publication":"Advances in Knowledge Discovery and Data Mining","status":"public","date_created":"2018-06-04T12:27:21Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Kathrin","last_name":"Bujna","full_name":"Bujna, Kathrin"}],"date_updated":"2022-01-06T06:58:49Z","publisher":"Springer International Publishing","doi":"10.1007/978-3-319-31750-2_24","title":"Adaptive Seeding for Gaussian Mixture Models","publication_status":"published","publication_identifier":{"isbn":["9783319317496","9783319317502"],"issn":["0302-9743","1611-3349"]},"citation":{"short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” <i>Advances in Knowledge Discovery and Data Mining</i>, Springer International Publishing, 2016, pp. 296–308, doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>.","apa":"Blömer, J., &#38; Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In <i>Advances in Knowledge Discovery and Data Mining</i> (pp. 296–308). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: <i>Advances in Knowledge Discovery and Data Mining</i>. Cham: Springer International Publishing; 2016:296-308. doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>","ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in <i>Advances in Knowledge Discovery and Data Mining</i>, Cham: Springer International Publishing, 2016, pp. 296–308.","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In <i>Advances in Knowledge Discovery and Data Mining</i>, 296–308. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>."},"page":"296-308","year":"2016","place":"Cham"},{"publication_status":"published","year":"2016","citation":{"short":"J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","bibtex":"@book{Blömer_Günther_2016, title={Effizienz und Sicherheit paarungsbasierter Kryptographie}, publisher={Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops}, author={Blömer, Johannes and Günther, Peter}, year={2016} }","mla":"Blömer, Johannes, and Peter Günther. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","apa":"Blömer, J., &#38; Günther, P. (2016). <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.","ama":"Blömer J, Günther P. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016.","ieee":"J. Blömer and P. Günther, <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","chicago":"Blömer, Johannes, and Peter Günther. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016."},"publisher":"Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops","date_updated":"2022-01-06T06:58:49Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Günther, Peter","last_name":"Günther","first_name":"Peter"}],"date_created":"2018-06-05T07:21:25Z","title":"Effizienz und Sicherheit paarungsbasierter Kryptographie","type":"report","status":"public","_id":"2971","user_id":"25078","department":[{"_id":"64"}]},{"department":[{"_id":"64"}],"user_id":"477","_id":"213","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"type":"bachelorsthesis","status":"public","author":[{"first_name":"Laurens","last_name":"Porzenheim","full_name":"Porzenheim, Laurens"}],"date_created":"2017-10-17T12:41:33Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_updated":"2022-01-06T06:54:53Z","publisher":"Universität Paderborn","title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","citation":{"chicago":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016.","ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","bibtex":"@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim, Laurens}, year={2016} }","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016.","mla":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016."},"year":"2016"},{"user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"214","status":"public","type":"bachelorsthesis","title":"Commitment Schemes - Definitions, Variants, and Security","date_created":"2017-10-17T12:41:33Z","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"author":[{"first_name":"Kai Sören","full_name":"Bemmann, Kai Sören","last_name":"Bemmann"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:58Z","citation":{"mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016.","bibtex":"@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants, and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören}, year={2016} }","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn.","ama":"Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn; 2016.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","ieee":"K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016."},"year":"2016"},{"abstract":[{"lang":"eng","text":"One of the most popular fuzzy clustering techniques is the fuzzy K-means algorithm (also known as fuzzy-c-means or FCM algorithm). In contrast to the K-means and K-median problem, the underlying fuzzy K-means problem has not been studied from a theoretical point of view. In particular, there are no algorithms with approximation guarantees similar to the famous K-means++ algorithm known for the fuzzy K-means problem. This work initiates the study of the fuzzy K-means problem from an algorithmic and complexity theoretic perspective. We show that optimal solutions for the fuzzy K-means problem cannot, in general, be expressed by radicals over the input points. Surprisingly, this already holds for simple inputs in one-dimensional space. Hence, one cannot expect to compute optimal solutions exactly. We give the first (1+eps)-approximation algorithms for the fuzzy K-means problem. First, we present a deterministic approximation algorithm whose runtime is polynomial in N and linear in the dimension D of the input set, given that K is constant, i.e. a polynomial time approximation scheme (PTAS) for fixed K. We achieve this result by showing that for each soft clustering there exists a hard clustering with similar properties. Second, by using techniques known from coreset constructions for the K-means problem, we develop a deterministic approximation algorithm that runs in time almost linear in N but exponential in the dimension D. We complement these results with a randomized algorithm which imposes some natural restrictions on the sought solution and whose runtime is comparable to some of the most efficient approximation algorithms for K-means, i.e. linear in the number of points and the dimension, but exponential in the number of clusters."}],"status":"public","type":"conference","publication":"2016 IEEE 16th International Conference on Data Mining (ICDM)","keyword":["unsolvability by radicals","clustering","fuzzy k-means","probabilistic method","approximation algorithms","randomized algorithms"],"language":[{"iso":"eng"}],"_id":"2367","user_id":"25078","department":[{"_id":"64"}],"year":"2016","citation":{"short":"J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–810.","mla":"Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.” <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>, IEEE, 2016, pp. 805–10, doi:<a href=\"https://doi.org/10.1109/icdm.2016.0094\">10.1109/icdm.2016.0094</a>.","bibtex":"@inproceedings{Blömer_Brauer_Bujna_2016, title={A Theoretical Analysis of the Fuzzy K-Means Problem}, DOI={<a href=\"https://doi.org/10.1109/icdm.2016.0094\">10.1109/icdm.2016.0094</a>}, booktitle={2016 IEEE 16th International Conference on Data Mining (ICDM)}, publisher={IEEE}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016}, pages={805–810} }","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2016). A Theoretical Analysis of the Fuzzy K-Means Problem. In <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i> (pp. 805–810). Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/icdm.2016.0094\">https://doi.org/10.1109/icdm.2016.0094</a>","ama":"Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem. In: <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>. IEEE; 2016:805-810. doi:<a href=\"https://doi.org/10.1109/icdm.2016.0094\">10.1109/icdm.2016.0094</a>","ieee":"J. Blömer, S. Brauer, and K. Bujna, “A Theoretical Analysis of the Fuzzy K-Means Problem,” in <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>, Barcelona, Spain, 2016, pp. 805–810.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.” In <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>, 805–10. IEEE, 2016. <a href=\"https://doi.org/10.1109/icdm.2016.0094\">https://doi.org/10.1109/icdm.2016.0094</a>."},"page":"805-810","publication_status":"published","publication_identifier":{"isbn":["9781509054732"]},"title":"A Theoretical Analysis of the Fuzzy K-Means Problem","doi":"10.1109/icdm.2016.0094","conference":{"end_date":"2016-12-15","location":"Barcelona, Spain","name":"IEEE 16th International Conference on Data Mining (ICDM)","start_date":"2016-12-12"},"date_updated":"2022-01-06T06:55:58Z","publisher":"IEEE","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Sascha","last_name":"Brauer","full_name":"Brauer, Sascha","id":"13291"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"}],"date_created":"2018-04-17T11:46:07Z"},{"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Gennadij","last_name":"Liske","full_name":"Liske, Gennadij"}],"date_created":"2017-10-17T12:41:32Z","date_updated":"2022-01-06T06:54:39Z","doi":"10.1007/978-3-319-29485-8_25","title":"Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes","has_accepted_license":"1","citation":{"mla":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>.","bibtex":"@inproceedings{Blömer_Liske_2016, series={LNCS}, title={Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>}, booktitle={Proceedings of the CT-RSA 2016}, author={Blömer, Johannes and Liske, Gennadij}, year={2016}, pages={431–447}, collection={LNCS} }","short":"J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.","apa":"Blömer, J., &#38; Liske, G. (2016). Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In <i>Proceedings of the CT-RSA 2016</i> (pp. 431–447). <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>","chicago":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” In <i>Proceedings of the CT-RSA 2016</i>, 431–47. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>.","ieee":"J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–447.","ama":"Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: <i>Proceedings of the CT-RSA 2016</i>. LNCS. ; 2016:431-447. doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>"},"page":"431-447","year":"2016","series_title":"LNCS","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"208","file_date_updated":"2018-03-21T10:43:36Z","ddc":["040"],"type":"conference","publication":"Proceedings of the CT-RSA 2016","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T10:43:36Z","creator":"florida","date_updated":"2018-03-21T10:43:36Z","file_id":"1521","access_level":"closed","file_name":"208-aCCA_P-KEM_final.pdf","file_size":462666}],"status":"public","abstract":[{"text":"This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way.","lang":"eng"}]},{"file":[{"date_created":"2018-03-21T12:43:21Z","creator":"florida","date_updated":"2018-03-21T12:43:21Z","access_level":"closed","file_name":"167-thesis_peter_guenther.pdf","file_id":"1542","file_size":9456552,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"dissertation","file_date_updated":"2018-03-21T12:43:21Z","ddc":["040"],"user_id":"25078","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"167","citation":{"chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","ieee":"P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn, 2016.","ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn; 2016.","short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","bibtex":"@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }","apa":"Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn."},"year":"2016","has_accepted_license":"1","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"title":"Physical attacks on pairing-based cryptography","date_created":"2017-10-17T12:41:24Z","author":[{"first_name":"Peter","full_name":"Günther, Peter","last_name":"Günther"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:54Z"},{"type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"146","citation":{"apa":"Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn.","bibtex":"@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm, Julian}, year={2016} }","short":"J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on Attributes, Universität Paderborn, 2016.","mla":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ama":"Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn; 2016.","chicago":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ieee":"J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016."},"year":"2016","date_created":"2017-10-17T12:41:20Z","author":[{"last_name":"Hamm","full_name":"Hamm, Julian","first_name":"Julian"}],"supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:03Z","title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes"},{"title":"Short Randomizable Aggregatable Signatures: Constructions and Security Analysis","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:16Z","author":[{"last_name":"Dallmeier","full_name":"Dallmeier, Fynn","first_name":"Fynn"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:21Z","year":"2016","citation":{"apa":"Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn.","bibtex":"@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier, Fynn}, year={2016} }","mla":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","short":"F. Dallmeier, Short Randomizable Aggregatable Signatures: Constructions and Security Analysis, Universität Paderborn, 2016.","ama":"Dallmeier F. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn; 2016.","ieee":"F. Dallmeier, <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","chicago":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016."},"_id":"152","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477","status":"public","type":"bachelorsthesis"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"year":"2016","place":"Cham","citation":{"ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in <i>Advances in Knowledge Discovery and Data Mining</i>, Cham: Springer International Publishing, 2016, pp. 296–308.","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In <i>Advances in Knowledge Discovery and Data Mining</i>, 296–308. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>.","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: <i>Advances in Knowledge Discovery and Data Mining</i>. Springer International Publishing; 2016:296-308. doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” <i>Advances in Knowledge Discovery and Data Mining</i>, Springer International Publishing, 2016, pp. 296–308, doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>.","short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }","apa":"Blömer, J., &#38; Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In <i>Advances in Knowledge Discovery and Data Mining</i> (pp. 296–308). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>"},"page":"296-308","publisher":"Springer International Publishing","date_updated":"2023-01-10T13:49:50Z","date_created":"2018-06-05T07:31:39Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"full_name":"Bujna, Kathrin","last_name":"Bujna","first_name":"Kathrin"}],"title":"Adaptive Seeding for Gaussian Mixture Models","doi":"10.1007/978-3-319-31750-2_24","type":"book_chapter","publication":"Advances in Knowledge Discovery and Data Mining","status":"public","_id":"2978","user_id":"25078","department":[{"_id":"64"}]},{"type":"conference","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"KogniHome - die mitdenkende Wohnung","_id":"44"}],"_id":"253","user_id":"13703","series_title":"LNCS","department":[{"_id":"64"}],"file_date_updated":"2018-11-02T14:08:23Z","has_accepted_license":"1","related_material":{"record":[{"id":"325","relation":"other","status":"public"}]},"citation":{"short":"J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.","mla":"Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.” <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2015, pp. 166–80, doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>.","bibtex":"@inproceedings{Blömer_Juhnke_Löken_2015, series={LNCS}, title={Short Group Signatures with Distributed Traceability}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>}, booktitle={Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Juhnke, Jakob and Löken, Nils}, year={2015}, pages={166–180}, collection={LNCS} }","apa":"Blömer, J., Juhnke, J., &#38; Löken, N. (2015). Short Group Signatures with Distributed Traceability. In <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (pp. 166–180). <a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">https://doi.org/10.1007/978-3-319-32859-1_14</a>","ieee":"J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2015, pp. 166–180.","chicago":"Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures with Distributed Traceability.” In <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 166–80. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">https://doi.org/10.1007/978-3-319-32859-1_14</a>.","ama":"Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability. In: <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. LNCS. ; 2015:166-180. doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>"},"page":"166-180","date_updated":"2022-01-06T06:59:07Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Jakob","id":"48090","full_name":"Juhnke, Jakob","last_name":"Juhnke"},{"id":"13703","full_name":"Löken, Nils","last_name":"Löken","first_name":"Nils"}],"doi":"10.1007/978-3-319-32859-1_14","publication":"Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","abstract":[{"text":"Group signatures, introduced by Chaum and van Heyst [15], are an important primitive in cryptography. In group signature schemes every group member can anonymously sign messages on behalf of the group. In case of disputes a dedicated opening manager is able to trace signatures - he can extract the identity of the producer of a given signature. A formal model for static group signatures schemes and their security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic groups is considered by Bellare, Shi, and Zhang [5]. Both models define group signature schemes with a single opening manager. The main difference between these models is that the number of group members in static schemes is fixed, while in dynamic schemes group members can join the group over time.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:08:23Z","creator":"ups","date_created":"2018-11-02T14:08:23Z","file_size":262436,"file_name":"ShortGroupSignaturesWithDistri.pdf","access_level":"closed","file_id":"5262"}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2015","date_created":"2017-10-17T12:41:41Z","title":"Short Group Signatures with Distributed Traceability"},{"year":"2015","citation":{"apa":"Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn.","short":"B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup, Universität Paderborn, 2015.","bibtex":"@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt}, year={2015} }","mla":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","ieee":"B. Kalde, <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","chicago":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","ama":"Kalde B. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn; 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:10Z","date_created":"2017-10-17T12:41:47Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"full_name":"Kalde, Benedikt","last_name":"Kalde","first_name":"Benedikt"}],"title":"Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup","type":"bachelorsthesis","status":"public","_id":"286","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","language":[{"iso":"ger"}]},{"citation":{"apa":"Strotmann, D. (2015). <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>.","mla":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>. 2015.","bibtex":"@book{Strotmann_2015, title={Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen}, author={Strotmann, Daniela}, year={2015} }","short":"D. Strotmann, Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015.","ieee":"D. Strotmann, <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>. 2015.","chicago":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>, 2015.","ama":"Strotmann D. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.; 2015."},"status":"public","year":"2015","type":"bachelorsthesis","title":"Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen","date_created":"2018-05-24T13:05:41Z","user_id":"25078","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"first_name":"Daniela","full_name":"Strotmann, Daniela","last_name":"Strotmann"}],"department":[{"_id":"64"}],"date_updated":"2022-01-06T06:58:12Z","_id":"2865"},{"citation":{"apa":"Eisenhofer, T. (2015). <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn.","bibtex":"@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung}, publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015} }","short":"T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität Paderborn, 2015.","mla":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","ama":"Eisenhofer T. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn; 2015.","ieee":"T. Eisenhofer, <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","chicago":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015."},"year":"2015","title":"Protokolle zur authentifizierten Schüsselvereinbarung","author":[{"first_name":"Thorsten","full_name":"Eisenhofer, Thorsten","last_name":"Eisenhofer"}],"date_created":"2017-10-17T12:41:43Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_updated":"2022-01-06T06:57:16Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"department":[{"_id":"64"}],"user_id":"477","_id":"261","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"date_created":"2017-10-17T12:41:54Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"}],"date_updated":"2022-01-06T06:59:05Z","publisher":"Universität Paderborn","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","has_accepted_license":"1","citation":{"apa":"Eidens, F. (2015). <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn.","mla":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015.","bibtex":"@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }","ama":"Eidens F. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn; 2015.","ieee":"F. Eidens, <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","chicago":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015."},"year":"2015","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"321","file_date_updated":"2018-03-20T07:40:22Z","ddc":["040"],"type":"mastersthesis","file":[{"file_size":879285,"file_id":"1432","access_level":"closed","file_name":"321-eidens_masterthesis_01.pdf","date_updated":"2018-03-20T07:40:22Z","date_created":"2018-03-20T07:40:22Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public"},{"date_created":"2017-10-17T12:41:54Z","title":"Anonymous and Publicly Linkable Reputation Systems","year":"2015","ddc":["040"],"publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","abstract":[{"text":"Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-20T07:39:54Z","date_updated":"2018-03-20T07:39:54Z","access_level":"closed","file_id":"1431","file_name":"322-546_01.pdf","file_size":499568}],"oa":"1","date_updated":"2022-01-06T06:59:05Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Jakob","last_name":"Juhnke","id":"48090","full_name":"Juhnke, Jakob"},{"last_name":"Kolb","id":"43647","full_name":"Kolb, Christina","first_name":"Christina"}],"doi":"10.1007/978-3-662-47854-7_29","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/546"}],"has_accepted_license":"1","page":"478--488","citation":{"apa":"Blömer, J., Juhnke, J., &#38; Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i> (pp. 478--488). <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>","bibtex":"@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous and Publicly Linkable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>}, booktitle={Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb, Christina}, year={2015}, pages={478--488}, collection={LNCS} }","mla":"Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488, doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>.","short":"J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.","chicago":"Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 478--488. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>.","ieee":"J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488.","ama":"Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>. LNCS. ; 2015:478--488. doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>"},"_id":"322","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"series_title":"LNCS","user_id":"48090","file_date_updated":"2018-03-20T07:39:54Z","type":"conference","status":"public"},{"user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"325","status":"public","type":"mastersthesis","title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","author":[{"full_name":"Löken, Nils","id":"13703","last_name":"Löken","first_name":"Nils"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:55Z","date_updated":"2022-01-06T06:59:07Z","publisher":"Universität Paderborn","citation":{"ama":"Löken N. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn; 2015.","ieee":"N. Löken, <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","chicago":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn.","mla":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","short":"N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption, Universität Paderborn, 2015.","bibtex":"@book{Löken_2015, title={A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2015} }"},"year":"2015","related_material":{"record":[{"status":"public","id":"253","relation":"other"}]}},{"status":"public","type":"bachelorsthesis","department":[{"_id":"64"}],"user_id":"477","_id":"326","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"ama":"Heihoff F. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn; 2015.","ieee":"F. Heihoff, <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn, 2015.","chicago":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn.","short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015.","bibtex":"@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption}, publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }","mla":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015."},"year":"2015","title":"A group signature scheme based on the LSRW assumption","author":[{"full_name":"Heihoff, Frederic","last_name":"Heihoff","first_name":"Frederic"}],"date_created":"2017-10-17T12:41:55Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:07Z"},{"citation":{"bibtex":"@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }","mla":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","short":"M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015.","apa":"Sosniak, M. (2015). <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn.","ama":"Sosniak M. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn; 2015.","chicago":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","ieee":"M. Sosniak, <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015."},"year":"2015","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"date_created":"2017-10-17T12:41:50Z","author":[{"first_name":"Martin","last_name":"Sosniak","full_name":"Sosniak, Martin"}],"date_updated":"2022-01-06T06:58:49Z","publisher":"Universität Paderborn","title":"Evaluation of Pairing Optimization for Embedded Platforms","type":"mastersthesis","status":"public","user_id":"25078","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"297"}]