Publications

List of publications

Sort by: Date | Author | Title

Cascudo, I., Damgård, I., David, B., Döttling, N., Dowsley, R. & Giacomelli, I. (2019). Efficient UC Commitment Extension with Homomorphism for Free (and Applications). In S. D. Galbraith & S. Moriai (Eds.), Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 606-635). Springer. https://doi.org/10.1007/978-3-030-34621-8_22

Canetti, R., Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2004). Adaptive versus Non-Adaptive Security of Multi-Party Protocols. Journal of Cryptology, 17(3), 153-207. https://doi.org/10.1007/s00145-004-0135-x

Canetti, R., Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2001). On Adaptive vs. Non-adaptive Security of Multiparty Protocols. 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. 262-279). Springer. https://doi.org/10.1007/3-540-44987-6_17

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

Canetti, R., Kolby, S., Ravi, D., Soria Vazquez, E. & Yakoubov, S. (2023). Taming Adaptivity in YOSO Protocols: The Modular Way. In G. Rothblum & H. Wee (Eds.), Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II (Vol. 2, pp. 33-62). Springer. https://doi.org/10.1007/978-3-031-48618-0_2

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

Campanelli, M. & Khoshakhlagh, H. (2021). Succinct Publicly-Certifiable Proofs: Or, Can a Blockchain Verify a Designated-Verifier Proof? In A. Adhikari, R. Küsters & B. Preneel (Eds.), Progress in Cryptology – INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, 2021, Proceedings: 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings (pp. 607-631). Springer. https://doi.org/10.1007/978-3-030-92518-5_27

Campanelli, M., Engelmann, F. & Orlandi, C. (2022). Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks (pp. 761-784). Springer. https://doi.org/10.1007/978-3-031-14791-3_33

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

Campanelli, M., Francati, D. & Orlandi, C. (2023). Structure-Preserving Compilers from New Notions of Obfuscations. In A. Boldyreva & V. Kolesnikov (Eds.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part II (pp. 663-693). Springer. https://doi.org/10.1007/978-3-031-31371-4_23

Camenisch, J. & Damgård, I. B. (2000). Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes (Extended Abstract). In T. Okamoto (Ed.), Advances in Cryptology - ASIACRYPT 2000: 6th International Conference on the Theory and Application of Cryptology and Information Security Kyoto, Japan, December 3-7, 2000 Proceedings (pp. 331-345). Springer. https://doi.org/10.1007/3-540-44448-3_25

Burra, S. S., Larraia, E., Nielsen, J. B., Nordholt, P. S., Orlandi, C., Orsini, E., Scholl, P. & Smart, N. P. (2015). High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. http://eprint.iacr.org/2015/472

Burra, S. S., Larraia, E., Nielsen, J. B., Nordholt, P. S., Orlandi, C., Orsini, E., Scholl, P. & Smart, N. P. (2021). High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. Journal of Cryptology, 34(3), Article 34. https://doi.org/10.1007/s00145-021-09403-1

Burkhardt, J., Damgård, I., Frederiksen, T. K., Orlandi, C. & Ghosh, S. (2023). Improved Distributed RSA Key Generation Using the Miller-Rabin Test. In W. Meng, C. D. Jensen, C. Cremers & E. Kirda (Eds.), CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 2501-2515). Association for Computing Machinery. https://doi.org/10.1145/3576915.3623163

Burkhardt, J., Caragiannis, I., Fehrs, K., Russo, M., Schwiegelshohn, C. & Shyam, S. (2024). Low-Distortion Clustering with Ordinal and Limited Cardinal Information. Proceedings of the AAAI Conference on Artificial Intelligence, 38(9), 9555-9563. https://doi.org/10.1609/aaai.v38i9.28811

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

Bui, D., Couteau, G., Meyer, P., Passelègue, A. & Riahinia, M. (2024). Fast Public-Key Silent OT and More from Constrained Naor-Reingold. In M. Joye & G. Leander (Eds.), Advances in Cryptology – EUROCRYPT 2024 (pp. 88-118). Springer. https://doi.org/10.1007/978-3-031-58751-1_4

