On sufficient oracles for secure computation with identifiable abort

DOI10.1007/978-3-031-14791-3_22zbMATH Open1518.94093OpenAlexW3209819715MaRDI QIDQ6134836FDOQ6134836

Authors: Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov 

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-14791-3_22

Recommendations

• Secure multi-party computation with identifiable abort
• Efficient secure multiparty computation with identifiable abort
• Round-optimal multi-party computation with identifiable abort
• Identifying cheaters without an honest majority
• Round efficient secure multiparty quantum computation with identifiable abort

zbMATH Keywords

secure computationidentifiable abort

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25)

Cites Work

• Title not available (Why is that?)
• Identifying Cheaters without an Honest Majority
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure Multi-Party Computation with Identifiable Abort

Cited In (5)

• On the correlation complexity of MPC with cheater identification
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Oracles for structural properties: The isomorphism problem and public-key cryptography
• Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
• Secure multiparty computation with identifiable abort via vindicating release

This page was built for publication: On sufficient oracles for secure computation with identifiable abort

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