[{"year":"2016","place":"Cham","page":"81-116","citation":{"apa":"Blömer, J., Lammersen, C., Schmidt, M., &#38; Sohler, C. (2016). Theoretical Analysis of the k-Means Algorithm – A Survey. In <i>Algorithm Engineering</i> (pp. 81–116). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">https://doi.org/10.1007/978-3-319-49487-6_3</a>","bibtex":"@inbook{Blömer_Lammersen_Schmidt_Sohler_2016, place={Cham}, title={Theoretical Analysis of the k-Means Algorithm – A Survey}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">10.1007/978-3-319-49487-6_3</a>}, booktitle={Algorithm Engineering}, publisher={Springer International Publishing}, author={Blömer, Johannes and Lammersen, Christiane and Schmidt, Melanie and Sohler, Christian}, year={2016}, pages={81–116} }","short":"J. Blömer, C. Lammersen, M. Schmidt, C. Sohler, in: Algorithm Engineering, Springer International Publishing, Cham, 2016, pp. 81–116.","mla":"Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A Survey.” <i>Algorithm Engineering</i>, Springer International Publishing, 2016, pp. 81–116, doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">10.1007/978-3-319-49487-6_3</a>.","ieee":"J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis of the k-Means Algorithm – A Survey,” in <i>Algorithm Engineering</i>, Cham: Springer International Publishing, 2016, pp. 81–116.","chicago":"Blömer, Johannes, Christiane Lammersen, Melanie Schmidt, and Christian Sohler. “Theoretical Analysis of the K-Means Algorithm – A Survey.” In <i>Algorithm Engineering</i>, 81–116. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">https://doi.org/10.1007/978-3-319-49487-6_3</a>.","ama":"Blömer J, Lammersen C, Schmidt M, Sohler C. Theoretical Analysis of the k-Means Algorithm – A Survey. In: <i>Algorithm Engineering</i>. Cham: Springer International Publishing; 2016:81-116. doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">10.1007/978-3-319-49487-6_3</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319494869","9783319494876"]},"publication_status":"published","title":"Theoretical Analysis of the k-Means Algorithm – A Survey","doi":"10.1007/978-3-319-49487-6_3","date_updated":"2022-01-06T06:58:49Z","publisher":"Springer International Publishing","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"last_name":"Lammersen","full_name":"Lammersen, Christiane","first_name":"Christiane"},{"first_name":"Melanie","last_name":"Schmidt","full_name":"Schmidt, Melanie"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"date_created":"2018-06-04T12:22:40Z","status":"public","publication":"Algorithm Engineering","type":"book_chapter","_id":"2968","department":[{"_id":"64"}],"user_id":"25078"},{"citation":{"apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.","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} }","short":"J. Blömer, S. Brauer, K. Bujna, (2016).","mla":"Blömer, Johannes, et al. <i>Hard-Clustering with Gaussian Mixture Models</i>. Computing Research Repository, 2016.","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."},"year":"2016","date_created":"2018-06-04T12:26:51Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Sascha","id":"13291","full_name":"Brauer, Sascha","last_name":"Brauer"},{"full_name":"Bujna, Kathrin","last_name":"Bujna","first_name":"Kathrin"}],"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","type":"preprint","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"2969"},{"type":"book_chapter","publication":"Advances in Knowledge Discovery and Data Mining","status":"public","_id":"2970","user_id":"25078","department":[{"_id":"64"}],"publication_status":"published","publication_identifier":{"isbn":["9783319317496","9783319317502"],"issn":["0302-9743","1611-3349"]},"year":"2016","place":"Cham","citation":{"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>","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>.","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} }","short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 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>.","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.","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>"},"page":"296-308","publisher":"Springer International Publishing","date_updated":"2022-01-06T06:58:49Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"}],"date_created":"2018-06-04T12:27:21Z","title":"Adaptive Seeding for Gaussian Mixture Models","doi":"10.1007/978-3-319-31750-2_24"},{"publication_status":"published","year":"2016","citation":{"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} }","short":"J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 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":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Peter","last_name":"Günther","full_name":"Günther, 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"}]},{"author":[{"last_name":"Hofheinz","full_name":"Hofheinz, Dennis","first_name":"Dennis"},{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"}],"date_created":"2018-06-07T09:12:15Z","date_updated":"2022-01-06T06:58:56Z","doi":"10.1007/s10623-015-0062-x","title":"Tightly secure signatures and public-key encryption","issue":"1","page":"29--61","citation":{"chicago":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” <i>Des. Codes Cryptography</i>, no. 1 (2016): 29--61. <a href=\"https://doi.org/10.1007/s10623-015-0062-x\">https://doi.org/10.1007/s10623-015-0062-x</a>.","ieee":"D. Hofheinz and T. Jager, “Tightly secure signatures and public-key encryption,” <i>Des. Codes Cryptography</i>, no. 1, pp. 29--61, 2016.","ama":"Hofheinz D, Jager T. Tightly secure signatures and public-key encryption. <i>Des Codes Cryptography</i>. 2016;(1):29--61. doi:<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>","mla":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” <i>Des. Codes Cryptography</i>, no. 1, 2016, pp. 29--61, doi:<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>.","short":"D. Hofheinz, T. Jager, Des. Codes Cryptography (2016) 29--61.","bibtex":"@article{Hofheinz_Jager_2016, title={Tightly secure signatures and public-key encryption}, DOI={<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>}, number={1}, journal={Des. Codes Cryptography}, author={Hofheinz, Dennis and Jager, Tibor}, year={2016}, pages={29--61} }","apa":"Hofheinz, D., &#38; Jager, T. (2016). Tightly secure signatures and public-key encryption. <i>Des. Codes Cryptography</i>, (1), 29--61. <a href=\"https://doi.org/10.1007/s10623-015-0062-x\">https://doi.org/10.1007/s10623-015-0062-x</a>"},"year":"2016","department":[{"_id":"558"}],"user_id":"38235","_id":"3112","extern":"1","publication":"Des. Codes Cryptography","type":"journal_article","status":"public"},{"date_updated":"2022-01-06T06:58:56Z","author":[{"last_name":"Heuer","full_name":"Heuer, Felix","first_name":"Felix"},{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"},{"first_name":"Sven","full_name":"Schäge, Sven","last_name":"Schäge"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"}],"date_created":"2018-06-07T09:12:50Z","title":"Selective opening security of practical public-key encryption schemes","doi":"10.1049/iet-ifs.2015.0507","issue":"6","year":"2016","citation":{"ama":"Heuer F, Jager T, Schäge S, Kiltz E. Selective opening security of practical public-key encryption schemes. <i>IET Information Security</i>. 2016;(6):304--318. doi:<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>","chicago":"Heuer, Felix, Tibor Jager, Sven Schäge, and Eike Kiltz. “Selective Opening Security of Practical Public-Key Encryption Schemes.” <i>IET Information Security</i>, no. 6 (2016): 304--318. <a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">https://doi.org/10.1049/iet-ifs.2015.0507</a>.","ieee":"F. Heuer, T. Jager, S. Schäge, and E. Kiltz, “Selective opening security of practical public-key encryption schemes,” <i>IET Information Security</i>, no. 6, pp. 304--318, 2016.","mla":"Heuer, Felix, et al. “Selective Opening Security of Practical Public-Key Encryption Schemes.” <i>IET Information Security</i>, no. 6, 2016, pp. 304--318, doi:<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>.","bibtex":"@article{Heuer_Jager_Schäge_Kiltz_2016, title={Selective opening security of practical public-key encryption schemes}, DOI={<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>}, number={6}, journal={IET Information Security}, author={Heuer, Felix and Jager, Tibor and Schäge, Sven and Kiltz, Eike}, year={2016}, pages={304--318} }","short":"F. Heuer, T. Jager, S. Schäge, E. Kiltz, IET Information Security (2016) 304--318.","apa":"Heuer, F., Jager, T., Schäge, S., &#38; Kiltz, E. (2016). Selective opening security of practical public-key encryption schemes. <i>IET Information Security</i>, (6), 304--318. <a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">https://doi.org/10.1049/iet-ifs.2015.0507</a>"},"page":"304--318","_id":"3113","user_id":"38235","department":[{"_id":"558"}],"extern":"1","type":"journal_article","publication":"IET Information Security","status":"public"},{"title":"Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way","date_updated":"2022-01-06T06:58:56Z","date_created":"2018-06-07T09:13:15Z","author":[{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"},{"full_name":"Rupp, Andy","last_name":"Rupp","first_name":"Andy"}],"year":"2016","citation":{"apa":"Jager, T., &#38; Rupp, A. (2016). Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>, (3), 62--82.","mla":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>PoPETs</i>, no. 3, 2016, pp. 62--82.","short":"T. Jager, A. Rupp, PoPETs (2016) 62--82.","bibtex":"@article{Jager_Rupp_2016, title={Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way}, number={3}, journal={PoPETs}, author={Jager, Tibor and Rupp, Andy}, year={2016}, pages={62--82} }","chicago":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>PoPETs</i>, no. 3 (2016): 62--82.","ieee":"T. Jager and A. Rupp, “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way,” <i>PoPETs</i>, no. 3, pp. 62--82, 2016.","ama":"Jager T, Rupp A. Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>. 2016;(3):62--82."},"page":"62--82","issue":"3","extern":"1","_id":"3114","user_id":"38235","department":[{"_id":"558"}],"status":"public","type":"journal_article","publication":"PoPETs"},{"doi":"10.1007/978-3-662-53890-6_24","title":"How to Generate and Use Universal Samplers","author":[{"last_name":"Hofheinz","full_name":"Hofheinz, Dennis","first_name":"Dennis"},{"first_name":"Tibor","full_name":"Jager, Tibor","id":"64669","last_name":"Jager"},{"first_name":"Dakshita","full_name":"Khurana, Dakshita","last_name":"Khurana"},{"first_name":"Amit","full_name":"Sahai, Amit","last_name":"Sahai"},{"last_name":"Waters","full_name":"Waters, Brent","first_name":"Brent"},{"first_name":"Mark","full_name":"Zhandry, Mark","last_name":"Zhandry"}],"date_created":"2018-06-07T09:13:48Z","date_updated":"2022-01-06T06:58:57Z","citation":{"apa":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., &#38; Zhandry, M. (2016). How to Generate and Use Universal Samplers. In <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i> (pp. 715--744). <a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">https://doi.org/10.1007/978-3-662-53890-6_24</a>","short":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, in: Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 715--744.","bibtex":"@inproceedings{Hofheinz_Jager_Khurana_Sahai_Waters_Zhandry_2016, title={How to Generate and Use Universal Samplers}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>}, booktitle={Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager, Tibor and Khurana, Dakshita and Sahai, Amit and Waters, Brent and Zhandry, Mark}, year={2016}, pages={715--744} }","mla":"Hofheinz, Dennis, et al. “How to Generate and Use Universal Samplers.” <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 2016, pp. 715--744, doi:<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>.","ieee":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, and M. Zhandry, “How to Generate and Use Universal Samplers,” in <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 2016, pp. 715--744.","chicago":"Hofheinz, Dennis, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, and Mark Zhandry. “How to Generate and Use Universal Samplers.” In <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 715--744, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">https://doi.org/10.1007/978-3-662-53890-6_24</a>.","ama":"Hofheinz D, Jager T, Khurana D, Sahai A, Waters B, Zhandry M. How to Generate and Use Universal Samplers. In: <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>. ; 2016:715--744. doi:<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>"},"page":"715--744","year":"2016","extern":"1","user_id":"38235","department":[{"_id":"558"}],"_id":"3115","status":"public","type":"conference","publication":"Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II"},{"page":"159--175","citation":{"ama":"Horst M, Grothe M, Jager T, Schwenk J. Breaking PPTP VPNs via RADIUS Encryption. In: <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>. ; 2016:159--175. doi:<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>","chicago":"Horst, Matthias, Martin Grothe, Tibor Jager, and Jörg Schwenk. “Breaking PPTP VPNs via RADIUS Encryption.” In <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 159--175, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">https://doi.org/10.1007/978-3-319-48965-0_10</a>.","ieee":"M. Horst, M. Grothe, T. Jager, and J. Schwenk, “Breaking PPTP VPNs via RADIUS Encryption,” in <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 2016, pp. 159--175.","apa":"Horst, M., Grothe, M., Jager, T., &#38; Schwenk, J. (2016). Breaking PPTP VPNs via RADIUS Encryption. In <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i> (pp. 159--175). <a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">https://doi.org/10.1007/978-3-319-48965-0_10</a>","bibtex":"@inproceedings{Horst_Grothe_Jager_Schwenk_2016, title={Breaking PPTP VPNs via RADIUS Encryption}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>}, booktitle={Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings}, author={Horst, Matthias and Grothe, Martin and Jager, Tibor and Schwenk, Jörg}, year={2016}, pages={159--175} }","short":"M. Horst, M. Grothe, T. Jager, J. Schwenk, in: Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 2016, pp. 159--175.","mla":"Horst, Matthias, et al. “Breaking PPTP VPNs via RADIUS Encryption.” <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 2016, pp. 159--175, doi:<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>."},"year":"2016","doi":"10.1007/978-3-319-48965-0_10","title":"Breaking PPTP VPNs via RADIUS Encryption","author":[{"full_name":"Horst, Matthias","last_name":"Horst","first_name":"Matthias"},{"first_name":"Martin","full_name":"Grothe, Martin","last_name":"Grothe"},{"last_name":"Jager","full_name":"Jager, Tibor","id":"64669","first_name":"Tibor"},{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"}],"date_created":"2018-06-07T09:14:34Z","date_updated":"2022-01-06T06:58:57Z","status":"public","publication":"Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings","type":"conference","extern":"1","department":[{"_id":"558"}],"user_id":"38235","_id":"3116"},{"title":"On the Impossibility of Tight Cryptographic Reductions","doi":"10.1007/978-3-662-49896-5_10","date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:15:15Z","author":[{"full_name":"Bader, Christoph","last_name":"Bader","first_name":"Christoph"},{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"},{"first_name":"Yong","full_name":"Li, Yong","last_name":"Li"},{"full_name":"Schäge, Sven","last_name":"Schäge","first_name":"Sven"}],"year":"2016","citation":{"ieee":"C. Bader, T. Jager, Y. Li, and S. Schäge, “On the Impossibility of Tight Cryptographic Reductions,” in <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 2016, pp. 273--304.","chicago":"Bader, Christoph, Tibor Jager, Yong Li, and Sven Schäge. “On the Impossibility of Tight Cryptographic Reductions.” In <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 273--304, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">https://doi.org/10.1007/978-3-662-49896-5_10</a>.","ama":"Bader C, Jager T, Li Y, Schäge S. On the Impossibility of Tight Cryptographic Reductions. In: <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>. ; 2016:273--304. doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>","apa":"Bader, C., Jager, T., Li, Y., &#38; Schäge, S. (2016). On the Impossibility of Tight Cryptographic Reductions. In <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i> (pp. 273--304). <a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">https://doi.org/10.1007/978-3-662-49896-5_10</a>","bibtex":"@inproceedings{Bader_Jager_Li_Schäge_2016, title={On the Impossibility of Tight Cryptographic Reductions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>}, booktitle={Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II}, author={Bader, Christoph and Jager, Tibor and Li, Yong and Schäge, Sven}, year={2016}, pages={273--304} }","short":"C. Bader, T. Jager, Y. Li, S. Schäge, in: Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, 2016, pp. 273--304.","mla":"Bader, Christoph, et al. “On the Impossibility of Tight Cryptographic Reductions.” <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 2016, pp. 273--304, doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>."},"page":"273--304","extern":"1","_id":"3117","user_id":"38235","department":[{"_id":"558"}],"status":"public","type":"conference","publication":"Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II"},{"date_created":"2018-06-07T09:15:51Z","author":[{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"},{"last_name":"Rupp","full_name":"Rupp, Andy","first_name":"Andy"}],"date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-53644-5_6","title":"Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts","citation":{"apa":"Hofheinz, D., Jager, T., &#38; Rupp, A. (2016). Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts. In <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i> (pp. 146--168). <a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">https://doi.org/10.1007/978-3-662-53644-5_6</a>","short":"D. Hofheinz, T. Jager, A. Rupp, in: Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, 2016, pp. 146--168.","bibtex":"@inproceedings{Hofheinz_Jager_Rupp_2016, title={Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>}, booktitle={Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager, Tibor and Rupp, Andy}, year={2016}, pages={146--168} }","mla":"Hofheinz, Dennis, et al. “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts.” <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 2016, pp. 146--168, doi:<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>.","ama":"Hofheinz D, Jager T, Rupp A. Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts. In: <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>. ; 2016:146--168. doi:<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>","ieee":"D. Hofheinz, T. Jager, and A. Rupp, “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts,” in <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 2016, pp. 146--168.","chicago":"Hofheinz, Dennis, Tibor Jager, and Andy Rupp. “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts.” In <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 146--168, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">https://doi.org/10.1007/978-3-662-53644-5_6</a>."},"page":"146--168","year":"2016","user_id":"38235","department":[{"_id":"558"}],"_id":"3118","extern":"1","type":"conference","publication":"Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II","status":"public"},{"page":"336--362","citation":{"apa":"Hofheinz, D., &#38; Jager, T. (2016). Verifiable Random Functions from Standard Assumptions. In <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i> (pp. 336--362). <a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">https://doi.org/10.1007/978-3-662-49096-9_14</a>","mla":"Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard Assumptions.” <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 2016, pp. 336--362, doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>.","bibtex":"@inproceedings{Hofheinz_Jager_2016, title={Verifiable Random Functions from Standard Assumptions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>}, booktitle={Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I}, author={Hofheinz, Dennis and Jager, Tibor}, year={2016}, pages={336--362} }","short":"D. Hofheinz, T. Jager, in: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, 2016, pp. 336--362.","ama":"Hofheinz D, Jager T. Verifiable Random Functions from Standard Assumptions. In: <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>. ; 2016:336--362. doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>","ieee":"D. Hofheinz and T. Jager, “Verifiable Random Functions from Standard Assumptions,” in <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 2016, pp. 336--362.","chicago":"Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard Assumptions.” In <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 336--362, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">https://doi.org/10.1007/978-3-662-49096-9_14</a>."},"year":"2016","doi":"10.1007/978-3-662-49096-9_14","title":"Verifiable Random Functions from Standard Assumptions","author":[{"last_name":"Hofheinz","full_name":"Hofheinz, Dennis","first_name":"Dennis"},{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"}],"date_created":"2018-06-07T09:16:30Z","date_updated":"2022-01-06T06:58:57Z","status":"public","publication":"Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I","type":"conference","extern":"1","department":[{"_id":"558"}],"user_id":"38235","_id":"3119"},{"has_accepted_license":"1","year":"2016","page":"189--204","citation":{"bibtex":"@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>}, booktitle={Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer, Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture Notes in Computer Science} }","mla":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>.","short":"S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.","apa":"Beringer, S., &#38; Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, &#38; A. Knapp (Eds.), <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i> (pp. 189--204). <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>","ama":"Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:189--204. doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>","ieee":"S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures with Timed Automata,” in <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, 2016, pp. 189--204.","chicago":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” In <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>."},"date_updated":"2022-01-06T06:59:01Z","author":[{"full_name":"Beringer, Steffen","last_name":"Beringer","first_name":"Steffen"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2018-06-13T07:39:35Z","title":"Verification of AUTOSAR Software Architectures with Timed Automata","doi":"10.1007/978-3-319-45943-1_13","publication":"Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings","type":"conference","editor":[{"full_name":"H. ter Beek, Maurice","last_name":"H. ter Beek","first_name":"Maurice"},{"last_name":"Gnesi","full_name":"Gnesi, Stefania","first_name":"Stefania"},{"first_name":"Alexander","full_name":"Knapp, Alexander","last_name":"Knapp"}],"status":"public","file":[{"date_updated":"2018-11-02T14:17:13Z","creator":"ups","date_created":"2018-11-02T14:17:13Z","file_size":2640695,"file_id":"5267","access_level":"closed","file_name":"VerificationOfAUTOSARSoftwareA.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"_id":"3157","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"department":[{"_id":"77"}],"series_title":"Lecture Notes in Computer Science","user_id":"477","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:17:13Z"},{"_id":"3158","department":[{"_id":"77"}],"series_title":"Lecture Notes in Computer Science","user_id":"29719","editor":[{"first_name":"Augusto","full_name":"Sampaio, Augusto","last_name":"Sampaio"},{"last_name":"Wang","full_name":"Wang, Farn","first_name":"Farn"}],"status":"public","publication":"Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings","type":"conference","title":"Verification of Concurrent Programs on Weak Memory Models","doi":"10.1007/978-3-319-46750-4_1","date_updated":"2022-01-06T06:59:01Z","author":[{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2018-06-13T07:41:07Z","year":"2016","page":"3--24","citation":{"short":"O. Travkin, H. Wehrheim, in: A. Sampaio, F. Wang (Eds.), Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp. 3--24.","bibtex":"@inproceedings{Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of Concurrent Programs on Weak Memory Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">10.1007/978-3-319-46750-4_1</a>}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Sampaio, Augusto and Wang, FarnEditors}, year={2016}, pages={3--24}, collection={Lecture Notes in Computer Science} }","mla":"Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>, edited by Augusto Sampaio and Farn Wang, 2016, pp. 3--24, doi:<a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">10.1007/978-3-319-46750-4_1</a>.","apa":"Travkin, O., &#38; Wehrheim, H. (2016). Verification of Concurrent Programs on Weak Memory Models. In A. Sampaio &#38; F. Wang (Eds.), <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i> (pp. 3--24). <a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">https://doi.org/10.1007/978-3-319-46750-4_1</a>","ama":"Travkin O, Wehrheim H. Verification of Concurrent Programs on Weak Memory Models. In: Sampaio A, Wang F, eds. <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:3--24. doi:<a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">10.1007/978-3-319-46750-4_1</a>","chicago":"Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” In <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>, edited by Augusto Sampaio and Farn Wang, 3--24. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46750-4_1\">https://doi.org/10.1007/978-3-319-46750-4_1</a>.","ieee":"O. Travkin and H. Wehrheim, “Verification of Concurrent Programs on Weak Memory Models,” in <i>Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings</i>, 2016, pp. 3--24."}},{"_id":"3159","user_id":"29719","series_title":"Lecture Notes in Computer Science","department":[{"_id":"77"}],"editor":[{"full_name":"Huisman, Marieke","last_name":"Huisman","first_name":"Marieke"}],"status":"public","type":"conference","publication":"Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings","title":"Towards a Thread-Local Proof Technique for Starvation Freedom","doi":"10.1007/978-3-319-33693-0_13","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:42:34Z","author":[{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"first_name":"Oleg","last_name":"Travkin","full_name":"Travkin, Oleg"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"year":"2016","citation":{"ama":"Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique for Starvation Freedom. In: Huisman M, ed. <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:193--209. doi:<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>","ieee":"G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof Technique for Starvation Freedom,” in <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, 2016, pp. 193--209.","chicago":"Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local Proof Technique for Starvation Freedom.” In <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">https://doi.org/10.1007/978-3-319-33693-0_13</a>.","mla":"Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation Freedom.” <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, edited by Marieke Huisman, 2016, pp. 193--209, doi:<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>.","short":"G. Schellhorn, O. Travkin, H. Wehrheim, in: M. Huisman (Ed.), Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016, pp. 193--209.","bibtex":"@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation Freedom}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>}, booktitle={Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings}, author={Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Huisman, MariekeEditor}, year={2016}, pages={193--209}, collection={Lecture Notes in Computer Science} }","apa":"Schellhorn, G., Travkin, O., &#38; Wehrheim, H. (2016). Towards a Thread-Local Proof Technique for Starvation Freedom. In M. Huisman (Ed.), <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i> (pp. 193--209). <a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">https://doi.org/10.1007/978-3-319-33693-0_13</a>"},"page":"193--209"},{"publication":"20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain","type":"conference","editor":[{"first_name":"Panagiota","full_name":"Fatourou, Panagiota","last_name":"Fatourou"},{"last_name":"Jim{\\'{e}}nez","full_name":"Jim{\\'{e}}nez, Ernesto","first_name":"Ernesto"},{"first_name":"Fernando","full_name":"Pedone, Fernando","last_name":"Pedone"}],"status":"public","_id":"3160","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"department":[{"_id":"77"}],"series_title":"LIPIcs","user_id":"29719","year":"2016","page":"35:1--35:17","citation":{"ieee":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving Opacity of a Pessimistic {STM},” in <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, 2016, pp. 35:1--35:17.","chicago":"Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou, Ernesto Jim{\\’{e}}nez, and Fernando Pedone, 35:1--35:17. LIPIcs, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>.","ama":"Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity of a Pessimistic {STM}. In: Fatourou P, Jim{\\’{e}}nez E, Pedone F, eds. <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>. LIPIcs. ; 2016:35:1--35:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>","apa":"Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2016). Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\\’{e}}nez, &#38; F. Pedone (Eds.), <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i> (pp. 35:1--35:17). <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>","bibtex":"@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs}, title={Proving Opacity of a Pessimistic {STM}}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>}, booktitle={20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Fatourou, Panagiota and Jim{\\’{e}}nez, Ernesto and Pedone, FernandoEditors}, year={2016}, pages={35:1--35:17}, collection={LIPIcs} }","mla":"Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>.","short":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou, E. Jim{\\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016, pp. 35:1--35:17."},"date_updated":"2022-01-06T06:59:01Z","author":[{"full_name":"Doherty, Simon","last_name":"Doherty","first_name":"Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2018-06-13T07:44:15Z","title":"Proving Opacity of a Pessimistic {STM}","doi":"10.4230/LIPIcs.OPODIS.2016.35"},{"title":"Deriving approximation tolerance constraints from verification runs","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:45:27Z","author":[{"last_name":"Isenberg","full_name":"Isenberg, Tobias","first_name":"Tobias"},{"first_name":"Marie{-}Christine","full_name":"Jakobs, Marie{-}Christine","last_name":"Jakobs"},{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"year":"2016","citation":{"ama":"Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>. 2016.","ieee":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation tolerance constraints from verification runs,” <i>CoRR</i>, 2016.","chicago":"Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016.","short":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).","bibtex":"@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg, Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016} }","mla":"Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016.","apa":"Isenberg, T., Jakobs, M.-}Christine, Pauck, F., &#38; Wehrheim, H. (2016). Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>."},"_id":"3161","user_id":"29719","department":[{"_id":"77"}],"status":"public","type":"journal_article","publication":"CoRR"},{"user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"210","type":"mastersthesis","status":"public","date_created":"2017-10-17T12:41:33Z","supervisor":[{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"author":[{"first_name":"Lennart","full_name":"Leder, Lennart","last_name":"Leder"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:42Z","title":"Congestion Games with Mixed Objectives","citation":{"bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","mla":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016.","apa":"Leder, L. (2016). <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn.","ieee":"L. Leder, <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","chicago":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","ama":"Leder L. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn; 2016."},"year":"2016"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"213","user_id":"477","department":[{"_id":"64"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:54:53Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:33Z","author":[{"last_name":"Porzenheim","full_name":"Porzenheim, Laurens","first_name":"Laurens"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","year":"2016","citation":{"apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016.","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} }","mla":"Porzenheim, Laurens. <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.","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."}},{"type":"bachelorsthesis","status":"public","department":[{"_id":"64"}],"user_id":"477","_id":"214","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"ama":"Bemmann KS. <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.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn.","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} }"},"year":"2016","date_created":"2017-10-17T12:41:33Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"full_name":"Bemmann, Kai Sören","last_name":"Bemmann","first_name":"Kai Sören"}],"date_updated":"2022-01-06T06:54:58Z","publisher":"Universität Paderborn","title":"Commitment Schemes - Definitions, Variants, and Security"}]