Publications

List of publications

Sort by: Date | Author | Title

Mikkelsen, G. L., Keller, M. & Rupp, A. (2012). Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols. Lecture Notes in Computer Science, 7412, 147-166 . https://doi.org/10.1007/978-3-642-32284-6_9

Damgård, I. B. & Dupont, K. (2005). Efficient Threshold RSA Signatures with General Moduli and no Extra Assumptions. In S. Vaudenay (Ed.), Public Key Cryptography - PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005. Proceedings (pp. 346-361). Springer. https://doi.org/10.1007/978-3-540-30580-4_24

Aranha, D. F., Azarderakhsh, R. & Karabina, K. (2017). Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves. In S. S. Ali, J.-L. Danger & T. Eisenbarth (Eds.), Security, Privacy, and Applied Cryptography Engineering - 7th International Conference, SPACE 2017, Proceedings: 7th International Conference, SPACE 2017, Goa, India, December 13-17, 2017, Proceedings (pp. 74-92). Springer. https://doi.org/10.1007/978-3-319-71501-8_5

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets. In M. Abdalla & P. S. L. M. Barreto (Eds.), Progress in Cryptology – LATINCRYPT 2010 (pp. 144-161). Springer. https://doi.org/10.1007/978-3-642-14712-8_9

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

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2011). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. http://eprint.iacr.org/2011/494

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2012). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Lecture Notes in Computer Science, 7178, 313-331. https://doi.org/10.1007/978-3-642-27954-6_20

Hazay, C., Mikkelsen, G. L., Rabin, T., Toft, T. & Nicolosi, A. A. (2019). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Journal of Cryptology, 32(2), 265-323. https://doi.org/10.1007/s00145-017-9275-7

Damgård, I. B. & Mikkelsen, G. L. (2010). Efficient, Robust and Constant-Round Distributed RSA Key Generation. Lecture Notes in Computer Science, 5978, 183-200. https://doi.org/10.1007/978-3-642-11799-2_12

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2020). Efficient pseudorandom correlation generators from ring-lpn. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 387-416). Springer. https://doi.org/10.1007/978-3-030-56880-1_14

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2019). Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In D. Micciancio & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings: CRYPTO 2019 (pp. 489-518). Springer. https://doi.org/10.1007/978-3-030-26954-8_16

Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P. & Troncoso-Pastoriza, J. R. (2020). Efficient protocols for oblivious linear function evaluation from ring-LWE. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 130-149). Springer. https://doi.org/10.1007/978-3-030-57990-6_7

Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P. & Troncoso-Pastoriza, J. R. (2022). Efficient protocols for oblivious linear function evaluation from ring-LWE. Journal of Computer Security, 30(1), 39-78. https://doi.org/10.3233/JCS-200116

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

Cramer, R., Damgård, I. B., Dziembowski, S., Hirt, M. & Rabin, T. (1999). Efficient Multiparty Computations Secure Against an Adaptive Adversary. In J. Stern (Ed.), Advances in Cryptology - EUROCRYPT '99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2-6, 1999 Proceedings (pp. 311-326). Springer. https://doi.org/10.1007/3-540-48910-X_22

Andrychowicz, M., Damgård, I. B., Dziembowski, S., Faust, S. & Polychroniadou, A. (2015). Efficient leakage resilient circuit compilers. In K. Nyberg (Ed.), Topics in Cryptology - CT-RSA 2015: The Cryptographer's Track at the RSA Conference 2015, San Francisco, CA, USA, April 20-24, 2015. Proceedings (pp. 311-329). Springer VS. https://doi.org/10.1007/978-3-319-16715-2_17

Abspoel, M., Cramer, R., Damgård, I. B., Escudero Ospina, D. E. & Yuan, C. (2019). Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. In D. Hofheinz & A. Rosen (Eds.), Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings: Proceedings (Vol. Part 1, pp. 471-501). Springer. https://doi.org/10.1007/978-3-030-36030-6_19

