Damgård, I. B., Keller, M., Larraia , E., Pastro, V., Scholl, P. & Smart, N. P. (2013).
Practical Covertly Secure MPC for Dishonest Majority – or: Breaking the SPDZ Limits. In J. Crampton , S. Jajodia & K. Mayes (Eds.),
Computer Security – ESORICS 2013: 18th European Symposium on Research in Computer Security, Egham, UK, September 9-13, 2013. Proceedings (pp. 1-18 ). Springer VS.
https://doi.org/10.1007/978-3-642-40203-6_1
Chase, M., Derler, D., Goldfeder, S.
, Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D. & Zaverucha, G. (2017).
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. In
CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1825-1842). Association for Computing Machinery.
https://doi.org/10.1145/3133956.3133997
Baum, C., Frederiksen, T. K., Hesse, J., Lehmann, A. & Yanai, A. (2020).
Pesto: Proactively secure distributed single sign-on, or how to trust a hacked server. In
Proceedings - 5th IEEE European Symposium on Security and Privacy, Euro S and P 2020 (pp. 587-606). Article 9230400 IEEE.
https://doi.org/10.1109/EuroSP48549.2020.00044
Brandt, M.
, Orlandi, C., Shrishak, K. & Shulman, H. (2020).
Optimal Transport Layer for Secure Computation. In P. Samarati, S. D. C. D. Vimercati, M. S. Obaidat & J. Ben-Othman (Eds.),
ICETE 2020 - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications (Vol. Volume 3: SECRYPT, pp. 130-141). SCITEPRESS Digital Library.
https://doi.org/10.5220/0009826801300141
Orlandi, C., Ravi, D. & Scholl, P. (2022).
On the Bottleneck Complexity of MPC with Correlated Randomness. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.),
Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 194-220). Springer.
https://doi.org/10.1007/978-3-030-97121-2_8
Cramer, R.
, Damgård, I. B. & Fehr, S. (2001).
On the Cost of Reconstructing a Secret or VSS with Optimal Reconstruction. In J. Killian (Ed.),
Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 503-524). Springer.
https://doi.org/10.1007/3-540-44647-8_30
Trifiletti, R.
, Nielsen, J. B., Frederiksen, T. K. & Jakobsen, T. P. (2016).
On the Complexity of Additively Homomorphic UC Commitments. In E. Kushilevitz & T. Malkin (Eds.),
Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings (Vol. 9562, pp. 542-565). Springer VS.
https://doi.org/10.1007/978-3-662-49096-9