Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. & Keller, M. (2010). Secure Multiparty AES. Lecture Notes in Computer Science, 6052, 367-374. https://doi.org/10.1007/978-3-642-14577-3_31

Acharya, A., Baig, M. A., Hofheinz, D., Azari, K. & Kamath, C. (2025). Securely Instantiating 'Half Gates' Garbling in the Standard Model. In T. Jager & J. Pan (Eds.), Public-Key Cryptography – PKC 2025 - 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, 2025, Proceedings (Vol. 15677, pp. 37-75). Springer LNCS. https://doi.org/10.1007/978-3-031-91829-2_2

Chiang, J. H.-Y., Damgård, I., Orlandi, C., Pancholi, M. & Simkin, M. (2026). Securely Computing One-Sided Matching Markets. In C. Garman & P. Moreno-Sanchez (Eds.), Financial Cryptography and Data Security - 29th International Conference, FC 2025, Revised Selected Papers (pp. 126-143). Springer Nature. https://doi.org/10.1007/978-3-032-07024-1_8

Damgård, I. B., Salvail, L., Schaffner, C. & Fehr, S. (2007). Secure Identification and QKD in the Bounded-Quantum-Storage Model. In A. Menezes (Ed.), Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (pp. 342-359). Springer. https://doi.org/10.1007/978-3-540-74143-5_19

Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. (2014). Secure identification and QKD in the bounded-quantum-storage model. Theoretical Computer Science, 560(1), 12-26. https://doi.org/10.1016/j.tcs.2014.09.014

Lucani Rötter, D. E., Nielsen, L., Orlandi, C., Pagnin, E. & Vestergaard, R. (2020). Secure generalized deduplication via multi-key revealing encryption. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 298-318). Springer. https://doi.org/10.1007/978-3-030-57990-6_15

Cramer, R. & Damgård, I. B. (2001). Secure Distributed Linear Algebra in a Constant Number of Rounds. In J. Killian (Ed.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 119-137). Springer. https://doi.org/10.1007/3-540-44647-8_7

Pagter, J. I., Toft, T., Damgård, I. B., Bogetoft, P., Nielsen, K. & Jakobsen, T. (2005). Secure Computing, Economy, and Trust - A Generic Solution for Secure Auctions with Real-World Applications. BRICS Report Series, (RS-05-18), 1-35.

Damgård, I. B., Kölker, J. & Toft, T. (2012). Secure Computation, I/O-Efficient Algorithms and Distributed Signatures. Lecture Notes in Computer Science, 7178, 278-295 . https://doi.org/10.1007/978-3-642-27954-6_18

Orlandi, C. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.

Damgård, I., Ravi, D., Tschudi, D. & Yakoubov, S. (2023). Secure Communication in Dynamic Incomplete Networks. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 13:1--13:21). Article 13 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.13

Applebaum, B., Damgård, I., Ishai, Y., Nielsen, M. & Zichron, L. (2017). Secure Arithmetic Computation with Constant Computational Overhead. In H. Shacham & J. Katz (Eds.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Vol. 10401, pp. 223-254). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_8

Aranha, D. F., Guimaraes, A., Hoffman, C. & Méaux, P. (2025). Secure and efficient transciphering for FHE-based MPC. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2025(3), 745-780. https://doi.org/10.46586/tches.v2025.i3.745-780

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

Damgård, I. B., Kölker, J. & Miltersen, P. B. (2012). Secret Sharing and Secure Computing from Monotone Formulae. http://eprint.iacr.org/2012/536

Damgård, I. B. & Cramer, R. (2004). Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. In M. Naor (Ed.), Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004. Proceedings (pp. 223-237). Springer. https://doi.org/10.1007/978-3-540-24638-1_13

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

Chillotti, I., Orsini, E., Scholl, P. & Van Leeuwen, B. (2024). Scooby: Improved multi-party homomorphic secret sharing based on FHE. Information and Computation, 297, Article 105133. https://doi.org/10.1016/j.ic.2023.105133