Aranha, D. F., Dahab, R., Lopez, J. & Oliveira, L. B. (2010). Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications, 4(2), 169-187. https://doi.org/10.3934/amc.2010.4.169

Baum, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2020). Efficient constant-round mpc with identifiable abort and public verifiability. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 562-592). Springer. https://doi.org/10.1007/978-3-030-56880-1_20

Damgård, I. B. (2000). Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In B. Preneel (Ed.), Advances in Cryptology - EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings (pp. 418-430). Springer. https://doi.org/10.1007/3-540-45539-6_30

Junio da Cruz, R., Guimaraes, A. & Aranha, D. F. (2020). Efficient and secure software implementations of Fantomas. Journal of Cryptographic Engineering, 10(3), 211–228. https://doi.org/10.1007/s13389-019-00218-2

Damgård, I. B., Krøigaard, M. & Geisler, M. J. (2007). Efficient and Secure Comparison for On-Line Auctions. In J. Pieprzyk, H. Ghodosi & E. Dawson (Eds.), Information Security and Privacy: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007. Proceedings (Vol. 4586, pp. 416-430). Springer. https://doi.org/10.1007/978-3-540-73458-1_30

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

Damgård, I. B. & Frandsen, G. S. (2003). Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers. In A. Lingas & B. J. Nilsson (Eds.), Fundamentals of Computation Theory (pp. 109-117). Springer. https://doi.org/10.1007/978-3-540-45077-1_11

Damgård, I. B. & Frandsen, G. S. (2005). Efficient algorithms for gcd and cubic residuosity in the ring of Eisenstein integers. Journal of Symbolic Computation, 39(6), 643-652. https://doi.org/10.1016/j.jsc.2004.02.006

Aranha, D. F., Bennedsen, E., Campanelli, M., Ganesh, C., Orlandi, C. & Takahashi, A. (2022). ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. 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 (pp. 584-614). Springer. https://doi.org/10.1007/978-3-030-97121-2_21

Loss, J. & Nielsen, J. B. (2024). Early Stopping for Any Number of Corruptions. In M. Joye & G. Leander (Eds.), Advances in Cryptology – EUROCRYPT 2024: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. III, pp. 457-488). Springer. https://doi.org/10.1007/978-3-031-58734-4_16

Cominetti, E., Simplicio, M., Aranha, D. F., Matias, P. & Araujo, R. (2026). E2Easy: a simple lattice-based in-person end-to-end voting scheme. In B. Haslhofer, J. Xu, F. Victor, M. Bartoletti, A. Bracciali, K. Matsuura, J. Nabrzyski, V. Estrada-Galiñanes, C. Tessone, J. Budurushi & K. Marky (Eds.), Financial Cryptography and Data Security. FC 2025 International Workshops - CoDecFin, FinTeAchin, VOTING, 2025, Revised Selected Papers (pp. 281-296). Springer. https://doi.org/10.1007/978-3-032-00495-6_16

Kolesnikov, V., Nielsen, J. B., Rosulek, M., Trieu, N. & Trifiletti, R. (2017). DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 3-20). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133991

Larsen, K. G., Obremski, M. & Simkin, M. (2023). Distributed Shuffling in Adversarial Environments. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.10

Burkhardt, J., Keller, H. J., Orlandi, C. & Schwiegelshohn, C. (2025). Distributed Differentially Private Data Analytics via Secure Sketching. In Forty-second International Conference on Machine Learning: ICML 2025 Article 10733 https://openreview.net/forum?id=2Snksn3U47

Abram, D., Scholl, P. & Yakoubov, S. (2022). Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 790-820). Springer. https://doi.org/10.1007/978-3-031-06944-4_27

Abram, D. (2024). Distributed (Correlation) Samplers: A Study on the Round Complexity of Cryptographic Sampling Protocols. [PhD thesis, Aarhus University]. Aarhus University.

