On sufficient oracles for secure computation with identifiable abort

DOI10.1007/978-3-031-14791-3_22zbMath1518.94093OpenAlexW3209819715MaRDI QIDQ6134836

Luisa Siniscalchi, Sophia Yakoubov, Mark Simkin

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

zbMATH Keywords

secure computationidentifiable abort

Mathematics Subject Classification ID

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

Cites Work

• Secure Multi-Party Computation with Identifiable Abort
• Identifying Cheaters without an Honest Majority
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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