Damgård, I. B. & Ishai, Y. (2006). Scalable Secure Multiparty Computation. In C. Dwork (Ed.), Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings (pp. 501-520). Springer. https://doi.org/10.1007/11818175_30

Damgård, I. B., Krøigaard, M., Ishai, Y., Nielsen, J. B. & Smith, A. (2008). Scalable Multiparty Computation with Nearly Optimal Work and Resilience. Lecture Notes in Computer Science, 5157, 241-261. https://doi.org/10.1007/978-3-540-85174-5_14

Damgård, I. B. & Jurik, M. J. (2003). Scalable Key-Escrow. BRICS Report Series, (RS-03-22).

Damgård, I. B. & Nielsen, J. B. (2007). Scalable and Unconditionally Secure Multiparty Computation. In A. Menezes (Ed.), Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (pp. 572-590). Springer. https://doi.org/10.1007/978-3-540-74143-5_32

Kyster, A., Nielsen, F. H., Oechsner, S. & Scholl, P. (2025). Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations. In M. Blanton, W. Enck & C. Nita-Rotaru (Eds.), 2025 IEEE Symposium on Security and Privacy (SP) (pp. 2491-2508). IEEE. https://doi.org/10.1109/SP61157.2025.00176

Hirt, M. & Nielsen, J. B. (2006). Robust Multiparty Computation with Linear Communication Complexity. In C. Dwork (Ed.), Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference (pp. 463-482) https://doi.org/10.1007/11818175_28

Damgård, I. B. & Pedersen, M. Ø. (2008). RFID Security: Tradeoffs between Security and Efficiency. Lecture Notes in Computer Science, 318-332. https://doi.org/10.1007/978-3-540-79263-5

Guimaraes, A., Borin, E. & Aranha, D. F. (2021). Revisiting the functional bootstrap in TFHE. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2021(2), 229-253. https://doi.org/10.46586/tches.v2021.i2.229-253

Chakraborty, S., Ganesh, C., Pancholi, M. R. & Sarkar, P. (2021). Reverse Firewalls for Adaptively Secure MPC without Setup. In M. Tibouchi & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part 2: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part II (pp. 335-364). Springer. https://doi.org/10.1007/978-3-030-92075-3_12

Chakraborty, S., Dziembowski, S. & Nielsen, J. B. (2020). Reverse firewalls for actively secure mpcs. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 732-762). Springer. https://doi.org/10.1007/978-3-030-56880-1_26

Haagh, H., Ji, Y., Li, C., Orlandi, C. & Song, Y. (2016). Revealing Encryption for Partial Ordering. http://eprint.iacr.org/2016/972.pdf

Haagh, H., Ji, Y., Li, C., Orlandi, C. & Song, Y. (2017). Revealing Encryption for Partial Ordering. In M. O’Neill (Ed.), Cryptography and Coding - 16th IMA International Conference, IMACC 2017, Proceedings (pp. 3-22). Springer VS. https://doi.org/10.1007/978-3-319-71045-7_1

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

Barcellos, M. & Aranha, D. F. (2019). Research in Security and Privacy in Brazil. IEEE Security & Privacy, 16(6), 14-21. Article 8636416. https://doi.org/10.1109/MSEC.2018.2874855

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

Kondi, Y., Magri, B., Orlandi, C. & Shlomovits, O. (2021). Refresh when you wake up: Proactive threshold wallets with offline devices. In 2021 IEEE Symposium on Security and Privacy (SP) (pp. 608-625). IEEE. https://doi.org/10.1109/SP40001.2021.00067

Díaz Cardell, S., Aranha, D. F. & Fuster-Sabater, A. (2020). Recovering decimation-based cryptographic sequences by means of linear CAs. Logic Journal of the IGPL, 28(4), 430–448. https://doi.org/10.1093/jigpal/jzz051

