Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. & Nielsen, J. B. (2014). Adaptive versus static security in the UC Model. In S. S. M. Chow , J. K. Liu, L. C. K. Hui & S. M. Yiu (Eds.), Provable Security: 8th International Conference, ProvSec 2014, Hong Kong, China, October 9-10, 2014. Proceedings (pp. 10-28). Springer VS. https://doi.org/10.1007/978-3-319-12475-9_2

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2015). The Chaining Lemma and its application. In A. Lehmann & S. Wolf (Eds.), Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (pp. 181-196). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_11

Damgård, I. B., Dupont-Dupuis, F. & Nielsen, J. B. (2015). On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation. In Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (pp. 87-104). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_6

Damgård, I. B., Haagh, H. F. & Orlandi, C. (2016). Access Control Encryption: Enforcing Information Flow with Cryptography. In M. Hirt & A. Smith (Eds.), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (Vol. 9986, pp. 547-576). Springer VS. https://doi.org/10.1007/978-3-662-53644-5_21

Damgård, I. B., Polychroniadou, A. & Rao, V. (2016). Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE). In Public-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 9615 , pp. 208-233). Springer VS. https://doi.org/10.1007/978-3-662-49387-8_9

Damgård, I. B., Nielsen, J. B., Polychroniadou, A. & Raskin, M. (2016). On the Communication Required for Unconditionally Secure Multiplication. In Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings (Vol. 9815, pp. 459-488). Springer VS. https://doi.org/10.1007/978-3-662-53008-5_16

Damgård, I., Nielsen, J. B., Ostrovsky, R. & Rosén, A. (2016). Unconditionally secure computation with reduced interaction. In M. Fischlin & J.-S. Coron (Eds.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. 9666, pp. 420-447). Springer VS. https://doi.org/10.1007/978-3-662-49896-5_15

Damgård, I. & Zakarias, R. (2016). Fast oblivious AES a dedicated application of the MiniMac protocol. In D. Pointcheval, A. Nitaj & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2016 - 8th International Conference on Cryptology in Africa, Proceedings (Vol. 9646, pp. 245-264). Springer VS. https://doi.org/10.1007/978-3-319-31517-1_13

Damgård, I. B., Nielsen, J. B., Nielsen, M. & Ranellucci, S. (2016). Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation. http://eprint.iacr.org/2016/695

Damgård, I., Damgård, K., Nielsen, K., Nordholt, P. S. & Toft, T. (2017). Confidential benchmarking based on multiparty computation. In J. Grossklags & B. Preneel (Eds.), Financial Cryptography and Data Security - 20th International Conference, FC 2016, Revised Selected Papers (Vol. 9603 LNCS, pp. 169-187). Springer VS. https://doi.org/10.1007/978-3-662-54970-4_10

Damgård, I., Faust, S., Mukherjee, P. & Venturi, D. (2017). Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. Journal of Cryptology, 30(1), 152-190. https://doi.org/10.1007/s00145-015-9218-0

Damgård, I., Nielsen, J. B., Nielsen, M. & Ranellucci, S. (2017). The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited. In J. Katz & H. Shacham (Eds.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Vol. 10401, pp. 167-187). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_6

Damgård, I., Orlandi, C. & Simkin, M. (2018). Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (Vol. 10992, pp. 799-829). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_27

Damgård, I., Luo, J., Oechsner, S., Scholl, P. & Simkin, M. (2018). Compact Zero-Knowledge Proofs of Small Hamming Weight. In M. Abdalla & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (Vol. 10770, pp. 530-560). Springer VS. https://doi.org/10.1007/978-3-319-76581-5_18

Damgård, I., Kazana, T., Obremski, M., Raj, V. & Siniscalchi, L. (2018). Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. In A. Beimel & S. Dziembowski (Eds.), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings (Vol. 11240, pp. 225-254). Springer VS. https://doi.org/10.1007/978-3-030-03810-6_9

Damgård, I. B., Haagh, H., Nielsen, M. & Orlandi, C. (2019). Commodity-Based 2PC for Arithmetic Circuits. Cryptology ePrint Archive.

Damgård, I. B., Escudero Ospina, D. E., Frederiksen, T. K., Keller, M., Scholl, P. & Volgushev, N. (2019). New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. In Proceedings - 2019 IEEE Symposium on Security and Privacy, SP 2019 (pp. 1102-1120). Article 8835310 IEEE. https://doi.org/10.1109/SP.2019.00078

