1. Judit Bar-Ilan and Donald Beaver . 1989 . Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. In PODC 1989. ACM, 201–209. Judit Bar-Ilan and Donald Beaver. 1989. Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. In PODC 1989. ACM, 201–209.
2. Carsten Baum , Daniele Cozzo , and Nigel P. Smart . 2020 . Using TopGear in Overdrive : A More Efficient ZKPoK for SPDZ. In SAC 2019. Springer , 274–302. Carsten Baum, Daniele Cozzo, and Nigel P. Smart. 2020. Using TopGear in Overdrive: A More Efficient ZKPoK for SPDZ. In SAC 2019. Springer, 274–302.
3. Donald Beaver . 1992. Efficient Multiparty Protocols Using Circuit Randomization . In CRYPTO ’91 . Springer , 420–432. Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO ’91. Springer, 420–432.
4. Completeness theorems for non-cryptographic fault-tolerant distributed computation
5. Christina Boura , Ilaria Chillotti , Nicolas Gama , Dimitar Jetchev , Stanislav Peceny , and Alexander Petric . 2018. High-Precision Privacy-Preserving Real-Valued Function Evaluation . In FC 2018 . Springer , 183–202. Christina Boura, Ilaria Chillotti, Nicolas Gama, Dimitar Jetchev, Stanislav Peceny, and Alexander Petric. 2018. High-Precision Privacy-Preserving Real-Valued Function Evaluation. In FC 2018. Springer, 183–202.