Pascal Berthomé

According to our database, Pascal Berthomé authored at least 38 papers between 1992 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2021

Secure key distribution in heterogeneous interoperable industrial Internet of Things.

Fergal Martin-Tricot, Cédric Eichler, Pascal Berthomé

Proceedings of the 17th International Conference on Wireless and Mobile Computing, 2021

2020

Parametric analysis on cut-trees and its application on a protein clustering problem.

João Paulo de Freitas Araujo, Madiagne Diallo, Fernanda M. P. Raupp, Pascal Berthomé, José Eugênio Leal

Central Eur. J. Oper. Res., 2020

An Enrolment Gateway for Data Security in Heterogeneous Industrial Internet of Things.

Fergal Martin-Tricot, Cédric Eichler, Pascal Berthomé

Proceedings of the 29th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2020

2019

Formally verified software countermeasures for control-flow integrity of smart card C code.

Karine Heydemann, Jean-François Lalande, Pascal Berthomé

Comput. Secur., 2019

Teaching Android Mobile Security.

Jean-François Lalande, Valérie Viet Triem Tong, Pierre Graux, Guillaume Hiet, Wojciech Mazurczyk, Habiba Chaoui, Pascal Berthomé

Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

2018

A Cloud Brokerage Solution: Formal Methods Meet Security in Cloud Federations.

Salwa Souaf, Pascal Berthomé, Frédéric Loulergue

Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018

2015

A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing.

Ghada Arfaoui, Jean-François Lalande, Jacques Traoré, Nicolas Desmoulins, Pascal Berthomé, Saïd Gharout

Proc. Priv. Enhancing Technol., 2015

Cloud Resources Placement based on Functional and Non-functional Requirements.

Asma Guesmi, Patrice Clemente, Frédéric Loulergue, Pascal Berthomé

Proceedings of the SECRYPT 2015, 2015

2014

A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic.

Michael François, David Defour, Pascal Berthomé

Proceedings of the Theory and Applications of Models of Computation, 2014

Software Countermeasures for Control Flow Integrity of Smart Card C Codes.

Jean-François Lalande, Karine Heydemann, Pascal Berthomé

Proceedings of the Computer Security - ESORICS 2014, 2014

2012

Implementation of exponential and parametrized algorithms in the AGAPE project

Pascal Berthomé, Jean-François Lalande, Vincent Levorato

CoRR, 2012

High Level Model of Control Flow Attacks for Smart Card Functional Security.

Pascal Berthomé, Karine Heydemann, Xavier Kauffmann-Tourkestansky, Jean-François Lalande

Proceedings of the Seventh International Conference on Availability, 2012

Repackaging Android Applications for Auditing Access to Private Data.

Pascal Berthomé, Thomas Fécherolle, Nicolas Guilloteau, Jean-François Lalande

Proceedings of the Seventh International Conference on Availability, 2012

2010

Sensitivity analysis on the all pairs <i>q</i>-route flows in a network.

Madiagne Diallo, Serigne Gueye, Pascal Berthomé

Int. Trans. Oper. Res., 2010

Attack model for verification of interval security properties for smart card C codes.

Pascal Berthomé, Karine Heydemann, Xavier Kauffmann-Tourkestansky, Jean-François Lalande

Proceedings of the 2010 Workshop on Programming Languages and Analysis for Security, 2010

2009

Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks.

Dominique Barth, Pascal Berthomé, Dominique Chiaroni, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial

JOCN, 2009

Impact of a varying capacity on the all pairs 2-route network flows.

Madiagne Diallo, Serigne Gueye, Pascal Berthomé

Electron. Notes Discret. Math., 2009

An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements.

Pascal Berthomé, Raul Cordovil, David Forge, Véronique Ventos, Thomas Zaslavsky

Electron. J. Comb., 2009

2006

Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.

Dominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira

Discret. Optim., 2006

Contribution à l'algorithmique des graphes: quelques représentations pertinentes de graphes. (Contribution to graph algorithm: some useful graphs' representations).

Pascal Berthomé

, 2006

2005

The Complexity of the Maximal Requests Satisfaction Problem in Multipoint Communication.

Dominique Barth, Pascal Berthomé, Paraskevi Fragopoulou

Parallel Process. Lett., 2005

Detecting flows congesting a target network link.

Dominique Barth, Pascal Berthomé, Madiagne Diallo

Electron. Notes Discret. Math., 2005

Computation of Chromatic Polynomials Using Triangulations and Clique Trees.

Pascal Berthomé, Sylvain Lebresne, Kim Nguyen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004

Periodic Gossiping in Commuted Networks.

Dominique Barth, Pascal Berthomé

Theory Comput. Syst., 2004

The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing.

Dominique Barth, Pascal Berthomé, Johanne Cohen

J. Interconnect. Networks, 2004

2003

Generalized Parametric Multi-terminal Flows Problem.

Pascal Berthomé, Madiagne Diallo, Afonso Ferreira

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002

A Mixed Deflection and Convergence Routing Algorithm: Design and Performance.

Dominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial

Proceedings of the Euro-Par 2002, 2002

2000

Self-Simulation for the Passive Optical Star.

Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster

J. Algorithms, 2000

Sorting-Based Selection Algorithms for Hypercubic Networks.

Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton

Algorithmica, 2000

1997

Communication Issues in Parallel Systems with Optical Interconnections.

Pascal Berthomé, Afonso Ferreira

Int. J. Found. Comput. Sci., 1997

Embedding Tori in Partitioned Optical Passive Star Networks.

Pascal Berthomé, Johanne Cohen, Afonso Ferreira

Proceedings of the SIROCCO'97, 1997

1996

Optimal Information Dissemination in Star and Pancake Networks.

Pascal Berthomé, Afonso Ferreira, Stephane Perennes

IEEE Trans. Parallel Distributed Syst., 1996

1995

Self-Simulation for the Passive Optical Star Model.

Pascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster

Proceedings of the Algorithms, 1995

1994

Time-optimal Geometric Algorithms in Hypercubic Networks.

Pascal Berthomé, Afonso Ferreira

Parallel Algorithms Appl., 1994

On broadcasting schemes in restricted optical passive star systems.

Pascal Berthomé, Afonso Ferreira

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993

Sorting-Based Selection Algorithms for Hypercube Networks.

Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton

Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992

Efficient K-Selection in Hypercube Multiprocessors.

Pascal Berthomé

Parallel Process. Lett., 1992

K-Selection in Hypercubes.

Pascal Berthomé

Proceedings of the Computing and Information, 1992