[{"title":"The role of electromagnetic interactions in second harmonic generation from plasmonic metamaterials","year":"2016","publication_identifier":{"issn":["0946-2171","1432-0649"]},"author":[{"last_name":"Alberti","first_name":"Julian","full_name":"Alberti, Julian"},{"last_name":"Linnenbank","first_name":"Heiko","full_name":"Linnenbank, Heiko"},{"first_name":"Stefan","last_name":"Linden","full_name":"Linden, Stefan"},{"first_name":"Yevgen","last_name":"Grynko","full_name":"Grynko, Yevgen","id":"26059"},{"full_name":"Förstner, Jens","first_name":"Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","id":"158"}],"publication_status":"published","date_updated":"2022-01-06T06:59:48Z","article_type":"original","intvolume":"       122","language":[{"iso":"eng"}],"doi":"10.1007/s00340-015-6311-x","issue":"2","publication":"Applied Physics B","abstract":[{"lang":"eng","text":" We report on second harmonic generation spectroscopy on a series of rectangular arrays of split-ring resonators. Within the  sample  series, the  lattice  constants are varied, but the area of the unit cell is kept fixed. The SHG \r\nsignal intensity of the different arrays upon resonant excitation of the fundamental plasmonic mode  strongly depends \r\non the respective arrangement  of  the  split-ring  resonators. This finding can be explained by variations of  the electromagnetic  interactions  between the  split-ring resonators  in the different arrays. The experimental results are in agreement with  numerical calculations based  on the discontinuous Galerkin time-domain method. \r\n\r\n(PDF) The role of electromagnetic interactions.... Available from: https://www.researchgate.net/publication/297612326_The_role_of_electromagnetic_interactions_in_second_harmonic_generation_from_plasmonic_metamaterials [accessed Aug 13 2018]."}],"file":[{"creator":"hclaudia","date_created":"2018-08-13T09:04:39Z","file_name":"2016-03 Alberti,Linnenbank,Lindnen,Grynko,Förstner_The Role of Electromagnetic Interactions In Second Harmonic Generation From Plasmonic Metamaterials_Applied Physics B.pdf","file_size":863943,"access_level":"closed","relation":"main_file","date_updated":"2018-08-13T09:04:39Z","file_id":"3887","success":1,"content_type":"application/pdf"}],"date_created":"2018-08-13T08:59:27Z","keyword":["tet_topic_shg","tet_topic_meta"],"type":"journal_article","department":[{"_id":"61"}],"status":"public","has_accepted_license":"1","page":"45-50","publisher":"Springer Nature","_id":"3886","user_id":"55706","ddc":["530"],"volume":122,"file_date_updated":"2018-08-13T09:04:39Z","citation":{"ama":"Alberti J, Linnenbank H, Linden S, Grynko Y, Förstner J. The role of electromagnetic interactions in second harmonic generation from plasmonic metamaterials. <i>Applied Physics B</i>. 2016;122(2):45-50. doi:<a href=\"https://doi.org/10.1007/s00340-015-6311-x\">10.1007/s00340-015-6311-x</a>","bibtex":"@article{Alberti_Linnenbank_Linden_Grynko_Förstner_2016, title={The role of electromagnetic interactions in second harmonic generation from plasmonic metamaterials}, volume={122}, DOI={<a href=\"https://doi.org/10.1007/s00340-015-6311-x\">10.1007/s00340-015-6311-x</a>}, number={2}, journal={Applied Physics B}, publisher={Springer Nature}, author={Alberti, Julian and Linnenbank, Heiko and Linden, Stefan and Grynko, Yevgen and Förstner, Jens}, year={2016}, pages={45–50} }","mla":"Alberti, Julian, et al. “The Role of Electromagnetic Interactions in Second Harmonic Generation from Plasmonic Metamaterials.” <i>Applied Physics B</i>, vol. 122, no. 2, Springer Nature, 2016, pp. 45–50, doi:<a href=\"https://doi.org/10.1007/s00340-015-6311-x\">10.1007/s00340-015-6311-x</a>.","chicago":"Alberti, Julian, Heiko Linnenbank, Stefan Linden, Yevgen Grynko, and Jens Förstner. “The Role of Electromagnetic Interactions in Second Harmonic Generation from Plasmonic Metamaterials.” <i>Applied Physics B</i> 122, no. 2 (2016): 45–50. <a href=\"https://doi.org/10.1007/s00340-015-6311-x\">https://doi.org/10.1007/s00340-015-6311-x</a>.","short":"J. Alberti, H. Linnenbank, S. Linden, Y. Grynko, J. Förstner, Applied Physics B 122 (2016) 45–50.","apa":"Alberti, J., Linnenbank, H., Linden, S., Grynko, Y., &#38; Förstner, J. (2016). The role of electromagnetic interactions in second harmonic generation from plasmonic metamaterials. <i>Applied Physics B</i>, <i>122</i>(2), 45–50. <a href=\"https://doi.org/10.1007/s00340-015-6311-x\">https://doi.org/10.1007/s00340-015-6311-x</a>","ieee":"J. Alberti, H. Linnenbank, S. Linden, Y. Grynko, and J. Förstner, “The role of electromagnetic interactions in second harmonic generation from plasmonic metamaterials,” <i>Applied Physics B</i>, vol. 122, no. 2, pp. 45–50, 2016."},"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}]},{"date_updated":"2022-01-06T06:58:42Z","title":"Searchable Encryption","year":"2016","status":"public","author":[{"full_name":"Weis, Eduard","last_name":"Weis","first_name":"Eduard"}],"user_id":"25078","_id":"2898","supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"mla":"Weis, Eduard. <i>Searchable Encryption</i>. 2016.","ama":"Weis E. <i>Searchable Encryption</i>.; 2016.","bibtex":"@book{Weis_2016, title={Searchable Encryption}, author={Weis, Eduard}, year={2016} }","apa":"Weis, E. (2016). <i>Searchable Encryption</i>.","ieee":"E. Weis, <i>Searchable Encryption</i>. 2016.","short":"E. Weis, Searchable Encryption, 2016.","chicago":"Weis, Eduard. <i>Searchable Encryption</i>, 2016."},"type":"mastersthesis","department":[{"_id":"64"}],"date_created":"2018-05-25T09:43:39Z"},{"project":[{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"mla":"Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.” <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/fdtc.2015.17\">10.1109/fdtc.2015.17</a>.","bibtex":"@inproceedings{Blömer_Günther_2016, title={Singular Curve Point Decompression Attack}, DOI={<a href=\"https://doi.org/10.1109/fdtc.2015.17\">10.1109/fdtc.2015.17</a>}, booktitle={2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)}, publisher={IEEE}, author={Blömer, Johannes and Günther, Peter}, year={2016} }","ama":"Blömer J, Günther P. Singular Curve Point Decompression Attack. In: <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/fdtc.2015.17\">10.1109/fdtc.2015.17</a>","ieee":"J. Blömer and P. Günther, “Singular Curve Point Decompression Attack,” in <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>, 2016.","apa":"Blömer, J., &#38; Günther, P. (2016). Singular Curve Point Decompression Attack. In <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>. IEEE. <a href=\"https://doi.org/10.1109/fdtc.2015.17\">https://doi.org/10.1109/fdtc.2015.17</a>","short":"J. Blömer, P. Günther, in: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016.","chicago":"Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.” In <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/fdtc.2015.17\">https://doi.org/10.1109/fdtc.2015.17</a>."},"publication":"2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)","department":[{"_id":"64"}],"type":"conference","date_created":"2018-05-29T11:25:43Z","date_updated":"2022-01-06T06:58:48Z","publication_status":"published","publication_identifier":{"isbn":["9781467375795"]},"author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"}],"status":"public","year":"2016","title":"Singular Curve Point Decompression Attack","doi":"10.1109/fdtc.2015.17","user_id":"25078","_id":"2947","publisher":"IEEE"},{"project":[{"_id":"43","name":"Securing the Financial Cloud"}],"publication":"Mathematical Aspects of Computer and Information Sciences","citation":{"ama":"Günther P, Krummel V. Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures. In: <i>Mathematical Aspects of Computer and Information Sciences</i>. Cham: Springer International Publishing; 2016:151-165. doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">10.1007/978-3-319-32859-1_13</a>","bibtex":"@inbook{Günther_Krummel_2016, place={Cham}, title={Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">10.1007/978-3-319-32859-1_13</a>}, booktitle={Mathematical Aspects of Computer and Information Sciences}, publisher={Springer International Publishing}, author={Günther, Peter and Krummel, Volker}, year={2016}, pages={151–165} }","mla":"Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures.” <i>Mathematical Aspects of Computer and Information Sciences</i>, Springer International Publishing, 2016, pp. 151–65, doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">10.1007/978-3-319-32859-1_13</a>.","short":"P. Günther, V. Krummel, in: Mathematical Aspects of Computer and Information Sciences, Springer International Publishing, Cham, 2016, pp. 151–165.","chicago":"Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures.” In <i>Mathematical Aspects of Computer and Information Sciences</i>, 151–65. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">https://doi.org/10.1007/978-3-319-32859-1_13</a>.","apa":"Günther, P., &#38; Krummel, V. (2016). Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures. In <i>Mathematical Aspects of Computer and Information Sciences</i> (pp. 151–165). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">https://doi.org/10.1007/978-3-319-32859-1_13</a>","ieee":"P. Günther and V. Krummel, “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures,” in <i>Mathematical Aspects of Computer and Information Sciences</i>, Cham: Springer International Publishing, 2016, pp. 151–165."},"type":"book_chapter","department":[{"_id":"64"}],"place":"Cham","date_created":"2018-05-29T11:26:56Z","date_updated":"2022-01-06T06:58:48Z","publication_status":"published","year":"2016","title":"Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures","status":"public","publication_identifier":{"isbn":["9783319328584","9783319328591"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"full_name":"Krummel, Volker","last_name":"Krummel","first_name":"Volker"}],"doi":"10.1007/978-3-319-32859-1_13","user_id":"25078","page":"151-165","publisher":"Springer International Publishing","_id":"2948"},{"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>","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>.","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>.","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>","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} }"},"publication":"Algorithm Engineering","place":"Cham","date_created":"2018-06-04T12:22:40Z","department":[{"_id":"64"}],"type":"book_chapter","publication_identifier":{"isbn":["9783319494869","9783319494876"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"full_name":"Lammersen, Christiane","first_name":"Christiane","last_name":"Lammersen"},{"full_name":"Schmidt, Melanie","first_name":"Melanie","last_name":"Schmidt"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"year":"2016","status":"public","title":"Theoretical Analysis of the k-Means Algorithm – A Survey","date_updated":"2022-01-06T06:58:49Z","publication_status":"published","_id":"2968","publisher":"Springer International Publishing","page":"81-116","doi":"10.1007/978-3-319-49487-6_3","user_id":"25078"},{"citation":{"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).","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","ama":"Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 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."},"date_created":"2018-06-04T12:26:51Z","type":"preprint","department":[{"_id":"64"}],"oa":"1","year":"2016","title":"Hard-Clustering with Gaussian Mixture Models","status":"public","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"id":"13291","last_name":"Brauer","first_name":"Sascha","full_name":"Brauer, Sascha"},{"full_name":"Bujna, Kathrin","first_name":"Kathrin","last_name":"Bujna"}],"date_updated":"2022-01-06T06:58:49Z","main_file_link":[{"url":"https://arxiv.org/abs/1603.06478","open_access":"1"}],"_id":"2969","publisher":"Computing Research Repository","user_id":"25078"},{"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.","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>","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>.","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} }","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>"},"publication":"Advances in Knowledge Discovery and Data Mining","date_created":"2018-06-04T12:27:21Z","place":"Cham","department":[{"_id":"64"}],"type":"book_chapter","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Bujna, Kathrin","last_name":"Bujna","first_name":"Kathrin"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"status":"public","title":"Adaptive Seeding for Gaussian Mixture Models","year":"2016","publication_status":"published","date_updated":"2022-01-06T06:58:49Z","publisher":"Springer International Publishing","_id":"2970","page":"296-308","user_id":"25078","doi":"10.1007/978-3-319-31750-2_24"},{"citation":{"apa":"Blömer, J., &#38; Günther, P. (2016). <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.","ieee":"J. Blömer and P. Günther, <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","short":"J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, 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.","mla":"Blömer, Johannes, and Peter Günther. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","ama":"Blömer J, Günther P. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. 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} }"},"date_created":"2018-06-05T07:21:25Z","department":[{"_id":"64"}],"type":"report","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"}],"status":"public","year":"2016","title":"Effizienz und Sicherheit paarungsbasierter Kryptographie","date_updated":"2022-01-06T06:58:49Z","publication_status":"published","_id":"2971","publisher":"Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops","user_id":"25078"},{"doi":"10.1007/s10623-015-0062-x","user_id":"38235","page":"29--61","_id":"3112","date_updated":"2022-01-06T06:58:56Z","year":"2016","status":"public","title":"Tightly secure signatures and public-key encryption","author":[{"last_name":"Hofheinz","first_name":"Dennis","full_name":"Hofheinz, Dennis"},{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"}],"type":"journal_article","department":[{"_id":"558"}],"date_created":"2018-06-07T09:12:15Z","extern":"1","publication":"Des. Codes Cryptography","issue":"1","citation":{"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>.","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} }","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>","ieee":"D. Hofheinz and T. Jager, “Tightly secure signatures and public-key encryption,” <i>Des. Codes Cryptography</i>, no. 1, pp. 29--61, 2016.","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>","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>.","short":"D. Hofheinz, T. Jager, Des. Codes Cryptography (2016) 29--61."}},{"page":"304--318","_id":"3113","doi":"10.1049/iet-ifs.2015.0507","user_id":"38235","title":"Selective opening security of practical public-key encryption schemes","status":"public","year":"2016","author":[{"full_name":"Heuer, Felix","last_name":"Heuer","first_name":"Felix"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Schäge, Sven","first_name":"Sven","last_name":"Schäge"},{"full_name":"Kiltz, Eike","first_name":"Eike","last_name":"Kiltz"}],"date_updated":"2022-01-06T06:58:56Z","date_created":"2018-06-07T09:12:50Z","type":"journal_article","department":[{"_id":"558"}],"issue":"6","publication":"IET Information Security","citation":{"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>.","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>","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} }","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>","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.","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>.","short":"F. Heuer, T. Jager, S. Schäge, E. Kiltz, IET Information Security (2016) 304--318."},"extern":"1"},{"page":"62--82","_id":"3114","user_id":"38235","title":"Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way","year":"2016","status":"public","author":[{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"full_name":"Rupp, Andy","last_name":"Rupp","first_name":"Andy"}],"date_updated":"2022-01-06T06:58:56Z","date_created":"2018-06-07T09:13:15Z","type":"journal_article","department":[{"_id":"558"}],"issue":"3","publication":"PoPETs","citation":{"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.","apa":"Jager, T., &#38; Rupp, A. (2016). Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>, (3), 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.","short":"T. Jager, A. Rupp, PoPETs (2016) 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.","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} }","ama":"Jager T, Rupp A. Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>. 2016;(3):62--82."},"extern":"1"},{"doi":"10.1007/978-3-662-53890-6_24","user_id":"38235","page":"715--744","_id":"3115","date_updated":"2022-01-06T06:58:57Z","year":"2016","title":"How to Generate and Use Universal Samplers","status":"public","author":[{"full_name":"Hofheinz, Dennis","last_name":"Hofheinz","first_name":"Dennis"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"first_name":"Dakshita","last_name":"Khurana","full_name":"Khurana, Dakshita"},{"full_name":"Sahai, Amit","last_name":"Sahai","first_name":"Amit"},{"last_name":"Waters","first_name":"Brent","full_name":"Waters, Brent"},{"full_name":"Zhandry, Mark","first_name":"Mark","last_name":"Zhandry"}],"type":"conference","department":[{"_id":"558"}],"date_created":"2018-06-07T09:13:48Z","extern":"1","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","citation":{"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} }","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>","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>.","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.","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>.","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.","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>"}},{"author":[{"last_name":"Horst","first_name":"Matthias","full_name":"Horst, Matthias"},{"last_name":"Grothe","first_name":"Martin","full_name":"Grothe, Martin"},{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"first_name":"Jörg","last_name":"Schwenk","full_name":"Schwenk, Jörg"}],"status":"public","title":"Breaking PPTP VPNs via RADIUS Encryption","year":"2016","date_updated":"2022-01-06T06:58:57Z","_id":"3116","page":"159--175","user_id":"38235","doi":"10.1007/978-3-319-48965-0_10","citation":{"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} }","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>.","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.","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>","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>","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>."},"publication":"Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings","extern":"1","date_created":"2018-06-07T09:14:34Z","department":[{"_id":"558"}],"type":"conference"},{"date_updated":"2022-01-06T06:58:57Z","author":[{"full_name":"Bader, Christoph","last_name":"Bader","first_name":"Christoph"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Li, Yong","first_name":"Yong","last_name":"Li"},{"last_name":"Schäge","first_name":"Sven","full_name":"Schäge, Sven"}],"year":"2016","title":"On the Impossibility of Tight Cryptographic Reductions","status":"public","doi":"10.1007/978-3-662-49896-5_10","user_id":"38235","_id":"3117","page":"273--304","extern":"1","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.","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>","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>.","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>.","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} }","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>"},"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","department":[{"_id":"558"}],"type":"conference","date_created":"2018-06-07T09:15:15Z"},{"date_created":"2018-06-07T09:15:51Z","type":"conference","department":[{"_id":"558"}],"publication":"Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II","citation":{"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>.","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.","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>","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.","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>","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>."},"extern":"1","page":"146--168","_id":"3118","doi":"10.1007/978-3-662-53644-5_6","user_id":"38235","year":"2016","status":"public","title":"Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts","author":[{"last_name":"Hofheinz","first_name":"Dennis","full_name":"Hofheinz, Dennis"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"},{"last_name":"Rupp","first_name":"Andy","full_name":"Rupp, Andy"}],"date_updated":"2022-01-06T06:58:57Z"},{"department":[{"_id":"558"}],"type":"conference","date_created":"2018-06-07T09:16:30Z","extern":"1","citation":{"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.","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>.","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>","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} }","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>.","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>"},"publication":"Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I","user_id":"38235","doi":"10.1007/978-3-662-49096-9_14","_id":"3119","page":"336--362","date_updated":"2022-01-06T06:58:57Z","author":[{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"}],"title":"Verifiable Random Functions from Standard Assumptions","year":"2016","status":"public"},{"status":"public","has_accepted_license":"1","_id":"3157","page":"189--204","editor":[{"first_name":"Maurice","last_name":"H. ter Beek","full_name":"H. ter Beek, Maurice"},{"first_name":"Stefania","last_name":"Gnesi","full_name":"Gnesi, Stefania"},{"first_name":"Alexander","last_name":"Knapp","full_name":"Knapp, Alexander"}],"user_id":"477","ddc":["000"],"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} }","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>","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.","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>.","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.","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>"},"file_date_updated":"2018-11-02T14:17:13Z","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"author":[{"first_name":"Steffen","last_name":"Beringer","full_name":"Beringer, Steffen"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"title":"Verification of AUTOSAR Software Architectures with Timed Automata","year":"2016","date_updated":"2022-01-06T06:59:01Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"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","date_created":"2018-06-13T07:39:35Z","file":[{"file_id":"5267","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:17:13Z","file_name":"VerificationOfAUTOSARSoftwareA.pdf","file_size":2640695,"access_level":"closed","date_created":"2018-11-02T14:17:13Z","creator":"ups"}],"department":[{"_id":"77"}],"type":"conference"},{"page":"3--24","_id":"3158","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-46750-4_1","user_id":"29719","editor":[{"first_name":"Augusto","last_name":"Sampaio","full_name":"Sampaio, Augusto"},{"first_name":"Farn","last_name":"Wang","full_name":"Wang, Farn"}],"year":"2016","title":"Verification of Concurrent Programs on Weak Memory Models","status":"public","author":[{"full_name":"Travkin, Oleg","last_name":"Travkin","first_name":"Oleg"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:41:07Z","type":"conference","department":[{"_id":"77"}],"publication":"Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings","citation":{"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>","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.","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>.","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>","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."}},{"date_created":"2018-06-13T07:42:34Z","department":[{"_id":"77"}],"type":"conference","citation":{"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>.","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.","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>","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.","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>","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} }","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>."},"publication":"Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings","series_title":"Lecture Notes in Computer Science","_id":"3159","page":"193--209","editor":[{"last_name":"Huisman","first_name":"Marieke","full_name":"Huisman, Marieke"}],"user_id":"29719","doi":"10.1007/978-3-319-33693-0_13","author":[{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"last_name":"Travkin","first_name":"Oleg","full_name":"Travkin, Oleg"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"year":"2016","title":"Towards a Thread-Local Proof Technique for Starvation Freedom","status":"public","date_updated":"2022-01-06T06:59:01Z"},{"series_title":"LIPIcs","_id":"3160","page":"35:1--35:17","editor":[{"first_name":"Panagiota","last_name":"Fatourou","full_name":"Fatourou, Panagiota"},{"full_name":"Jim{\\'{e}}nez, Ernesto","first_name":"Ernesto","last_name":"Jim{\\'{e}}nez"},{"first_name":"Fernando","last_name":"Pedone","full_name":"Pedone, Fernando"}],"user_id":"29719","doi":"10.4230/LIPIcs.OPODIS.2016.35","author":[{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"title":"Proving Opacity of a Pessimistic {STM}","year":"2016","status":"public","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:44:15Z","department":[{"_id":"77"}],"type":"conference","citation":{"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>.","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>","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} }","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>","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>.","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."},"publication":"20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}]}]