Publications

List of publications

Sort by: Date | Author | Title

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, pp. V-VI). 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

Constantin-Sukul, L. R. J., Ø. Gammelgaard, R., Henriksen, A. & Aranha, D. F. (2025). Key recovery on static Kyber based on transient execution attacks. In Proceedings of the 1st Microarchitecture Security Conference https://doi.org/10.46586/uasc.2025.006

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

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

Cohen, R., Doerner, J., Lee, E., Lysyanskaya, A. & Roy, L. (2026). An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast. In B. Applebaum & H. Lin (Eds.), Theory of Cryptography - 23rd International Conference, TCC 2025, Proceedings (pp. 675-708). Springer. https://doi.org/10.1007/978-3-032-12290-2_22

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

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

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

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

Chiang, J. H. Y., David, B., Eyal, I. & Gong, T. (2023). FairPoS: Input Fairness in Permissionless Consensus. In J. Bonneau & S. M. Weinberg (Eds.), 5th Conference on Advances in Financial Technologies, AFT 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.10

Chiang, J. H. Y., David, B., Gama, M. & Lebeda, C. J. (2023). Correlated-Output Differential Privacy and Applications to Dark Pools. In J. Bonneau & S. M. Weinberg (Eds.), 5th Conference on Advances in Financial Technologies, AFT 2023 Article 11 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.11

Chiang, J. H. Y., Damgård, I., Duro, W. R., Engan, S., Kolby, S. & Scholl, P. (2025). Post-Quantum Threshold Ring Signature Applications from VOLE-in-the-Head. In CCS 2025 - Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security (pp. 4664-4678). Association for Computing Machinery. https://doi.org/10.1145/3719027.3744854

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

Chen, L. & Damgård, I. B. (1993). Security Bounds for Parallel Versions of Identification Protocols (extended abstract). In R. A. Rueppel (Ed.), Advances in Cryptology - EUROCRYPT' 92: Workshop on the Theory and Application of Cryptographic Techniques Balatonfüred, Hungary, May 24-28, 1992 Proceedings (pp. 461-466). Springer. https://doi.org/10.1007/3-540-47555-9_40

Chen, L., Damgård, I. B. & Pedersen, T. P. (1995). Parallel divertibility of proofs of knowledge (Extended abstract). In A. De Santis (Ed.), Advances in Cryptology - EUROCRYPT'94: Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, May 9-12, 1994 Proceedings (pp. 140-155). Springer. https://doi.org/10.1007/BFb0053431

Chaum, D., Crépeau, C. & Damgård, I. B. (1987). Multiparty Unconditionally Secure Protocols (Abstract). In C. Pomerance (Ed.), Advances in Cryptology - CRYPTO '87: Proceedings (pp. 462). Springer. https://doi.org/10.1007/3-540-48184-2_43

Chaum, D., Damgård, I. B. & van der Graaf, J. (1987). Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result. In C. Pomerance (Ed.), Advances in Cryptology - CRYPTO '87: Proceedings (pp. 87-119). Springer. https://doi.org/10.1007/3-540-48184-2_7

Chaum, D., Crépeau, C. & Damgård, I. B. (1988). Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM symposium on Theory of computing (pp. 11-19). Association for Computing Machinery. https://doi.org/10.1145/62212.62214

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. E. & Naserasr, R. (2024). A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. 167–199. Abstract from Theory of Cryptography, Milan, Italy. https://eprint.iacr.org/2024/1473

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+Business Media. https://doi.org/10.1007/978-3-031-78023-3_6

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

Chakraborty, S., Magri, B., Nielsen, J. B. & Venturi, D. (2022). Universally Composable Subversion-Resilient Cryptography. 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. 272-302). Springer. https://doi.org/10.1007/978-3-031-06944-4_10

Cascudo Pueyo, I., Damgård, I. B. & Ranellucci, S. (2014). Server-Aided Two-Party Computation with Simultaneous Corruption. (pp. 18). Cryptology ePrint Archive. Report / Cryptology ePrint Archive No. 2014/809 http://eprint.iacr.org/2014/809.pdf

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., Lacerda, F. & Ranellucci, S. (2016). Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement. In Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (Vol. 9985, pp. 204-234). Springer VS. https://doi.org/10.1007/978-3-662-53641-4_9

Displaying results 401 to 450 out of 626

Revised 26.01.2026

Marianne Dammand Iversen