Preprint Article Version 1 This version is not peer-reviewed

Security Proof of SSSD Protocols Built on Top of SMC Protocol

Version 1 : Received: 30 September 2024 / Approved: 30 September 2024 / Online: 1 October 2024 (11:54:55 CEST)

How to cite: Anagreh, M.; Laud, P. Security Proof of SSSD Protocols Built on Top of SMC Protocol. Preprints 2024, 2024100002. https://doi.org/10.20944/preprints202410.0002.v1 Anagreh, M.; Laud, P. Security Proof of SSSD Protocols Built on Top of SMC Protocol. Preprints 2024, 2024100002. https://doi.org/10.20944/preprints202410.0002.v1

Abstract

Secure Secret Sharing Single-Source Shortest Distance (SSSD) protocols, built on the Secure Multi-Party Computation (SMC) foundation, have emerged as a promising solution to address the secure distribution and management of sensitive secrets among multiple parties. This paper focuses on the crucial aspect of security proof within SSSD protocols based on SMC, aiming to provide a scientifically rigorous understanding of the formal verification process and the robust guarantees they offer. Through a comprehensive examination of the fundamental principles underpinning SMC and the specific design considerations unique to SSSD protocols, this paper meticulously explores the key components and intricate steps involved in constructing a rigorous security proof. Furthermore, it discusses the adversarial model, precise security definitions, cryptographic assumptions utilized within the proof, and sophisticated techniques and reductions to establish its validity. By means of a meticulous analysis of the security proof for SSSD protocols, this paper critically evaluates both the strengths and limitations of the proposed approach, offering valuable insights to inform future research and development within this significant domain of study.

Keywords

Secure multiparty computation; Arithmetic Black Box; Universal Composability; Privacy-preserving computation; Single-source shortest distances; SIMD parallel; Bellman-Ford; Sharemind

Subject

Computer Science and Mathematics, Security Systems

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.