1. Lecture Notes in Computer Science;D Beaver,1990
2. Brandt, N.: Tight setup bounds for identifiable abort. Cryptology ePrint Archive, Report 2021/684 (2021). https://ia.cr/2021/684
3. Brandt, N.-P., Maier, S., Müller, T., Müller-Quade, J.: Constructing secure multi-party computation with identifiable abort. IACR Cryptology ePrint Archive, 2020:153 (2020)
4. Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: Proceedings of the 18th ACM STOC, pp. 364–369. ACM Press (1986)
5. Lecture Notes in Computer Science;C Crépeau,1995