B. S. Reis, T., Aranha, D. F. & Lopez, J. (2017). PRESENT Runs Fast: Efficient and Secure Implementation in Software. In W. Fischer & N. Homma (Eds.), Cryptographic Hardware and Embedded Systems – CHES 2017 - 19th International Conference, Proceedings: 19th International Conference, Taipei, Taiwan, September 25-28, 2017, Proceedings (pp. 644-664). Springer. https://doi.org/10.1007/978-3-319-66787-4_31

Brzuska, C., Couteau, G., Egger, C., Karanko, P. & Meyer, P. E. (2024). Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs. In C. Galdi & D. Hieu Phan (Eds.), Security and Cryptography for Networks - 14th International Conference, SCN 2024, Proceedings (pp. 97–116). Springer Nature. https://doi.org/10.1007/978-3-031-71073-5_5

Brickell, E. F., Chaum, D., Damgård, I. B. & van der Graaf, J. (1987). Gradual and Verifiable Release of a Secret (Extended Abstract). In C. Pomerance (Ed.), Advances in Cryptology - CRYPTO '87: Proceedings (pp. 156-166). Springer. https://doi.org/10.1007/3-540-48184-2_11

Brian, G., Faonio, A., Obremski, M., Simkin, M. & Venturi, D. (2020). Non-malleable secret sharing against bounded joint-tampering attacks in the plain model. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 127-155). Springer. https://doi.org/10.1007/978-3-030-56877-1_5

Brian, G., Faonio, A., Obremski, M., Ribeiro, J., Simkin, M., Skorski, M. & Venturi, D. (2022). The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Transactions on Information Theory, 68(12), 8197-8227. https://doi.org/10.1109/TIT.2022.3193848

Braun, L., Cammarota, R. & Schneider, T. (2021). A Generic Hybrid 2PC Framework with Application to Private Inference of Unmodified Neural Networks: Extended Abstract. Poster session presented at Privacy in Machine Learning.

Braun, L., Demmler, D., Schneider, T. & Tkachenko, O. (2022). MOTION – A Framework for Mixed-Protocol Multi-Party Computation. ACM Transactions on Privacy and Security, 25(2), Article 8. https://doi.org/10.1145/3490390

Braun, L., Huppert, M., Khayata, N., Schneider, T. & Tkachenko, O. (2023). FUSE - Flexible File Format and Intermediate Representation for Secure Multi-Party Computation. In J. Liu, Y. Xiang, S. Nepal & G. Tsudik (Eds.), ASIA CCS 2023 - Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security (pp. 649-663). Association for Computing Machinery. https://doi.org/10.1145/3579856.3590340

Braun, L., Damgård, I. B. & Orlandi, C. (2023). Secure Multiparty Computation from Threshold Encryption Based on Class Groups. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology: CRYPTO 2023 (pp. 613-645). Springer. https://doi.org/10.1007/978-3-031-38557-5_20

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

Braun, L., Delpech de Saint Guilhem, C., Jadoul, R., Orsini, E., Smart, N. P. & Tanguy, T. (2023). ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for Z2k. In E. A. Quaglia (Ed.), Cryptography and Coding - 19th IMA International Conference, IMACC 2023, London, UK, December 12-14, 2023, Proceedings (Vol. 14421, pp. 137-157). Springer, Cham. https://doi.org/10.1007/978-3-031-47818-58

Braun, L., Castagnos, G., Damgård, I. B., Laguillaumie, F., Melissaris, K., Orlandi, C. & Tucker, I. (2024). An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. https://eprint.iacr.org/2024/717

Braun, L., Gascón, A., Raykova, M., Schoppmann, P. & Seth, K. (2024). Malicious Security for Sparse Private Histogram. https://eprint.iacr.org/2024/469

Braun, L., Castagnos, G., Damgård, I., Laguillaumie, F., Melissaris, K., Orlandi, C. & Tucker, I. (2024). An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. In C. Galdi & D. H. Phan (Eds.), Security and Cryptography for Networks - 14th International Conference, SCN 2024, Amalfi, Italy, September 11-13, 2024, Proceedings, Part II (pp. 24-46). Springer. https://doi.org/10.1007/978-3-031-71073-5_2

