Cramer, R.
, Damgård, I. B., Döttling, N. M., Fehr, S. & Spini, G. (2015).
Linear secret sharing schemes from error correcting codes and universal hash functions. In E. Oswald & M. F. Fischlin (Eds.),
Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II (pp. 313-336). Springer VS.
https://doi.org/10.1007/978-3-662-46803-6_11
Cramer, R.
, Damgård, I., Döttling, N., Giacomelli, I. & Xing, C. (2017).
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. In J. Shikata (Ed.),
Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings (Vol. 10681, pp. 1-25). Springer VS.
https://doi.org/10.1007/978-3-319-72089-0_1
Cramer, R.
, Damgård, I., Escudero, D., Scholl, P. & Xing, C. (2018).
SPDΖ2k: Efficient MPC mod 2k for Dishonest Majority. In H. Shacham & A. Boldyreva (Eds.),
Advances in Cryptology - CRYPTO 2018 (Vol. 10992, pp. 769-798). Springer VS.
https://doi.org/10.1007/978-3-319-96881-0_26
Coron, J.-S.
& Nielsen, J. B. (Eds.) (2017).
Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I. In J.-S. Coron & J. Buus Nielsen (Eds.),
Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I (Vol. 10210). Springer VS.
https://doi.org/10.1007/978-3-319-56620-7
Coron, J.-S.
& Nielsen, J. B. (Eds.) (2017).
Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part II. In J.-S. Coron & J. Buus Nielsen (Eds.),
Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part II (Vol. 10211). Springer VS.
https://doi.org/10.1007/978-3-319-56614-6
Coron, J.-S.
& Nielsen, J. B. (Eds.) (2017).
Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part III. In J.-S. Coron & J. Buus Nielsen (Eds.),
Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part III (Vol. 10212). Springer VS.
https://doi.org/10.1007/978-3-319-56617-7
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. (2013).
Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed.
Electronic Colloquium on Computational Complexity, (TR13-107).
http://eccc.hpi-web.de/report/2013/107/
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. D. (2013).
Efficient multiparty protocols via log-depth threshold formulae. In R. Canetti & J. A. Garay (Eds.),
Advances in Cryptology – CRYPTO 2013: 33rd Annual Conference. Proceedings, Part II (pp. 185-202). Springer VS.
https://doi.org/10.1007/978-3-642-40084-1_11
Ciampi, M.
, Damgård, I., Ravi, D., Siniscalchi, L., Xia, Y.
& Yakoubov, S. (2023).
Broadcast-Optimal Four-Round MPC in the Plain Model. In G. Rothblum & H. Wee (Eds.),
Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II (pp. 3-32). Springer.
https://doi.org/10.1007/978-3-031-48618-0_1
Chillotti, I., Orsini, E.
, Scholl, P., Smart, N. P. & Leeuwen, B. V. (2022).
Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. In C. Galdi & S. Jarecki (Eds.),
Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 540-563). Springer.
https://doi.org/10.1007/978-3-031-14791-3_24
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
Charbit, P., Couteau, G.
, Meyer, P. & Naserasr, R. (2025).
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. In E. Boyle, E. Boyle & M. Mahmoody (Eds.),
Theory of Cryptography - 22nd International Conference, TCC 2024, Proceedings (pp. 167-199). Springer Science and Business Media Deutschland GmbH.
https://doi.org/10.1007/978-3-031-78023-3_6
Cascudo Pueyo, I., Damgård, I. B., David, B. M., Giacomelli, I., Nielsen, J. B. & Trifiletti, R. (2015).
Additively Homomorphic UC commitments with Optimal Amortized Overhead. In J. Katz (Ed.),
Public-Key Cryptography, PKC 2015: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30-April 1, 2015, Proceedings (pp. 495–515). Springer.
https://doi.org/10.1007/978-3-662-46447-2_22
Cascudo, I.
, Damgård, I., David, B. M., Döttling, N. & Nielsen, J. B. (2016).
Rate-1, linear time and additively homomorphic UC commitments. In M. Robshaw & J. Katz (Eds.),
Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings (Vol. 9816, pp. 179-207). Springer VS.
https://doi.org/10.1007/978-3-662-53015-3_7
Cascudo, I., Damgård, I., Farràs, O.
& Ranellucci, S. (2017).
Resource-Efficient OT Combiners with Active Security. In Y. Kalai & L. Reyzin (Eds.),
Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Vol. 10678, pp. 461-486). Springer VS.
https://doi.org/10.1007/978-3-319-70503-3_15
Cascudo, I.
, Damgård, I., David, B., Döttling, N., Dowsley, R. & Giacomelli, I. (2019).
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). In S. D. Galbraith & S. Moriai (Eds.),
Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 606-635). Springer.
https://doi.org/10.1007/978-3-030-34621-8_22
Canetti, R.
, Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2004).
Adaptive versus Non-Adaptive Security of Multi-Party Protocols.
Journal of Cryptology,
17(3), 153-207.
https://doi.org/10.1007/s00145-004-0135-x
Canetti, R.
, Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2001).
On Adaptive vs. Non-adaptive Security of Multiparty Protocols. In B. Pfitzmann (Ed.),
Advances in Cryptology --- EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 262-279). Springer.
https://doi.org/10.1007/3-540-44987-6_17
Canetti, R., Krawczyk, H.
& Nielsen, J. B. (2003).
Relaxing Chosen-Ciphertext Security. In D. Boneh (Ed.),
Advances in Cryptology - CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings (pp. 565-582). Springer.
https://doi.org/10.1007/978-3-540-45146-4_33
Canetti, R.
, Kolby, S., Ravi, D., Soria Vazquez, E.
& Yakoubov, S. (2023).
Taming Adaptivity in YOSO Protocols: The Modular Way. In G. Rothblum & H. Wee (Eds.),
Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II (Vol. 2, pp. 33-62). Springer.
https://doi.org/10.1007/978-3-031-48618-0_2
Campanelli, M. & Khoshakhlagh, H. (2021).
Succinct Publicly-Certifiable Proofs: Or, Can a Blockchain Verify a Designated-Verifier Proof? In A. Adhikari, R. Küsters & B. Preneel (Eds.),
Progress in Cryptology – INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, 2021, Proceedings: 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings (pp. 607-631). Springer.
https://doi.org/10.1007/978-3-030-92518-5_27
Campanelli, M., Francati, D. & Orlandi, C. (2023).
Structure-Preserving Compilers from New Notions of Obfuscations. In A. Boldyreva & V. Kolesnikov (Eds.),
Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part II (pp. 663-693). Springer.
https://doi.org/10.1007/978-3-031-31371-4_23
Burra, S. S., Larraia, E.
, Nielsen, J. B., Nordholt, P. S., Orlandi, C., Orsini, E., Scholl, P. & Smart, N. P. (2015).
High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer.
http://eprint.iacr.org/2015/472
Burra, S. S., Larraia, E.
, Nielsen, J. B., Nordholt, P. S.
, Orlandi, C., Orsini, E.
, Scholl, P. & Smart, N. P. (2021).
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer.
Journal of Cryptology,
34(3), Article 34.
https://doi.org/10.1007/s00145-021-09403-1