Secure Collaborative Supply-Chain Management

Kerschbaum, Florian; Schroepfer, Axel; Zilli, Antonio; Pibernik, Richard; Catrina, Octavian; Hoogh, Sebastiaan de; Schoenmakers, Berry; Cimato, Stelvio; Damiani, Ernesto

doi:10.1109/mc.2011.224

Cited by 40 publications

(25 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Afterwards, no party can infer anything about the other party's input except what can be inferred from her own input and the output f (x, y). Secure computation has many applications, e.g., in the financial sector, and has been successfully deployed in commercial and industrial settings [8,29,7].…”

Section: Introductionmentioning

confidence: 99%

Automatic Protocol Selection in Secure Two-Party Computations

Kerschbaum

Schneider

Schröpfer

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Performance of secure computation is still often an obstacle to its practical adaption. There are different protocols for secure computation that compete for the best performance. In this paper we propose automatic protocol selection which selects a protocol for each operation resulting in a mix with the best performance so far. Based on an elaborate performance model, we propose an optimization algorithm and an efficient heuristic for this selection problem. We show that our mixed protocols achieve the best performance on a set of use cases. Furthermore, our results underpin that the selection problem is so complicated and large in size, that a programmer is unlikely to manually make the optimal selection. Our proposed algorithms nevertheless can be integrated into a compiler in order to yield the best (or near-optimal) performance.

show abstract

Section: Introductionmentioning

confidence: 99%

Automatic Protocol Selection in Secure Two-Party Computations

Kerschbaum

Schneider

Schröpfer

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…"SecureSCM", secure collaborative supply chain management, the European research project [48], is an example of the application of SMC algorithms in the field of SCNs. The project enabled privacy preserving online collaboration among various firms in a SCN.…”

Section: Privacy Concerns In Supply Chainmentioning

confidence: 99%

A Privacy Preserving Approach to Collaborative Systemic Risk Identification: The Use-Case of Supply Chain Networks

Garizy

Fridgen

Wederhake

2018

Security and Communication Networks

View full text Add to dashboard Cite

Globalization and outsourcing are two main factors which are leading to higher complexity of supply chain networks. Due to the strategic importance of having a sustainable network, it is necessary to have an enhanced supply chain network risk management. In a supply chain network many firms depend directly or indirectly on a specific supplier. In this regard, unknown risks of network's structure can endanger the whole supply chain network's robustness. In spite of the importance of risk identification of supply chain network, firms are not willing to exchange the structural information of their network. Firms are concerned about risking their strategic positioning or established connections in the network. The paper proposes to combine secure multiparty computation cryptography methods with risk identification algorithms from social network analysis to address this challenge. The combination enables structural risk identification of supply chain networks without endangering firms' competitive advantage.

show abstract

“…This fixed-point approach has been used to solve linear programming problems with applications in secure supply chain management [6,12]. However, fixed point numbers provide only a limited amount of flexibility in computations, since they can represent values only in a small interval with a predetermined precision.…”

Section: Previous Workmentioning

confidence: 99%

Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations

Krips

Willemson

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper develops a new hybrid model of floating point numbers suitable for operations in secure multi-party computations. The basic idea is to consider the significand of the floating point number as a fixed point number and implement elementary function applications separately of the significand. This gives the greatest performance gain for the power functions (e.g. inverse and square root), with computation speeds improving up to 18 times in certain configurations. Also other functions (like exponent and Gaussian error function) allow for the corresponding optimisation.We have proposed new polynomials for approximation, and implemented and benchmarked all our algorithms on the Sharemind secure multi-party computation framework.

show abstract

Secure Collaborative Supply-Chain Management

Cited by 40 publications

References 6 publications

Automatic Protocol Selection in Secure Two-Party Computations

Automatic Protocol Selection in Secure Two-Party Computations

A Privacy Preserving Approach to Collaborative Systemic Risk Identification: The Use-Case of Supply Chain Networks

Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations

Contact Info

Product

Resources

About