2026-07-20T05:27:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2877 2024-03-06T10:33:40Z ddc:004 open_access

Computationally Sound Abstraction and Verification of Secure Multi-Party Computations Backes, Michael Maffei, Matteo Mohammadi, Esfandiar Computational soundness Secure multi-party computation Process calculi Protocol verification We devise an abstraction of secure multi-party computations in the applied $\pi$-calculus. Based on this abstraction, we propose a methodology to mechanically analyze the security of cryptographic protocols employing secure multi-party computations. We exemplify the applicability of our framework by analyzing the SIMAP sugar-beet double auction protocol. We finally study the computational soundness of our abstraction, proving that the analysis of protocols expressed in the applied $\pi$-calculus and based on our abstraction provides computational security guarantees. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael Backes and Matteo Maffei and Esfandiar Mohammadi 2010 Is Part Of LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2010.352 urn:nbn:de:0030-drops-28771 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.352 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode