Paper 2021/151
On Sufficient Oracles for Secure Computation with Identifiable Abort
Mark Simkin, Luisa Siniscalchi, and Sophia Yakoubov
Abstract
Identifiable abort is the strongest security guarantee that is achievable for secure multi-party computation in the dishonest majority setting.
Protocols that achieve this level of security ensure that, in case of an abort, all honest parties agree on the identity of at least one corrupt party who can be held accountable for the abort.
It is important to understand what computational primitives must be used to obtain secure computation with identifiable abort.
This can be approached by asking which oracles can be used to build perfectly secure computation with identifiable abort.
Ishai, Ostrovsky, and Zikas (Crypto 2014) show that an oracle that returns correlated randomness to all
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Secure ComputationIdentifiable Abort
- Contact author(s)
-
simkin @ cs au dk
sophia yakoubov @ gmail com
lsiniscalchi @ cs au dk - History
- 2021-06-11: last of 4 revisions
- 2021-02-12: received
- See all versions
- Short URL
- https://ia.cr/2021/151
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/151, author = {Mark Simkin and Luisa Siniscalchi and Sophia Yakoubov}, title = {On Sufficient Oracles for Secure Computation with Identifiable Abort}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/151}, year = {2021}, url = {https://eprint.iacr.org/2021/151} }