Publications

List of publications

Sort by: Date | Author | Title

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

Cramer, R. & Damgård, I. B. (1997). Linear zero-knowledge-a note on efficient zero-knowledge proofs and arguments. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (pp. 436-445). Association for Computing Machinery. https://doi.org/10.1145/258533.258635

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

Cramer, R., Damgård, I. B. & Dziembowski, S. (2000). On the complexity of verifiable secret sharing and multiparty computation. In Proceedings of the thirty-second annual ACM symposium on Theory of computing (pp. 325-334). Association for Computing Machinery. https://doi.org/10.1145/335305.335343

Cramer, R., Damgård, I. B. & MacKenzie, P. (2000). Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions. In H. Imai & Y. Zheng (Eds.), Public Key Cryptography: Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings (pp. 354-373). Springer. https://doi.org/10.1007/978-3-540-46588-1_24

Cramer, R., Damgård, I. B. & Maurer, U. (2000). General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. 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. 316-334). Springer. https://doi.org/10.1007/3-540-45539-6_22

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

Cramer, R., Damgård, I. B. & Pastro, V. (2011). On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. http://eprint.iacr.org/2011/301

Cramer, R., Damgård, I. B. & Pastro, V. (2012). On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. Lecture Notes in Computer Science, 7412, 62-79 . https://doi.org/10.1007/978-3-642-32284-6_4

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. & Keller, M. (2014). On the Amortized Complexity of Zero-Knowledge Protocols. Journal of Cryptology, 27(2), 284-316. https://doi.org/10.1007/s00145-013-9145-x

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. B. & Nielsen, J. B. (2015). Secure Multiparty Computation and Secret Sharing. Cambridge University Press.

Cramer, R., Damgård, I. B., Döttling, N., Giacomelli, I. & Xing, C. (2016). Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. (pp. 1-31). Cryptology ePrint Archive. http://ia.cr/2016/397

Cramer, R., Damgård, I., Xing, C. & Yuan, C. (2017). Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack. 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, Proceedings (Vol. 10210, pp. 479-500). Springer VS. https://doi.org/10.1007/978-3-319-56620-7_17

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Ζ₂k: Efficient MPC mod 2^k 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

Couteau, G., Bui, D. & Melissaris Papanikolaou, N. (2024). Structured-Seed Local Pseudorandom Generators and their Applications. https://eprint.iacr.org/2024/1027

Costa Lopes, A. & Aranha, D. F. (2017). Platform-agnostic Low-intrusion Optical Data Exfiltration. In P. Mori, S. Furnell & O. Camp (Eds.), ICISSP 2017 - Proceedings of the 3rd International Conference on Information Systems Security and Privacy (Vol. 1, pp. 474-480) https://doi.org/10.5220/0006211504740480

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. & Orlandi, C. (2018). Combining Private Set-Intersection with Secure Two-Party Computation. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 464-482). Springer VS. https://doi.org/10.1007/978-3-319-98113-0

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

Chou, T. & Orlandi, C. (2015). The simplest protocol for oblivious transfer. In K. Lauter & F. Rodríguez-Henríquez (Eds.), Progress in Cryptology - LATINCRYPT 2015: 4th International Conference on Cryptology and Information Security in Latin America, Guadalajara, Mexico, August 23-26, 2015, Proceedings (Vol. 9230, pp. 40-58). Springer. https://doi.org/10.1007/978-3-319-22174-8_3

Chou, T. & Orlandi, C. (2015). The Simplest Protocol for Oblivious Transfer. http://eprint.iacr.org/2015/267

Displaying results 351 to 400 out of 567

Revised 07.03.2025

Marianne Dammand Iversen