The SecureSCM project (www.securescm.org) aims to develop cryptographic solutions to the problem of data sharing in Supply Chain Optimization (SCO). The SCO problem has a precise mathematical structure. It is an instance of the general... more
The SecureSCM project (www.securescm.org) aims to develop cryptographic solutions to the problem of data sharing in Supply Chain Optimization (SCO). The SCO problem has a precise mathematical structure. It is an instance of the general Linear Programming (LP) problem. However, standard techniques for LP problems are not suitable for this purpose because they require participants to reveal private data needed as input to the algorithm. The risk of revealing this information far exceeds the benefits gained. Therefore, the aim of the project is to develop efficient techniques for securely solving LP problems. In this paper we give a summary of work done in the cryptographic aspects of the project. We describe the state-of-the art building blocks for secure linear programming along with an analysis of their complexity. 1
Research Interests:
ABSTRACT During the decade that has elapsed since its standardisation by ISO, the Estelle formal description technique has been successfully applied to the development of various communications protocols. We present in this paper a... more
ABSTRACT During the decade that has elapsed since its standardisation by ISO, the Estelle formal description technique has been successfully applied to the development of various communications protocols. We present in this paper a protocol engineering methodology that has resulted from the use of Estelle in several projects, involving the specification, validation, performance analysis and implementation of real-life, complex protocols. The methodology is based on the support offered by the Estelle development toolset (edt). It gradually evolved, in parallel with the continuous enhancement of edt, aiming to provide a protocol engineering environment that consistently supports the entire development process. We outline in the paper the principles of the methods and illustrate them with examples of their application to the development of an innovative transport protocol with multicast and multimedia capabilities.
Research Interests:
Research Interests:
Research Interests:
With the advent of effective techniques and tools, the industrial use of the formal methods for telecommuni-cation systems development is rapidly extending. At the same time, the diversity of the applications determines a continuous... more
With the advent of effective techniques and tools, the industrial use of the formal methods for telecommuni-cation systems development is rapidly extending. At the same time, the diversity of the applications determines a continuous search for new methods. This paper presents a new approach for expressing the correctness requirements and the validation of the communication protocols. It addresses mainly the complex protocols, e.g., for multicast communications, and the detailed formal descriptions, needed for automatic implementation. The correctness requirements are expressed with respect to a set of significant events, using dependence relations. The specification is intuitive and can be made at various abstraction levels. Observed simulation can be used for verifying the specified properties, so that systems of practically any complexity can be tackled.
Research Interests:
Collaborative business applications can use secure mul-tiparty computation to preserve input privacy. These applications need protocols that provide all the basic operations with integers and rational numbers and allow secure composition... more
Collaborative business applications can use secure mul-tiparty computation to preserve input privacy. These applications need protocols that provide all the basic operations with integers and rational numbers and allow secure composition and efficient application development. Secure computation with rational numbers is a long-standing open problem. We present in this paper several components of a protocol family for secure computation with fixed-point numbers based on secret sharing.
Research Interests:
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applications of this model (e.g., supply chain planning) involve... more
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applications of this model (e.g., supply chain planning) involve private data that the parties cannot reveal to each other. Traditional linear programming methods cannot be used in this case. The problem can be solved using cryptographic protocols that compute with private data and preserve data privacy. We present a practical solution using multiparty computation based on secret sharing. The linear programming protocols use a variant of the simplex algorithm and secure computation with fixed-point rational numbers, optimized for this type of application. We present the main protocols as well as performance measurements for an implementation of our solution.
Research Interests:
Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computation preserves the privacy of input data using cryptographic protocols,... more
Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computation preserves the privacy of input data using cryptographic protocols, allowing the parties to obtain the benefits of data sharing and at the same time avoid the associated risks. These business applications need protocols that support all the primitive data types and allow secure protocol composition and efficient application development. Secure computation with rational numbers has been a challenging problem. We present in this paper a family of protocols for multiparty computation with rational numbers using fixed-point representation. This approach offers more efficient solutions for secure computation than other usual representations.
Research Interests:
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer integer truncation and comparison , which are typically the... more
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer integer truncation and comparison , which are typically the main performance bottlenecks in complex applications. We present techniques and building blocks that allow to improve the efficiency of these protocols, in order to meet the performance requirements of a broader range of applications. The protocols can be constructed using different secure computation methods. We focus on solutions for multiparty computation using secret sharing.
Research Interests:
On the improvement of Estelle based automatic implementations O. Catrina", A. Nogaib " Institut National des Telecommunications, 9 Charles ... ro Key words: Automatic protocol implementation, Estelle, transport protocol... more
On the improvement of Estelle based automatic implementations O. Catrina", A. Nogaib " Institut National des Telecommunications, 9 Charles ... ro Key words: Automatic protocol implementation, Estelle, transport protocol Abstract: The main challenges for the tools which derive ...
Page 1. Ts st J. William Atwood Octavian Catrina John Fenton W. Timothy Strayer Montreal, Quebec Bucharest Los Angeles, CA Livermore, CA Canada Romania USA USA Concordia University Polytehnica University Mentat, Inc. Sandia National... more
Page 1. Ts st J. William Atwood Octavian Catrina John Fenton W. Timothy Strayer Montreal, Quebec Bucharest Los Angeles, CA Livermore, CA Canada Romania USA USA Concordia University Polytehnica University Mentat, Inc. Sandia National Laboratories ct ...
Research Interests:
... EBS Business School, Wiesbaden, Germany, Email: Richard.Pibernik@ebs.edu Octavian Catrina Universität Mannheim, Mannheim, Germany, Email: octavian.catrina@uni-mannheim.de ... to him there are three or more prime partners each of them... more
... EBS Business School, Wiesbaden, Germany, Email: Richard.Pibernik@ebs.edu Octavian Catrina Universität Mannheim, Mannheim, Germany, Email: octavian.catrina@uni-mannheim.de ... to him there are three or more prime partners each of them in charge of a main section of ...