Damgård, I. B., Ganesh, C. & Orlandi, C. (2019). Proofs of Replicated Storage Without Timing Assumptions. In Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (pp. 355-380). Springer. https://doi.org/10.1007/978-3-030-26948-7_13

Damgård, I., Larsen, K. G. & Nielsen, J. B. (2019). Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (Vol. II, pp. 61-84). Springer. https://doi.org/10.1007/978-3-030-26951-7_3

Damgård, I., Haagh, H., Nielsen, M. & Orlandi, C. (2019). Commodity-Based 2PC for Arithmetic Circuits. In M. Albrecht (Ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings (pp. 154-177). Springer. https://doi.org/10.1007/978-3-030-35199-1_8

Damgård, I., Orlandi, C. & Simkin, M. (2020). Black-box transformations from passive to covert security with public verifiability. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (Vol. Cham, pp. 647-676). Springer. https://doi.org/10.1007/978-3-030-56880-1_23

Damgård, I., Jakobsen, T. P., Nielsen, J. B., Pagter, J. I. & Østergaard, M. B. (2020). Fast threshold ECDSA with honest majority. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 382-400). Springer. https://doi.org/10.1007/978-3-030-57990-6_19

Damgård, I., Haagh, H., Mercer, R., Nitulescu, A., Orlandi, C. & Yakoubov, S. (2020). Stronger Security and Constructions of Multi-designated Verifier Signatures. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings: Proceedings (Vol. II, pp. 229-260). Springer. https://doi.org/10.1007/978-3-030-64378-2_9

Damgård, I. B., Orlandi, C., Takahashi, A. & Tibouchi, M. (2021). Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, 2021, Proceedings: 24rd IACR International Conference on Practice and Theory of Public-Key Cryptography, proceedings part 1 (pp. 99-130). Springer. https://doi.org/10.1007/978-3-030-75245-3_5

Damgård, I. B., Larsen, K. G. & Yakoubov, S. (2021). Broadcast secret-sharing, bounds and applications. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2021.10

Damgård, I. B., Li, B. & Schwartzbach, N. I. (2021). More communication lower bounds for information-theoretic MPC. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2021.2

Damgård, I. B., Magri, B., Ravi, D., Siniscalchi, L. & Yakoubov, S. (2021). Broadcast-Optimal Two Round MPC with an Honest Majority. In Advances in Cryptology – CRYPTO 2021: Proceedings (pp. 155-184). Springer. https://doi.org/10.1007/978-3-030-84245-1_6

Damgård, I., Ganesh, C., Khoshakhlagh, H., Orlandi, C. & Siniscalchi, L. (2021). Balancing Privacy and Accountability in Blockchain Identity Management. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 552-576). Springer. https://doi.org/10.1007/978-3-030-75539-3_23

Damgård, I., Escudero, D. & Ravi, D. (2021). Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. In Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings (pp. 591-622). Springer. https://doi.org/10.1007/978-3-030-90459-3_20

Damgård, I. B., Orlandi, C., Takahashi, A. & Tibouchi, M. (2022). Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. Journal of Cryptology, 35(2), Article 14. https://doi.org/10.1007/s00145-022-09425-3

Damgård, I., Jakobsen, T. P., Nielsen, J. B., Pagter, J. I. & Østergaard, M. B. (2022). Fast threshold ECDSA with honest majority. Journal of Computer Security, 30(1), 167-196. https://doi.org/10.3233/JCS-200112

Damgård, I., Escudero, D. & Polychroniadou, A. (2023). Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 7:1--7:21). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.7

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

Damgård, I., Ravi, D., Siniscalchi, L. & Yakoubov, S. (2023). Minimizing Setup in Broadcast-Optimal Two Round MPC. In C. Hazay & M. Stam (Eds.), Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23–27, 2023, Proceedings, Part II (pp. 129-158). Springer. https://doi.org/10.1007/978-3-031-30617-4_5

Damgård, I., Ravi, D., Siniscalchi, L. & Yakoubov, S. (2023). Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. In A. Aly & M. Tibouchi (Eds.), Progress in Cryptology – LATINCRYPT 2023: 8th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2023, Quito, Ecuador, October 3–6, 2023, Proceedings (pp. 87-106). Springer. https://doi.org/10.1007/978-3-031-44469-2_5

