Pascal Berthomé

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 7

Top Topics

Interval Arithmetic

Information Security

Top Venues

Publications

Benjamin Vignau, Patrice Clemente, Pascal Berthomé
Systematic literature review: References extraction helper and automatic analysis. Softw. Impacts 21 (2024)
Fergal Martin-Tricot, Cédric Eichler, Pascal Berthomé
Secure key distribution in heterogeneous interoperable industrial Internet of Things. WiMob (2021)
Fergal Martin-Tricot, Cédric Eichler, Pascal Berthomé
An Enrolment Gateway for Data Security in Heterogeneous Industrial Internet of Things. WETICE (2020)
João Paulo de Freitas Araujo, Madiagne Diallo, Fernanda M. P. Raupp, Pascal Berthomé, José Eugênio Leal
Parametric analysis on cut-trees and its application on a protein clustering problem. Central Eur. J. Oper. Res. 28 (1) (2020)
Karine Heydemann, Jean-François Lalande, Pascal Berthomé
Formally verified software countermeasures for control-flow integrity of smart card C code. Comput. Secur. 85 (2019)
Jean-François Lalande, Valérie Viet Triem Tong, Pierre Graux, Guillaume Hiet, Wojciech Mazurczyk, Habiba Chaoui, Pascal Berthomé
Teaching Android Mobile Security. SIGCSE (2019)
Salwa Souaf, Pascal Berthomé, Frédéric Loulergue
A Cloud Brokerage Solution: Formal Methods Meet Security in Cloud Federations. HPCS (2018)
Ghada Arfaoui, Jean-François Lalande, Jacques Traoré, Nicolas Desmoulins, Pascal Berthomé, Saïd Gharout
A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing. Proc. Priv. Enhancing Technol. 2015 (2) (2015)
Asma Guesmi, Patrice Clemente, Frédéric Loulergue, Pascal Berthomé
Cloud Resources Placement based on Functional and Non-functional Requirements. SECRYPT (2015)
Ghada Arfaoui, Jean-François Lalande, Jacques Traoré, Nicolas Desmoulins, Pascal Berthomé, Saïd Gharout
A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing. CoRR (2015)
Michael François, David Defour, Pascal Berthomé
A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic. TAMC (2014)
Jean-François Lalande, Karine Heydemann, Pascal Berthomé
Software Countermeasures for Control Flow Integrity of Smart Card C Codes. ESORICS (2) (2014)
Pascal Berthomé, Jean-François Lalande, Vincent Levorato
Implementation of exponential and parametrized algorithms in the AGAPE project CoRR (2012)
Pascal Berthomé, Karine Heydemann, Xavier Kauffmann-Tourkestansky, Jean-François Lalande
High Level Model of Control Flow Attacks for Smart Card Functional Security. ARES (2012)
Pascal Berthomé, Thomas Fécherolle, Nicolas Guilloteau, Jean-François Lalande
Repackaging Android Applications for Auditing Access to Private Data. ARES (2012)
Pascal Berthomé, Karine Heydemann, Xavier Kauffmann-Tourkestansky, Jean-François Lalande
Attack model for verification of interval security properties for smart card C codes. PLAS (2010)
Madiagne Diallo, Serigne Gueye, Pascal Berthomé
-route flows in a network. Int. Trans. Oper. Res. 17 (1) (2010)
Pascal Berthomé, Raul Cordovil, David Forge, Véronique Ventos, Thomas Zaslavsky
An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements. Electron. J. Comb. 16 (1) (2009)
Dominique Barth, Pascal Berthomé, Dominique Chiaroni, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial
Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks. JOCN 1 (3) (2009)
Madiagne Diallo, Serigne Gueye, Pascal Berthomé
Impact of a varying capacity on the all pairs 2-route network flows. Electron. Notes Discret. Math. 35 (2009)
Dominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. Discret. Optim. 3 (3) (2006)
Dominique Barth, Pascal Berthomé, Paraskevi Fragopoulou
The Complexity of the Maximal Requests Satisfaction Problem in Multipoint Communication. Parallel Process. Lett. 15 (1-2) (2005)
Dominique Barth, Pascal Berthomé, Madiagne Diallo
Detecting flows congesting a target network link. Electron. Notes Discret. Math. 19 (2005)
Pascal Berthomé, Sylvain Lebresne, Kim Nguyen
Computation of Chromatic Polynomials Using Triangulations and Clique Trees. WG (2005)
Dominique Barth, Pascal Berthomé
Periodic Gossiping in Commuted Networks. Theory Comput. Syst. 37 (5) (2004)
Dominique Barth, Pascal Berthomé, Johanne Cohen
The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing. J. Interconnect. Networks 5 (2) (2004)
Pascal Berthomé, Madiagne Diallo, Afonso Ferreira
Generalized Parametric Multi-terminal Flows Problem. WG (2003)
Dominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. Euro-Par (2002)
Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster
Self-Simulation for the Passive Optical Star. J. Algorithms 34 (1) (2000)
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
Sorting-Based Selection Algorithms for Hypercubic Networks. Algorithmica 26 (2) (2000)
Pascal Berthomé, Afonso Ferreira
Communication Issues in Parallel Systems with Optical Interconnections. Int. J. Found. Comput. Sci. 8 (2) (1997)
Pascal Berthomé, Johanne Cohen, Afonso Ferreira
Embedding Tori in Partitioned Optical Passive Star Networks. SIROCCO (1997)
Pascal Berthomé, Afonso Ferreira, Stephane Perennes
Optimal Information Dissemination in Star and Pancake Networks. IEEE Trans. Parallel Distributed Syst. 7 (12) (1996)
Pascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster
Self-Simulation for the Passive Optical Star Model. ESA (1995)
Pascal Berthomé, Afonso Ferreira
On broadcasting schemes in restricted optical passive star systems. Interconnection Networks and Mapping and Scheduling Parallel Computations (1994)
Pascal Berthomé, Afonso Ferreira
Time-optimal Geometric Algorithms in Hypercubic Networks. Parallel Algorithms Appl. 4 (3-4) (1994)
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
Sorting-Based Selection Algorithms for Hypercube Networks. IPPS (1993)
Afonso Ferreira, Pascal Berthomé, Stephane Perennes
Optimal Information Dissemination in Star and Pancake Networks. SPDP (1993)
Pascal Berthomé
Efficient K-Selection in Hypercube Multiprocessors. Parallel Process. Lett. 2 (1992)
Pascal Berthomé
K-Selection in Hypercubes. ICCI (1992)