[{"author":[{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","file_date_updated":"2020-07-14T12:47:34Z","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T08:08:16Z","citation":{"ista":"Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.","chicago":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279.","ieee":"G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279.","apa":"Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada.","ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.","mla":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79."},"ddc":["004"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","conference":{"name":"CCCG: Canadian Conference in Computational Geometry","start_date":"2019-08-08","location":"Edmonton, Canada","end_date":"2019-08-10"},"type":"conference","status":"public","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"_id":"6628","page":"275-279","ec_funded":1,"date_created":"2019-07-12T08:34:57Z","date_published":"2019-08-01T00:00:00Z","year":"2019","publication_status":"published","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"The 31st Canadian Conference in Computational Geometry","day":"01","file":[{"creator":"mwintrae","file_size":321176,"date_updated":"2020-07-14T12:47:34Z","file_name":"IntrinsicExtrinsicCCCG2019.pdf","date_created":"2019-07-12T08:32:46Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"ceabd152cfa55170d57763f9c6c60a53","file_id":"6629"}],"oa":1,"scopus_import":1,"quality_controlled":"1","month":"08","abstract":[{"text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space.","lang":"eng"}],"oa_version":"Submitted Version"},{"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_published":"2019-06-01T00:00:00Z","doi":"10.4230/LIPICS.SOCG.2019.31","date_created":"2019-07-17T10:36:09Z","page":"31:1-31:14","day":"01","publication":"35th International Symposium on Computational Geometry","has_accepted_license":"1","year":"2019","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"title":"Topological data analysis in information space","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ziga","last_name":"Virk","full_name":"Virk, Ziga"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"external_id":{"arxiv":["1903.08510"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.","mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14.","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31"},"month":"06","intvolume":" 129","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory\r\nneeded for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.","lang":"eng"}],"volume":129,"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"6666","checksum":"8ec8720730d4c789bf7b06540f1c29f4","file_size":1355179,"date_updated":"2020-07-14T12:47:35Z","creator":"dernst","file_name":"2019_LIPICS_Edelsbrunner.pdf","date_created":"2019-07-24T06:40:01Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959771047"]},"publication_status":"published","status":"public","type":"conference","conference":{"location":"Portland, OR, United States","end_date":"2019-06-21","start_date":"2019-06-18","name":"SoCG 2019: Symposium on Computational Geometry"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"6648","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:35Z","ddc":["510"],"date_updated":"2021-01-12T08:08:23Z"},{"author":[{"first_name":"Naoki","last_name":"Zenmyo","full_name":"Zenmyo, Naoki"},{"last_name":"Tokumaru","full_name":"Tokumaru, Hiroki","first_name":"Hiroki"},{"full_name":"Uchinomiya, Shohei","last_name":"Uchinomiya","first_name":"Shohei"},{"first_name":"Hirokazu","last_name":"Fuchida","full_name":"Fuchida, Hirokazu"},{"last_name":"Tabata","full_name":"Tabata, Shigekazu","first_name":"Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hamachi, Itaru","last_name":"Hamachi","first_name":"Itaru"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Akio","last_name":"Ojida","full_name":"Ojida, Akio"}],"article_processing_charge":"No","title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","citation":{"mla":"Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034.","ama":"Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034","apa":"Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034","ieee":"N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.","short":"N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000.","chicago":"Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034.","ista":"Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"page":"995-1000","date_published":"2019-05-15T00:00:00Z","doi":"10.1246/bcsj.20190034","date_created":"2019-07-21T21:59:16Z","has_accepted_license":"1","year":"2019","day":"15","publication":"Bulletin of the Chemical Society of Japan","publisher":"Bulletin of the Chemical Society of Japan","quality_controlled":"1","oa":1,"acknowledgement":"his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation.","file_date_updated":"2020-10-02T08:49:58Z","department":[{"_id":"RySh"}],"date_updated":"2021-01-12T08:08:26Z","ddc":["570"],"type":"journal_article","article_type":"original","status":"public","_id":"6659","issue":"5","volume":92,"ec_funded":1,"publication_identifier":{"issn":["00092673"]},"publication_status":"published","file":[{"file_size":2464903,"date_updated":"2020-10-02T08:49:58Z","creator":"dernst","file_name":"2019_BCSJ_Zenmyo.pdf","date_created":"2020-10-02T08:49:58Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8594","checksum":"186de511d6e0ca93f5d981e2443eb8cd"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"05","intvolume":" 92","abstract":[{"text":"Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research.","lang":"eng"}],"oa_version":"Published Version"},{"page":"77:1-77:12","date_created":"2019-07-29T12:23:29Z","doi":"10.4230/LIPICS.ICALP.2019.77","date_published":"2019-07-01T00:00:00Z","year":"2019","has_accepted_license":"1","publication":"46th International Colloquium on Automata, Languages and Programming","day":"01","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","external_id":{"arxiv":["1803.02289"]},"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"title":"Testing the complexity of a valued CSP language","citation":{"ista":"Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.","chicago":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77.","apa":"Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77","ama":"Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77","short":"V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.","ieee":"V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.","mla":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"volume":132,"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-109-2"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2019-07-31T07:01:45Z","file_name":"2019_LIPICS_Kolmogorov.pdf","date_updated":"2020-07-14T12:47:38Z","file_size":575475,"creator":"dernst","file_id":"6738","checksum":"f5ebee8eec6ae09e30365578ee63a492","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 132","month":"07","abstract":[{"lang":"eng","text":"A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. \r\nRecent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:38Z","department":[{"_id":"VlKo"}],"date_updated":"2021-01-12T08:08:40Z","ddc":["000"],"conference":{"name":"ICALP 2019: International Colloquim on Automata, Languages and Programming","location":"Patras, Greece","end_date":"2019-07-12","start_date":"2019-07-08"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","status":"public","_id":"6725"},{"year":"2019","publication":"Progress in Cryptology – AFRICACRYPT 2019","day":"29","page":"157-180","date_created":"2019-07-29T12:25:31Z","date_published":"2019-06-29T00:00:00Z","doi":"10.1007/978-3-030-23696-0_9","oa":1,"quality_controlled":"1","publisher":"Springer Nature","citation":{"ieee":"M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.","short":"M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.","apa":"Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9","ama":"Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9","mla":"Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9.","ista":"Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.","chicago":"Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","author":[{"first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","last_name":"Walter","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482"}],"title":"Sampling the integers with low relative error","editor":[{"last_name":"Buchmann","full_name":"Buchmann, J","first_name":"J"},{"first_name":"A","last_name":"Nitaj","full_name":"Nitaj, A"},{"full_name":"Rachidi, T","last_name":"Rachidi","first_name":"T"}],"project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-0302-3696-0"],"isbn":["978-3-0302-3695-3"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":11627,"abstract":[{"text":"Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://eprint.iacr.org/2019/068","open_access":"1"}],"scopus_import":"1","intvolume":" 11627","month":"06","place":"Cham","date_updated":"2023-02-23T12:50:15Z","department":[{"_id":"KrPi"}],"_id":"6726","series_title":"LNCS","conference":{"name":"AFRICACRYPT: International Conference on Cryptology in Africa","end_date":"2019-07-11","location":"Rabat, Morocco","start_date":"2019-07-09"},"type":"book_chapter","status":"public"}]