• Attacks on Integer-RLWE 

      Budroni, Alessandro; Chetioui, Benjamin; Franch, Ermes (Journal article; Peer reviewed, 2020)
      In 2019, Gu Chunsheng introduced Integer-RLWE, a variant of RLWE devoid of some of its efficiency flaws. Most notably, he proposes a setting where n can be an arbitrary positive integer, contrarily to the typical construction ...
    • A Bit-Vector Differential Model for the Modular Addition by a Constant 

      Azimi, Seyyed Arash; Ranea, Adrián; Salmasizadeh, Mahmoud; Mohajeri, Javad; Aref, Mohammad Reza; Rijmen, Vincent Stefaan (Journal article; Peer reviewed, 2020)
      ARX algorithms are a class of symmetric-key algorithms constructed by Addition, Rotation, and XOR, which achieve the best software performances in low-end microcontrollers. To evaluate the resistance of an ARX cipher against ...
    • Computing Consensus: A Logic for Reasoning About Deliberative Processes Based on Argumentation 

      Dyrkolbotn, Sjur Kristoffer; Pedersen, Truls Andre (Journal article; Peer reviewed, 2019)
      Argumentation theory can encode an agent’s assessment of the state of an exchange of points of view. We present a conservative model of multiple agents potentially disagreeing on the views presented during a process of ...
    • Generalization of a class of APN binomials to Gold-like functions 

      Davidova, Diana; Kaleyski, Nikolay Stoyanov (Journal article; Peer reviewed, 2021)
      In 2008 Budaghyan, Carlet and Leander generalized a known instance of an APN function over the finite field F212 and constructed two new infinite families of APN binomials over the finite field F2n , one for n divisible ...
    • Geometric Planar Networks on Bichromatic Points 

      Bandyapadhyay, Sayan; Banik, Aritra; Bhore, Sujoy; Nollenburg, Martin (Journal article; Peer reviewed, 2020)
      We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree, and Minimum perfect matching on geometric graphs induced by bichromatic ( Open image in new window and Open image in new ...
    • Group Belief 

      Ågotnes, Thomas; Wang, Yi N. (Journal article; Peer reviewed, 2020)
      While logical formalizations of group notions of knowledge such as common and distributed knowledge have received considerable attention in the literature, most approaches being based on modal logic, group notions of belief ...
    • Improving Judgment Reliability in Social Networks via Jury Theorems 

      Galeazzi, Paolo; Rendsvig, Rasmus K; Slavkovik, Marija (Journal article; Peer reviewed, 2019)
      Opinion aggregators—such as ‘like’ or ‘retweet’ counters—are ubiquitous on social media platforms and often treated as implicit quality evaluations of the entry liked or retweeted, with higher counts indicating higher ...
    • Making the BKW Algorithm Practical for LWE 

      Budroni, Alessandro; Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Stankovski Wagner, Paul (Journal article; Peer reviewed, 2020)
      The Learning with Errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum-Kalai-Wasserman (BKW) algorithm. This paper ...
    • On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters 

      Høgemo, Svein; Bergougnoux, Benjamin; Brandes, Ulrik; Paul, Christophe; Telle, Jan Arne (Journal article; Peer reviewed, 2021)
      The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist ...
    • On the Effect of DCE MRI Slice Thickness and Noise on Estimated Pharmacokinetic Biomarkers – A Simulation Study 

      Jurek, Jakub; Reisæter, Lars Anders Rokne; Kocinski, Marek; Materka, Andrzej (Journal article; Peer reviewed, 2020)
      Simulation of a dynamic contrast-enhanced magnetic resonance imaging (DCE MRI) multiple sclerosis brain dataset is described. The simulated images in the implemented version have 1×1×1mm3 voxel resolution and arbitrary ...
    • Overview of the ImageCLEF 2020: Multimedia Retrieval in Medical, Lifelogging, Nature, and Internet Applications 

      Ionescu, Bogdan; Müller, Henning; Péteri, Renaud; Abacha, Asma Ben; Datla, Vivek; Hasan, Sadid A.; Demner-Fushman, Dina; Kozlovski, Serge; Liauchuk, Vitali; Cid, Yashin Dicente; Kovalev, Vassili; Pelka, Obioma; Friedrich, Christoph M.; García Seco de Herrera, Alba; Ninh, Van-Tu; Le, Tu-Khiem; Zhou, Liting; Piras, Luca; Riegler, Michael; Halvorsen, Pål; Tran, Minh-Triet; Lux, Mathias; Gurrin, Cathal; Dang Nguyen, Duc Tien; Chamberlain, Jon; Clark, Adrian; Campello, Antonio; Fichou, Dimitri; Berari, Raul; Brie, Paul; Dogariu, Mihai; Ştefan, Liviu Daniel; Constantin, Mihai Gabriel (Journal article; Peer reviewed, 2020)
      This paper presents an overview of the ImageCLEF 2020 lab that was organized as part of the Conference and Labs of the Evaluation Forum - CLEF Labs 2020. ImageCLEF is an ongoing evaluation initiative (first run in 2003) ...
    • The Perfect Matching Cut Problem Revisited 

      Telle, Jan Arne; Le, Van Bang (Journal article; Peer reviewed, 2021)
      In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP -complete. We ...
    • Quantitative Externalization of Visual Data Analysis Results Using Local Regression Models 

      Matkovic, Kresimir; Abraham, Hrvoje; Jelovic, Mario; Hauser, Helwig (Journal article; Peer reviewed, 2017)
      Both interactive visualization and computational analysis methods are useful for data studies and an integration of both approaches is promising to successfully combine the benefits of both methodologies. In interactive ...
    • Three problems on well-partitioned chordal graphs 

      Ahn, Jungho; Jaffke, Lars; Kwon, O-Joung; Lima, Paloma Thome de (Journal article; Peer reviewed, 2021)
      In this work, we solve three problems on well-partitioned chordal graphs. First, we show that every connected (resp., 2-connected) well-partitioned chordal graph has a vertex that intersects all longest paths (resp., longest ...