Boyle, E., Kohl, L., Li, Z. & Scholl, P. (2025). Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. In K.-M. Chung & Y. Sasaki (Eds.), Advances in Cryptology – ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 266-298). Springer Nature. https://doi.org/10.1007/978-981-96-0938-3_9

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., Keller, H., Nelson, B., Orlandi, C. & Pagh, R. (2023). Differentially Private Selection from Secure Distributed Computing.

Canetti, R., Damgård, I. B., Kolby, S., Ravi, D. & Yakoubov, S. (2026). Deniable Secret Sharing. In 23rd International Conference, TCC 2025, proceedings Part II https://doi.org/10.1007/978-3-032-12293-3_13

Ciampi, M., Sternad, J. & Xia, Y. (2025). Delayed-Input Multi-party Computation. In M. Fischlin & V. Moonsamy (Eds.), Applied Cryptography and Network Security - 23rd International Conference, ACNS 2025, Proceedings (pp. 339–368) https://doi.org/10.1007/978-3-031-95761-1_12

Cramer, R., Damgård, I. B., Kiltz, E., Zakarias, S. N. H. & Zottarel, A. (2012). DDH-Like Assumptions Based on Extension Rings. Lecture Notes in Computer Science, 7293, 644-661 . https://doi.org/10.1007/978-3-642-30057-8_38

Cramer, R., Damgård, I. B., Kiltz, E., Zakarias, S. N. H. & Zottarel, A. (2011). DDH-like Assumptions Based on Extension Rings. http://eprint.iacr.org/2011/280

Damgård, I. B., Knudsen, L. & Thomsen, S. S. (2008). Dakota- Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography. Lecture Notes in Computer Science, 144-155. https://doi.org/10.1007/978-3-540-68914-0_9

Amores Sesar, I., Grøndal, V. H., Holmgård, A. & Ottendal, M. (2025). DAG It Off: Latency Prefers No Common Coins. In 39th International Symposium on Distributed Computing (DISC 2025)

Amores Sesar, I., Cachin, C., Villacis, J. & Zanolini, L. (2025). DAG-based Consensus with Asymmetric Trust. In PODC '25: Proceedings of the ACM Symposium on Principles of Distributed Computing

Surita, R. C., Cortes, M. L., Aranha, D. F. & Araujo, G. (2016). Cylindrical Reconvergence Physical Unclonable Function. In Proceedings - 19th Euromicro Conference on Digital System Design, DSD 2016 (pp. 446-453). Article 7723585 https://doi.org/10.1109/DSD.2016.100

Campanelli, M., Hall-Andersen, M. N. & Kamp, S. H. (2023). Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. In J. Calandrino & C. Troncoso (Eds.), SEC '23: Proceedings of the 32nd USENIX Conference on Security Symposium (pp. 4391–4408). Article 246 Association for Computing Machinery. https://doi.org/10.5555/3620237.3620483

Fujii, H. & Aranha, D. F. (2017). Curve25519 for the Cortex-M4 and beyond. In 5th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT 2017)

Damgård, I. B., Salvail, L., Schaffner, C. & Fehr, S. (2005). Cryptography In The Bounded Quantum-Storage Model. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (pp. 449-458). IEEE. https://doi.org/10.1109/SFCS.2005.30

Damgård, I. B., Serge, F., Schaffner, C. & Salvail, L. (2008). Cryptography in the Bounded Quantum-Storage Model. S I A M Journal on Computing, 37(6), 1865-1890. https://doi.org/10.1137/060651343

Abram, D., Beimel, A., Ishai, Y., Kushilevitz, E. & Narayanan, V. (2023). Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. 286-315. Paper presented at Theory of Cryptography. TCC 2023, Taipei, Taiwan. https://doi.org/10.1007/978-3-031-48615-9_11

Displaying results 451 to 500 out of 619

Revised 26.01.2026

Marianne Dammand Iversen