Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

On Choquet and Sugeno integrals as aggregation functions Marichal, Jean-Luc in Grabisch, Michel; Murofushi, Toshiaki; Sugeno, Michio (Eds.) Fuzzy Measures and Integrals - Theory and Applications (2000) This paper presents a synthesis on the essential mathematical properties of Choquet and Sugeno integrals viewed as aggregation functions. Some axiomatic characterizations are presented. Subfamilies of the ... [more ▼] This paper presents a synthesis on the essential mathematical properties of Choquet and Sugeno integrals viewed as aggregation functions. Some axiomatic characterizations are presented. Subfamilies of the class of those integrals are also investigated. [less ▲] Detailed reference viewed: 109 (4 UL)On clear choices with ordinal valued binray relations Bisdorff, Raymond ; in Henggeler Antunes, Carlos; Figueira, José; Clímaco, João (Eds.) Multiple Criteria Decision Aiding (2004, October) Good or bad choices based on crisp outranking relation correspond to dominant and absorbent kernels in corresponding digraph. In this paper we generalize both concepts to an ordinal valued outranking ... [more ▼] Good or bad choices based on crisp outranking relation correspond to dominant and absorbent kernels in corresponding digraph. In this paper we generalize both concepts to an ordinal valued outranking relation. An efficient algorithm for computing these choices is proposed. Furthermore, we show the formal correspondance between ordinal valued choices and kernels in ordinal valued digraphs. [less ▲] Detailed reference viewed: 39 (2 UL)On clustering in multiple criteria decision aid: Theory and applications Olteanu, Alexandru Doctoral thesis (2013) Detailed reference viewed: 85 (3 UL)On Clustering the Criteria in an Outranking Based Decision Aid Approach Bisdorff, Raymond in Communications in Computer and Information Science (2008), 14 Detailed reference viewed: 113 (2 UL)On combining state space reductions with global fairness assumptions ; ; Pang, Jun et al in Proc. 17th International Symposium on Formal Methods (2011) Detailed reference viewed: 117 (2 UL)On comonotonically modular functions ; Marichal, Jean-Luc in Mesiar, Radko; Pap, Endre; Klement, Erich Peter (Eds.) 34th Linz Seminar on Fuzzy Set Theory (LINZ 2013) - Non-Classical Measures and Integrals (2013) Detailed reference viewed: 40 (3 UL)On comparison meaningfulness of aggregation functions Marichal, Jean-Luc ; Mathonet, Pierre in Journal of Mathematical Psychology (2001), 45(2), 213-223 This paper will give a description of all continuous functions which are comparison meaningful in the sense of measurement theory. Detailed reference viewed: 159 (1 UL)On complex analytic 1|3-dimensional supermanifolds associated with CP^1 Vishnyakova, Elizaveta in Proceedings of the XXXII Workshop on Geometric Methods in Physics (2014) Detailed reference viewed: 48 (1 UL)On Composability and Security of Game-based Password-Authenticated Key Exchange Skrobot, Marjan Doctoral thesis (2017) The main purpose of Password-Authenticated Key Exchange (PAKE) is to allow secure authenticated communication over insecure networks between two or more parties who only share a low-entropy password. It ... [more ▼] The main purpose of Password-Authenticated Key Exchange (PAKE) is to allow secure authenticated communication over insecure networks between two or more parties who only share a low-entropy password. It is common practice that the secret key derived from a PAKE execution is used to authenticate and encrypt some data payload using symmetric key protocols. Unfortunately, most PAKEs of practical interest, including three protocols considered in this thesis, are studied using so-called game-based models, which -- unlike simulation models -- do not guarantee secure composition per se. However, Brzuska et al. (CCS 2011) have shown that a middle ground is possible in the case of authenticated key exchange that relies on Public-Key Infrastructure (PKI): the game-based models do provide secure composition guarantees when the class of higher-level applications is restricted to symmetric-key protocols. The question that we pose in this thesis is whether or not a similar result can be exhibited for PAKE. Our work answers this question positively. More specifically, we show that PAKE protocols secure according to the game-based Real-or-Random (RoR) definition of Abdalla et al. (PKC 2005) allow for automatic, secure composition with arbitrary, higher-level symmetric key protocols. Since there is evidence that most PAKEs secure in the Find-then-Guess (FtG) model of Bellare et al. (EUROCRYPT 2000) are in fact secure according to the RoR definition, we can conclude that nearly all provably secure PAKEs enjoy a certain degree of composition, one that at least covers the case of implementing secure channels. Although many different protocols that accomplish PAKE have been proposed over last two decades, only a few newcomers managed to find their way to real world applications - albeit lacking an intense and prolonged public scrutiny. As a step in the direction of providing one, this dissertation considers the security and efficiency of two relatively recently proposed PAKE protocols - Dragonfly and J-PAKE. In particular, we prove the security of a very close variant of Dragonfly employing the standard FtG model which incorporates forward secrecy. Thus, our work confirms that Dragonfly's main flows are sound. Furthermore, we contribute to the discussion by proposing and examining (in the RoR model of security) two variants of J-PAKE - which we call RO-J-PAKE and CRS-J-PAKE - that each makes the use of two less zero-knowledge proofs than the original protocol, at the cost of an additional security assumption. Our work reveals that CRS-J-PAKE has an edge in terms of efficiency over J-PAKE for both standard group choices: subgroups of finite fields and elliptic curves. The same is true for RO-J-PAKE, but only when instantiated with elliptic curves. [less ▲] Detailed reference viewed: 425 (49 UL)On Composability of Game-based Password Authenticated Key Exchange Skrobot, Marjan ; Lancrenon, Jean in Skrobot, Marjan; Lancrenon, Jean (Eds.) 2018 IEEE European Symposium on Security and Privacy (EuroS&P) (2018, April) It is standard practice that the secret key derived from an execution of a Password Authenticated Key Exchange (PAKE) protocol is used to authenticate and encrypt some data payload using a Symmetric Key ... [more ▼] It is standard practice that the secret key derived from an execution of a Password Authenticated Key Exchange (PAKE) protocol is used to authenticate and encrypt some data payload using a Symmetric Key Protocol (SKP). Unfortunately, most PAKEs of practical interest are studied using so-called game-based models, which – unlike simulation models – do not guarantee secure composition per se. However, Brzuska et al. (CCS 2011) have shown that middle ground is possible in the case of authenticated key exchange that relies on Public- Key Infrastructure (PKI): the game-based models do provide secure composition guarantees when the class of higher-level applications is restricted to SKPs. The question that we pose in this paper is whether or not a similar result can be exhibited for PAKE. Our work answers this question positively. More specifically, we show that PAKE protocols secure according to the game-based Real-or-Random (RoR) definition with the weak forward secrecy of Abdalla et al. (S&P 2015) allow for safe composition with arbitrary, higher-level SKPs. Since there is evidence that most PAKEs secure in the Find-then-Guess (FtG) model are in fact secure according to RoR definition, we can conclude that nearly all provably secure PAKEs enjoy a certain degree of composition, one that at least covers the case of implementing secure channels. [less ▲] Detailed reference viewed: 79 (16 UL)On compositions of clones of Boolean functions Couceiro, Miguel ; ; Lehtonen, Erkko in Simos, T.; Maroulis, G. (Eds.) International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004) (2004) We present some compositions of clones of Boolean functions that imply factorizations of ?, the clone of all Boolean functions, into minimal clones. These can be interpreted as representation theorems ... [more ▼] We present some compositions of clones of Boolean functions that imply factorizations of ?, the clone of all Boolean functions, into minimal clones. These can be interpreted as representation theorems, providing representations of Boolean functions analogous to the disjunctive normal form, the conjunctive normal form, and the Zhegalkin polynomial representations. [less ▲] Detailed reference viewed: 104 (0 UL)On computing kernels on fuzzy simple graphs by combinatorial enumeration using a CPL(FD) system Bisdorff, Raymond Scientific Conference (1996, September 09) This paper reports our communication done at the 8th Benelux Workshop on Logic Programming in Louvain-la-Neuve, 9 September 1996. We present a constraint formulation in finite domains of the kernel ... [more ▼] This paper reports our communication done at the 8th Benelux Workshop on Logic Programming in Louvain-la-Neuve, 9 September 1996. We present a constraint formulation in finite domains of the kernel construction on simple digraphs and give some comments on implementation in CHIP. Application to fuzzy choice procedures will illustrate the theoretical developments. [less ▲] Detailed reference viewed: 53 (2 UL)On confident outrankings with multiple criteria of uncertain significance Bisdorff, Raymond Scientific Conference (2014, November 11) Detailed reference viewed: 57 (4 UL)On conjectures of Sato-Tate and Bruinier-Kohnen Arias De Reyna Dominguez, Sara ; ; Wiese, Gabor in The Ramanujan Journal (2015), 36(3), 455-481 This article covers three topics. (1) It establishes links between the density of certain subsets of the set of primes and related subsets of the set of natural numbers. (2) It extends previous results on ... [more ▼] This article covers three topics. (1) It establishes links between the density of certain subsets of the set of primes and related subsets of the set of natural numbers. (2) It extends previous results on a conjecture of Bruinier and Kohnen in three ways: the CM-case is included; under the assumption of the same error term as in previous work one obtains the result in terms of natural density instead of Dedekind-Dirichlet density; the latter type of density can already be achieved by an error term like in the prime number theorem. (3) It also provides a complete proof of Sato-Tate equidistribution for CM modular forms with an error term similar to that in the prime number theorem. [less ▲] Detailed reference viewed: 204 (15 UL)On conservative and associative operations on finite chains Devillet, Jimmy ; ; Marichal, Jean-Luc Scientific Conference (2017, June 16) See attached file Detailed reference viewed: 103 (25 UL)On continuity of measurable group representations and homomorphisms Kuznetsova, Julia in Studia Mathematica (2012), 210(3), 197-208 Let G be a locally compact group, and let U be its unitary representation on a Hilbert space H. Endow the space L(H) of bounded linear operators on H with the weak operator topology. We prove that if U is ... [more ▼] Let G be a locally compact group, and let U be its unitary representation on a Hilbert space H. Endow the space L(H) of bounded linear operators on H with the weak operator topology. We prove that if U is a measurable map from G to L(H) then it is continuous. This result was known before for separable H. We also prove that the following statement is consistent with ZFC: every measurable homomorphism from a locally compact group into any topological group is continuous. [less ▲] Detailed reference viewed: 94 (0 UL)On Crystallization and Percolation Schilling, Tanja Scientific Conference (2015, August) Detailed reference viewed: 62 (0 UL)On Dantzig and Lasso estimators of the drift in a high dimensional Ornstein-Uhlenbeck model Ciolek, Gabriela ; Marushkevych, Dmytro ; Podolskij, Mark in Electronic Journal of Statistics (2020), 14(2), 4395-4420 Detailed reference viewed: 120 (18 UL)On Deception-Based Protection Against Cryptographic Ransomware Genç, Ziya Alper ; Lenzini, Gabriele ; in Proceedings of the 16th Conference on Detection of Intrusions and Malware & Vulnerability Assessment (2019) In order to detect malicious file system activity, some commercial and academic anti-ransomware solutions implement deception-based techniques, specifically by placing decoy files among user files. While ... [more ▼] In order to detect malicious file system activity, some commercial and academic anti-ransomware solutions implement deception-based techniques, specifically by placing decoy files among user files. While this approach raises the bar against current ransomware, as any access to a decoy file is a sign of malicious activity, the robustness of decoy strategies has not been formally analyzed and fully tested. In this paper, we analyze existing decoy strategies and discuss how they are effective in countering current ransomware by defining a set of metrics to measure their robustness. To demonstrate how ransomware can identify existing deception-based detection strategies, we have implemented a proof-of-concept anti-decoy ransomware that successfully bypasses decoys by using a decision engine with few rules. Finally, we discuss existing issues in decoy-based strategies and propose practical solutions to mitigate them. [less ▲] Detailed reference viewed: 221 (16 UL)On definition and inference of nonlinear Boolean dynamic networks Yue, Zuogong ; Thunberg, Johan ; et al in On definition and inference of nonlinear Boolean dynamic networks (2017, December) Network reconstruction has become particularly important in systems biology, and is now expected to deliver information on causality. Systems in nature are inherently nonlinear. However, for nonlinear ... [more ▼] Network reconstruction has become particularly important in systems biology, and is now expected to deliver information on causality. Systems in nature are inherently nonlinear. However, for nonlinear dynamical systems with hidden states, how to give a useful definition of dynamic networks is still an open question. This paper presents a useful definition of Boolean dynamic networks for a large class of nonlinear systems. Moreover, a robust inference method is provided. The well-known Millar-10 model in systems biology is used as a numerical example, which provides the ground truth of causal networks for key mRNAs involved in eukaryotic circadian clocks. In addition, as second contribution of this paper, we suggest definitions of linear network identifiability, which helps to unify the available work on network identifiability. [less ▲] Detailed reference viewed: 181 (6 UL) |
||