[{"date_published":"2019-01-01T00:00:00Z","page":"75-111","article_type":"original","citation":{"ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.","apa":"Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131","ama":"Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131","chicago":"Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131.","mla":"Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111."},"publication":"Journal of Computer Security","article_processing_charge":"No","day":"1","scopus_import":"1","oa_version":"Preprint","intvolume":" 27","title":"Per-session security: Password-based cryptography revisited","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5887","issue":"1","abstract":[{"lang":"eng","text":"Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.3233/JCS-181131","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/166"}],"oa":1,"publication_identifier":{"issn":["0926227X"]},"month":"01","volume":27,"date_updated":"2021-01-12T08:05:08Z","date_created":"2019-01-27T22:59:10Z","author":[{"full_name":"Demay, Gregory","last_name":"Demay","first_name":"Gregory"},{"full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi"},{"last_name":"Maurer","first_name":"Ueli","full_name":"Maurer, Ueli"},{"full_name":"Tackmann, Bjorn","first_name":"Bjorn","last_name":"Tackmann"}],"department":[{"_id":"KrPi"}],"publisher":"IOS Press","publication_status":"published","year":"2019","ec_funded":1},{"article_processing_charge":"No","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["978-3-6624-6446-5","978-3-6624-6447-2"]},"month":"02","day":"23","page":"27-37","quality_controlled":"1","citation":{"chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” In 21st IAPR International Conference on Discrete Geometry for Computer Imagery, 11414:27–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. https://doi.org/10.1007/978-3-030-14085-4_3.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, in:, 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Springer Berlin Heidelberg, Berlin, Heidelberg, 2019, pp. 27–37.","mla":"Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” 21st IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 11414, Springer Berlin Heidelberg, 2019, pp. 27–37, doi:10.1007/978-3-030-14085-4_3.","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Rhombic dodecahedron grid—coordinate system and 3D digital object definitions,” in 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France, 2019, vol. 11414, pp. 27–37.","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2019). Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In 21st IAPR International Conference on Discrete Geometry for Computer Imagery (Vol. 11414, pp. 27–37). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-030-14085-4_3","ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2019. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. 21st IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 11414, 27–37.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In: 21st IAPR International Conference on Discrete Geometry for Computer Imagery. Vol 11414. Berlin, Heidelberg: Springer Berlin Heidelberg; 2019:27-37. doi:10.1007/978-3-030-14085-4_3"},"publication":"21st IAPR International Conference on Discrete Geometry for Computer Imagery","language":[{"iso":"eng"}],"date_published":"2019-02-23T00:00:00Z","doi":"10.1007/978-3-030-14085-4_3","conference":{"name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","end_date":"2019-03-28","start_date":"2019-03-26","location":"Marne-la-Vallée, France"},"alternative_title":["LNCS"],"place":"Berlin, Heidelberg","type":"conference","extern":"1","abstract":[{"text":"We propose a new non-orthogonal basis to express the 3D Euclidean space in terms of a regular grid. Every grid point, each represented by integer 3-coordinates, corresponds to rhombic dodecahedron centroid. Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. A characterization of a 3D digital sphere with relevant topological features is proposed as well with the help of a 48 symmetry that comes with the new coordinate system.","lang":"eng"}],"publisher":"Springer Berlin Heidelberg","intvolume":" 11414","status":"public","publication_status":"published","title":"Rhombic dodecahedron grid—coordinate system and 3D digital object definitions","_id":"6163","year":"2019","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":11414,"oa_version":"None","date_created":"2019-03-21T12:12:19Z","date_updated":"2022-01-27T14:25:17Z","author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"last_name":"Largeteau-Skapin","first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle"},{"full_name":"Zrour, Rita","last_name":"Zrour","first_name":"Rita"},{"first_name":"Eric","last_name":"Andres","full_name":"Andres, Eric"}]},{"author":[{"first_name":"Ramsay","last_name":"Dyer","full_name":"Dyer, Ramsay"},{"full_name":"Vegter, Gert","first_name":"Gert","last_name":"Vegter"},{"full_name":"Wintraecken, Mathijs","first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220"}],"date_updated":"2021-01-12T08:07:50Z","date_created":"2019-06-03T09:35:33Z","volume":10,"year":"2019","publication_status":"published","publisher":"Carleton University","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:32Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.20382/jocg.v10i1a9","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"month":"07","publication_identifier":{"issn":["1920-180X"]},"file":[{"content_type":"application/pdf","file_size":2170882,"creator":"mwintrae","file_name":"mainJournalFinal.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:32Z","date_created":"2019-06-03T09:30:01Z","checksum":"57b4df2f16a74eb499734ec8ee240178","relation":"main_file","file_id":"6516"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6515","ddc":["510"],"status":"public","title":"Simplices modelled on spaces of constant curvature","intvolume":" 10","abstract":[{"text":"We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature.","lang":"eng"}],"issue":"1","type":"journal_article","date_published":"2019-07-01T00:00:00Z","publication":"Journal of Computational Geometry ","citation":{"short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256.","mla":"Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry , vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:10.20382/jocg.v10i1a9.","chicago":"Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry . Carleton University, 2019. https://doi.org/10.20382/jocg.v10i1a9.","ama":"Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9","ieee":"R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” Journal of Computational Geometry , vol. 10, no. 1. Carleton University, pp. 223–256, 2019.","apa":"Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256."},"page":"223–256","day":"01","has_accepted_license":"1","scopus_import":1},{"day":"10","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"date_published":"2019-01-10T00:00:00Z","publication":"10th Innovations in Theoretical Computer Science Conference","citation":{"chicago":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60.","mla":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ista":"Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.","apa":"Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","ama":"Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60"},"abstract":[{"text":"We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","file":[{"checksum":"f0ae1bb161431d9db3dea5ace082bfb5","date_created":"2019-06-06T14:22:04Z","date_updated":"2020-07-14T12:47:33Z","file_id":"6529","relation":"main_file","creator":"dernst","file_size":558770,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_LIPIcs_Pietrzak.pdf"}],"oa_version":"Published Version","title":"Simple verifiable delay functions","status":"public","ddc":["000"],"intvolume":" 124","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6528","month":"01","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2019-01-12","start_date":"2019-01-10","location":"San Diego, CA, United States","name":"ITCS 2019: Innovations in Theoretical Computer Science"},"doi":"10.4230/LIPICS.ITCS.2019.60","quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2018/627","open_access":"1"}],"file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"article_number":"60","date_created":"2019-06-06T14:12:36Z","date_updated":"2021-01-12T08:07:53Z","volume":124,"author":[{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"year":"2019"},{"month":"05","publication_identifier":{"isbn":["978-153866246-5"]},"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"ICC 2019 - Indian Control Conference","start_date":"2019-01-09","location":"Delhi, India","end_date":"2019-01-11"},"doi":"10.1109/INDIANCC.2019.8715598","article_number":"8715598","file_date_updated":"2020-10-21T13:13:49Z","publication_status":"published","publisher":"IEEE","department":[{"_id":"ToHe"}],"year":"2019","date_updated":"2021-01-12T08:08:01Z","date_created":"2019-06-17T06:57:33Z","author":[{"first_name":"Atreyee","last_name":"Kundu","full_name":"Kundu, Atreyee"},{"first_name":"Miriam","last_name":"Garcia Soto","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0003−2936−5719","full_name":"Garcia Soto, Miriam"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"scopus_import":"1","day":"16","article_processing_charge":"No","has_accepted_license":"1","publication":"5th Indian Control Conference Proceedings","citation":{"ama":"Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598","ista":"Kundu A, Garcia Soto M, Prabhakar P. 2019. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. 5th Indian Control Conference Proceedings. ICC 2019 - Indian Control Conference, 8715598.","apa":"Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598","ieee":"A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019.","mla":"Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” 5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598.","short":"A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019.","chicago":"Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598."},"date_published":"2019-05-16T00:00:00Z","type":"conference","abstract":[{"text":"In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example.","lang":"eng"}],"title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","ddc":["000"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6565","file":[{"file_size":396031,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2019_ICC_Kundu.pdf","checksum":"d622a91af1e427f6b1e0ba8e18a2b767","success":1,"date_created":"2020-10-21T13:13:49Z","date_updated":"2020-10-21T13:13:49Z","relation":"main_file","file_id":"8687"}],"oa_version":"Submitted Version"}]