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

Privacy-Preserving Logistic Regression as a Cloud Service Based on Residue Number System ; ; et al in Voevodin, Vladimir; Sobolev, Sergey (Eds.) 6th Russian Supercomputing Days, Moscow 21-22 September 2020 (2020, December) Detailed reference viewed: 57 (0 UL)Evolutionary algorithms deceive humans and machines at image classification: An extended proof of concept on two scenarios Chitic, Ioana Raluca ; Leprevost, Franck ; in Journal of Information and Telecommunication (2020) The range of applications of Neural Networks encompasses image classification. However, Neural Networks are vulnerable to attacks, and may misclassify adversarial images, leading to potentially disastrous ... [more ▼] The range of applications of Neural Networks encompasses image classification. However, Neural Networks are vulnerable to attacks, and may misclassify adversarial images, leading to potentially disastrous consequences. Pursuing some of our previous work, we provide an extended proof of concept of a black-box, targeted, non-parametric attack using evolutionary algorithms to fool both Neural Networks and humans at the task of image classification. Our feasibility study is performed on VGG-16 trained on CIFAR-10. For any category cA of CIFAR-10, one chooses an image A classified by VGG-16 as belonging to cA. From there, two scenarios are addressed. In the first scenario, a target category ct≠cA is fixed a priori. We construct an evolutionary algorithm that evolves A to a modified image that VGG-16 classifies as belonging to ct. In the second scenario, we construct another evolutionary algorithm that evolves A to a modified image that VGG-16 is unable to classify. In both scenarios, the obtained adversarial images remain so close to the original one that a human would likely classify them as still belonging to cA. [less ▲] Detailed reference viewed: 171 (0 UL)Reducing overfitting and improving generalization in training convolutional neural network under limited sample sizes in image recognition Thanapol, Panissara ; ; Bouvry, Pascal et al in 5th International Conference on Information Technology, Bangsaen 21-22 October 2020 (2020) Detailed reference viewed: 41 (0 UL)How big is big? How fast is fast? A Hands-On Tutorial on Mathematics of Computation Leprevost, Franck Book published by Amazon (2020) Detailed reference viewed: 10 (0 UL)How Evolutionary Algorithms and Information Hiding deceive machines and humans for image recognition: A research program Bernard, Nicolas ; Leprévost, Franck in Theeramunkong, Thanaruk; Bouvry, Pascal; Srichaikul, Piyawut (Eds.) Proceedings of the OLA'2019 International Conference on Optimization and Learning (Bangkok, Thailand, Jan 29-31, 2019) (2019) Deep Neural Networks are used for a wide range of critical applications, notably for image recognition. The ability to deceive their recognition abilities is an active research domain, since successful ... [more ▼] Deep Neural Networks are used for a wide range of critical applications, notably for image recognition. The ability to deceive their recognition abilities is an active research domain, since successful deceptions may have disastrous consequences. Still, humans sometimes detect mistakes made by machines when they classify images. One can conceive a system able to solicit humans in case of doubts, namely when humans and machines may disagree. Using Information Hiding techniques, we describe a strategy to construct evolutionary algorithms able to fool both neural networks and humans for image recognition. Although this research is still exploratory, we already describe a concrete fitness function for a specific scenario. Additional scenarii and further research directions are provided. [less ▲] Detailed reference viewed: 42 (0 UL)A proof of concept to deceive humans and machines at image classification with evolutionary algorithms Chitic, Raluca Ioana ; ; Leprévost, Franck in Chitic, Iona Raluca; Bernard, Nicolas; Leprévost, Franck (Eds.) Proceedings of ACIIDS 2020 (2019) Detailed reference viewed: 41 (4 UL)Evolutionary Algorithms for Convolutional Neural Network Visualisation Bernard, Nicolas ; Leprévost, Franck in Meneses, Esteban; Castro, Harold; Barrios Hernández, Carlos Jaime (Eds.) et al High Performance Computing -- 5th Latin American Conference, CARLA 2018, Piedecuesta, Colombia (2018) Deep Learning is based on deep neural networks trained over huge sets of examples. It enabled computers to compete with ---~or even outperform~--- humans at many tasks, from playing Go to driving ... [more ▼] Deep Learning is based on deep neural networks trained over huge sets of examples. It enabled computers to compete with ---~or even outperform~--- humans at many tasks, from playing Go to driving vehicules. Still, it remains hard to understand how these networks actually operate. While an observer sees any individual local behaviour, he gets little insight about their global decision-making process. However, there is a class of neural networks widely used for image processing, convolutional networks, where each layer contains features working in parallel. By their structure, these features keep some spatial information across a network's layers. Visualisation of this spatial information at different locations in a network, notably on input data that maximise the activation of a given feature, can give insights on the way the model works. This paper investigates the use of Evolutionary Algorithms to evolve such input images that maximise feature activation. Compared with some pre-existing approaches, ours seems currently computationally heavier but with a wider applicability. [less ▲] Detailed reference viewed: 39 (1 UL)James Bond's Most Secret Weapon Leprévost, Franck in Proceedings of the 3rd International Conference on Applications in Information Technology (2018) This conference presents in a non-conventional way secret-key and public-key cryptology from its origins to the present days. Detailed reference viewed: 100 (4 UL)Elliptic Curves Discrete Logarithm Problem over a Finite Field Fp and p-adic Approximations Leprévost, Franck ; Bernard, Nicolas ; Bouvry, Pascal in Proceedings of the 3rd International Conference on Applications in Information Technology (ICAIT-2018) (2018) These notes summarize some computations conducted around the Elliptic Curves Discrete Logarithm Problem (ECDLP) over a finite field Fp. Detailed reference viewed: 83 (1 UL)The University of Luxembourg: A National Excellence Initiative Leprévost, Franck in Altbach, Phil; Reisberg, Liz; Salmi, Jamil (Eds.) et al Accelerated Universities: A ideas and Money Combine to Build Academic Excellence (2018) Detailed reference viewed: 48 (5 UL)Hardened Bloom Filters, with an Application to Unobservability Bernard, Nicolas ; Leprévost, Franck in Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica (2013), 12(4), 11-22 Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S. They do not store any data and only provide boolean answers regarding the membership ... [more ▼] Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S. They do not store any data and only provide boolean answers regarding the membership of a given element in the set, with some probability of false positive answers. Bloom filters are often used in caching system to check that some requested data actually exist before doing a costly lookup to retrieve them. However, security issues may arise for some other applications where an active attacker is able to inject data crafted to degrade the filters’ algorithmic properties, resulting for instance in a Denial of Service (DoS) situation. This leads us to the concept of hardened Bloom filters, combining classical Bloom filters with cryptographic hash functions and secret nonces. We show how this approach is successfully used in the TrueNyms unobservability system and protects it against replay attacks. [less ▲] Detailed reference viewed: 170 (20 UL)Security and Intelligent Information Systems ; Leprévost, Franck ; et al Book published by Springer (2012) Detailed reference viewed: 149 (5 UL)Beyond Tor: The TrueNyms Protocol Bernard, Nicolas ; Leprévost, Franck in Security and Intelligent Information Systems (2012) Detailed reference viewed: 1225 (34 UL)On the Computation of Class Polynomials with "Thetanullwerte" and Its Applications to the Unit Group Computation Leprévost, Franck ; ; in Experimental Mathematics (2011), 20(3), 271-281 Detailed reference viewed: 94 (0 UL)Jacobians of genus 2 curves with a rational point of order 11 Leprévost, Franck ; Bernard, Nicolas ; in Experimental Mathematics (2009), 18(1), 65-70 On the one hand, it is well-known that Jacobians of (hyper)elliptic curves defined over $\Q$ having a rational point of order $l$ can be used in many applications, for instance in the construction of ... [more ▼] On the one hand, it is well-known that Jacobians of (hyper)elliptic curves defined over $\Q$ having a rational point of order $l$ can be used in many applications, for instance in the construction of class groups of quadratic fields with a non-trivial $l$-rank. On the other hand, it is also well-known that $11$ is the least prime number which is not the order of a rational point of an elliptic curve defined over $\Q$. It is therefore interesting to look for curves of higher genus, whose Jacobians have a rational point of order $11$. This problem has already been addressed, and Flynn found such a family $\Fl_t$ of genus $2$ curves. Now, it turns out, that the Jacobian $J_0(23)$ of the modular genus $2$ curve $X_0(23)$ has the required property, but does not belong to $\Fl_t$. The study of $X_0(23)$ leads to a method to partially solving the considered problem. Our approach allows us to recover $X_0(23)$, and to construct another $18$ distinct explicit curves of genus $2$ defined over $\Q$ and whose Jacobians have a rational point of order $11$. Of these $19$ curves, $10$ do not have any rational Weierstrass point, and $9$ have a rational Weierstrass point. None of these curves are $\Qb$-isomorphic to each other, nor $\Qb$-isomorphic to an element of Flynn's family $\Fl_t$. Finally, the Jacobians of these new curves are absolutely simple. [less ▲] Detailed reference viewed: 160 (13 UL)Cryptographie à Clef Publique ; Leprévost, Franck ; et al in Ebrahimi, Touradj; Leprévost, Franck; Warusfel, Bertrand (Eds.) Cryptographie et sécurité des systèmes et réseaux, 2 (2007) Les briques de construction des systèmes sécurisés d'information font appel aux notions de cryptologie, qui recouvre la cryptographie (la construction de cryptosystèmes) et la cryptanalyse (la recherche ... [more ▼] Les briques de construction des systèmes sécurisés d'information font appel aux notions de cryptologie, qui recouvre la cryptographie (la construction de cryptosystèmes) et la cryptanalyse (la recherche de failles dans les cryptosystèmes). Les cryptosystèmes reposent sur le principe de Kerckhoff, qui affirme que la sécurité d'un cryptosystème ne doit pas reposer sur l'ignorance de l'algorithme pour sa mise en œuvre, mais sur l'ignorance que l'attaquant a d'une information secrète. Ce volume, organisé en chapitres indépendants, traite de la cryptographie à clef secrète, en particulier de l'AES, et des méthodes de cryptanalyse linéaire et différentielle , de la cryptographie à clef publique, en particulier de RSA, du protocole d'échange de clefs de Diffie-Hellman, et des signatures électroniques. Il assemble ces briques de construction dans le cadre des architectures à clef publique (X.509, PGP, DNSSEC) et traite de la sécurité des systèmes (essentiellement Unix), et des réseaux. [less ▲] Detailed reference viewed: 94 (0 UL)Units in some parametric families of quartic fields Leprévost, Franck ; ; in Acta Arithmetica (2007), 127(3), 205-216 Detailed reference viewed: 93 (0 UL)chap "Architectures PKI" Leprévost, Franck ; Varrette, Sébastien ; et al in Sécurité Multimédia: Cryptographie et Sécurité Systèmes et Réseaux (2006) Detailed reference viewed: 38 (0 UL)chap. "Cryptographie à Clé Publique" ; Leprévost, Franck ; et al in Sécurité Multimédia: Cryptographie et Sécurité Systèmes et Réseaux (2006) Detailed reference viewed: 51 (0 UL)Safe Distributed Architecture for Image-based Computer Assisted Diagnosis Varrette, Sébastien ; ; et al in Proc. of the IEEE Intl. Conf. on Pervasive Services, Workshop on Health Pervasive Systems (HPS'06) (2006) Detailed reference viewed: 39 (0 UL) |
||