Nielsen, J. B. & Ranellucci, S. (2016). Reactive garbling: Foundation, instantiation, application. In J. H. Cheon & T. Takagi (Eds.), Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 10032, pp. 1022-1052). Springer VS. https://doi.org/10.1007/978-3-662-53890-6_34

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

Meyer, P., Orlandi, C., Roy, L. & Scholl, P. (2025). Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. In E. Boyle & M. Mahmoody (Eds.), Theory of Cryptography - 22nd International Conference, TCC 2024, Proceedings (pp. 71-97). Article 323579 Springer Nature. https://doi.org/10.1007/978-3-031-78023-3_3

Gentry, C., Halevi, S., Magri, B., Nielsen, J. B. & Yakoubov, S. (2021). Random-Index PIR and Applications. In K. Nissim & B. Waters (Eds.), Theory of Cryptography : 19th International Conference, TCC 2021, Proceedings (pp. 32-61). Springer. https://doi.org/10.1007/978-3-030-90456-2_2

Braun, L., Pancholi, M. R., Rachuri, R. & Simkin, M. (2023). Ramen: Souper Fast Three-Party Computation for RAM Programs. In CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 3284-3297). Association for Computing Machinery. https://doi.org/10.1145/3576915.3623115

Fauzi, P. M., Meiklejohn, S., Mercer, R. H. & Orlandi, C. (2019). Quisquis: A New Design for Anonymous Cryptocurrencies. In Advances in Cryptology – ASIACRYPT 2019 (pp. 649-678) https://doi.org/10.1007/978-3-030-34578-5

Damgård, I. B. & Lunemann, C. (2009). Quantum-Secure Coin-Flipping and Applications. Lecture Notes in Computer Science, 52-69. https://doi.org/10.1007/978-3-642-10366-7_4

Damgård, I. B. (2011). Quantum Communication Attacks on Classical Cryptographic Protocols. Abstract from 5th International Conference on Information Theoretic Security, Amsterdam, Netherlands. https://doi.org/10.1007/978-3-642-20728-0_16

Davi Resende, A. C., Mochetti, K. & Aranha, D. F. (2015). PUF-Based Mutual Multifactor Entity and Transaction Authentication for Secure Banking. In T. Güneysu, G. Leander & A. Moradi (Eds.), Lightweight Cryptography for Security and Privacy (pp. 77-96). Springer. https://doi.org/10.1007/978-3-319-29078-2_5

Baum, C., Braun, L., Delpech de Saint Guilhem, C., Klooß, M., Orsini, E., Roy, L. D. & Scholl, P. (2023). Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology: CRYPTO 2023 (pp. 581-615). Springer. https://doi.org/10.1007/978-3-031-38554-4_19

Baum, C., Damgård, I. B. & Orlandi, C. (2014). Publicly Auditable Secure Multi-Party Computation. In M. Abdalla & R. D. Prisco (Eds.), Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 175-196 ). Springer VS. https://doi.org/10.1007/978-3-319-10879-7_11

Damgård, I. B., Hofheinz, D., Kiltz, E. & Thorbek, R. I. (2008). Public-Key Encryption with Non-interactive Opening. Lecture Notes in Computer Science, 239-255. https://doi.org/10.1007/978-3-540-79263-5_15

Hasler, S., Reisert, P. & Küsters, R. (2026). Pseudorandom Correlation Functions from Ring-LWR. In G. Hanaoka & B.-Y. Yang (Eds.), Advances in Cryptology - ASIACRYPT 2025 - 31st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 16251, pp. 401-438). Springer. https://doi.org/10.1007/978-981-95-5122-4_13

Hasler, S., Reisert, P. & Küsters, R. (2025). Pseudorandom Correlation Functions from Ring-LWR. https://eprint.iacr.org/2025/1637

Hasler, S. & Reisert, P. (2025). Pseudorandom Correlation Functions for Multiparty Beaver Triples from Sparse LPN. https://eprint.iacr.org/2025/2002

Displaying results 151 to 200 out of 651

Revised 04.08.2026

Marianne Dammand Iversen