Braun, L. (2024). Cryptography After Prime Time. [PhD thesis, Aarhus University]. Aarhus University.

Braun, L., Castagnos, G., Damgård, I., Laguillaumie, F., Melissaris, K., Orlandi, C. & Tucker, I. (2025). An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. Cryptography and Communications, 17(5), 1367-1406. https://doi.org/10.1007/S12095-025-00826-2

Brassard, G. & Damgård, I. B. (1990). "Practical IP" <- MA. In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 580-582). Springer. https://doi.org/10.1007/0-387-34799-2_42

Branzei, S., Orlandi, C. & Yang, G. (2019). Sharing Information with Competitors. In D. Fotakis & E. Markakis (Eds.), Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Proceedings: SAGT 2019 (pp. 34-48). Springer. https://doi.org/10.1007/978-3-030-30473-7

Brandt, J., Damgård, I. B. & Landrock, P. (1993). Speeding up prime number generation. In Advances in cryptology - ASIACRYPT '91 (pp. 440-449). Springer. https://doi.org/10.1007/3-540-57332-1

Brandt, J., Damgård, I. B., Landrock, P. & Pedersen, T. (1998). Zero-knowledge authentication scheme with secret key exchange. Journal of Cryptology, 11(3), 147-159. https://doi.org/10.1007/s001459900041

Brandt, J. & Damgård, I. B. (1993). On generation of probable primes by incremental search. In Advances in cryptology - CRYPTO '92 (pp. 358-370). Springer.

Brandt, J., Damgård, I. B. & Landrock, P. (1988). Anonymous and verifiable registration in databases. In Advances in cryptology - EUROCRYPT '88 (pp. 167-176). Springer. https://doi.org/10.1007/3-540-45961-8_14

Brandt, J., Damgård, I. B., Landrock, P. & Pedersen, T. P. (1988). Zero-Knowledge Authentication Scheme with Secret Key Exchange (extended abstract). In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 583-588). Springer. https://doi.org/10.1007/0-387-34799-2_43

Brandt, M., Orlandi, C., Shrishak, K. & Shulman, H. (2020). Optimal Transport Layer for Secure Computation. In P. Samarati, S. D. C. D. Vimercati, M. S. Obaidat & J. Ben-Othman (Eds.), ICETE 2020 - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications (Vol. Volume 3: SECRYPT, pp. 130-141). SCITEPRESS Digital Library. https://doi.org/10.5220/0009826801300141

Boyle, E., Kohl, L. & Scholl, P. (2019). Homomorphic Secret Sharing from Lattices Without FHE. In Y. Ishai & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings: EUROCRYPT 2019 (pp. 3-33). Springer VS. https://doi.org/10.1007/978-3-030-17656-3_1

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

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P. & Scholl, P. (2019). Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In L. Cavallaro, J. Kinder, X. Wang & J. Katz (Eds.), CCS 2019 - Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (pp. 291-308). Association for Computing Machinery. https://doi.org/10.1145/3319535.3354255

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. (2020). Correlated Pseudorandom Functions from Variable-Density LPN. In S. Irani (Ed.), Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 1069-1080). Article 9317926 IEEE. https://doi.org/10.1109/FOCS46700.2020.00103

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2021). Low-Complexity Weak Pseudorandom Functions in textdollartextbackslashmathtt AC0[textbackslashmathtt MOD2]textdollar. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV (pp. 487-516). Springer. https://doi.org/10.1007/978-3-030-84259-8_17

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2022). Correlated Pseudorandomness from Expand-Accumulate Codes. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 603-633). Springer. https://doi.org/10.1007/978-3-031-15979-4_21

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2023). Oblivious Transfer with Constant Computational Overhead. 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 I (pp. 271-302). Springer. https://doi.org/10.1007/978-3-031-30545-0_10

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

Displaying results 451 to 500 out of 619

Revised 26.01.2026

Marianne Dammand Iversen