Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender

DOI10.1007/978-3-319-12280-9_12MaRDI QIDQ5498725zbMATH OpenOpenAlexFDO

Authors Florian Böhl, Simon Greiner, Patrik Scheidecker

Publication date 10 February 2015

Published in Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12280-9_12

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The Verifiability of Two-Party Protocols
• Secure two-party computation in applied pi-calculus: models and verification
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• A proof of security of Yao's protocol for two-party computation
• On the verifiability of two-party algebraic protocols
• Computationally sound abstraction and verification of secure multi-party computations
• Verifiable computation in multiparty protocols with honest majority
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

Cited in

(1)

• Secure two-party computation in applied pi-calculus: models and verification

Describes a project that uses

Uses Software

• KRAKATOA
• SCiFI
• VeriFast
• Spec#

This page was built for publication: Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498725)