Damgård, I., Keller, H., Nelson, B., Orlandi, C. & Pagh, R. (2024). Differentially Private Selection from Secure Distributed Computing. In T.-S. Chua, C.-W. Ngo, R. Kumar, H. W. Lauw & R. K.-W. Lee (Eds.), WWW 2024 - Proceedings of the ACM Web Conference (pp. 1103-1114). Association for Computing Machinery. https://doi.org/10.1145/3589334.3645435

Damgård, I. B., Ravi, D., Roy, L. D., Tschudi, D. & Yakoubov, S. (2025). Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity. In E. Boyle, E. Boyle & M. Mahmoody (Eds.), Theory of Cryptography - 22nd International Conference, TCC 2024, Proceedings (pp. 266–292). Springer. https://doi.org/10.1007/978-3-031-78023-3_9

Damgård, I., Keller, H., Nelson, B., Orlandi, C. & Pagh, R. (2023). Differentially Private Selection from Secure Distributed Computing.

Dalskov, A. P. K. & Orlandi, C. (2018). Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security. In J. Kim, G.-J. Ahn & S. Kim (Eds.), ASIACCS 2018 - Proceedings of the 2018 ACM Asia Conference on Computer and Communications Security (pp. 343-355). Association for Computing Machinery. https://doi.org/10.1145/3196494.3196547

Dalskov, A. P. K., Orlandi, C., Keller, M., Shrishak, K. & Shulman, H. (2020). Securing DNSSEC Keys via Threshold ECDSA from Generic MPC. In L. Chen, S. Schneider, N. Li & K. Liang (Eds.), European Symposium on Research in Computer Security : Computer Security – ESORICS 2020 (Vol. I, pp. 654-673). Springer. https://doi.org/10.1007/978-3-030-59013-0_32

Dahl, M. & Damgård, I. B. (2013). Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption. Cryptology ePrint Archive. http://eprint.iacr.org/2013/296.pdf

Dahl, M. & Damgård, I. B. (2014). Universally composable symbolic analysis for two-party protocols based on homomorphic encryption. In P. Q. Nguyen & E. Oswald (Eds.), Advances in Cryptology – EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings (pp. 695-712). Springer VS. https://doi.org/10.1007/978-3-642-55220-5_38

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

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

Cramer, R., Damgård, I. B. & Nielsen, J. B. (2001). Multiparty Computation from Threshold Homomorphic Encryption. 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. 280-300). Springer. https://doi.org/10.1007/3-540-44987-6_18

Cramer, R., Damgård, I. B. & Schoenmakers, B. (1994). Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Y. G. Desmedt (Ed.), Advances in Cryptology - CRYPTO '94: 14th Annual International Cryptology Conference Santa Barbara, California, USA August 21-25, 1994 Proceedings (pp. 174-187). Springer. https://doi.org/10.1007/3-540-48658-5_19

Cramer, R. & Damgård, I. B. (1995). Secure Signature Schemes based on Interactive Protocols. In D. Coppersmith (Ed.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (pp. 297-310). Springer. https://doi.org/10.1007/3-540-44750-4_24

Cramer, R., Damgård, I. B. & Pedersen, T. P. (1997). Efficient and provable security amplifications. In M. Lomas (Ed.), Security Protocols: International Workshop Cambridge, United Kingdom, April 10-12, 1996 Proceedings (pp. 101-109). Springer. https://doi.org/10.1007/3-540-62494-5_9

Cramer, R. & Damgård, I. B. (1996). New Generation of Secure and Practical RSA-Based Signatures. In N. Koblitz (Ed.), Advances in Cryptology - CRYPTO '96: 16th Annual International Cryptology Conference Santa Barbara, California, USA August 18-22, 1996 Proceedings (pp. 173-185). Springer. https://doi.org/10.1007/3-540-68697-5_14

Cramer, R. & Damgård, I. B. (1997). Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation. In W. Fumy (Ed.), Advances in Cryptology - EUROCRYPT '97: International Conference on the Theory and Application of Cryptographic Techniques Konstanz, Germany, May 11-15, 1997 Proceedings (pp. 75-87). Springer. https://doi.org/10.1007/3-540-69053-0_7

Displaying results 351 to 400 out of 619

8

Revised 26.01.2026

-

Marianne Dammand Iversen