Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. (1994). Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract). In D. R. Stinson (Ed.), Advances in Cryptology - CRYPTO' 93: 13th Annual International Cryptology Conference Santa Barbara, California, USA August 22-26, 1993 Proceedings (pp. 100-109). Springer. https://doi.org/10.1007/3-540-48329-2_9

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

Kolby, S., Roy, L. D., Sternad, J. & Yakoubov, S. (2025). Information-Theoretic Random-Index PIR. In N. Gilboa (Ed.), 6th Conference on Information-Theoretic Cryptography (ITC 2025) (pp. 5:1-5:15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2025.5

Yakoubov, S., Damgård, I. B., Siniscalchi, L., Ravi, D. & Ciampi, M. (2025). Information-Theoretic Broadcast-Optimal MPC. In Theory of Cryptography Conference (TCC 2025) https://doi.org/10.1007/978-3-032-12287-2_6

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., Fehr, S., Lunemann, C., Salvail, L. & Schaffner, C. (2009). Improving the Security of Quantum Protocols via Commit-and-Open. Lecture Notes in Computer Science, 408-427. https://doi.org/10.1007/978-3-642-03356-8_24

Aranha, D. F., Dalskov, A., Orlandi, C. & Escudero Ospina, D. E. (2021). Improved Threshold Signatures, Proactive Secret Sharing and Input Certification from LSS Isomorphisms. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 382-404). Springer. https://doi.org/10.1007/978-3-030-88238-9_19

Obremski, M., Ribeiro, J., Roy, L., Standaert, F.-X. & Venturi, D. (2024). Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. In L. Reyzin & D. Stebila (Eds.), Advances in Cryptology -- CRYPTO 2024 (pp. 461-491). Springer Nature. https://doi.org/10.1007/978-3-031-68391-6_14

Escudero, D., Ghosh, S., Keller, M., Rachuri, R. & Scholl, P. (2020). Improved primitives for mpc over mixed arithmetic-binary circuits. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 823-852). Springer. https://doi.org/10.1007/978-3-030-56880-1_29

Damgård, I. B. & Nielsen, J. B. (2000). Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In M. Bellare (Ed.), Advances in Cryptology - CRYPTO 2000: 20th Annual International Cryptology Conference Santa Barbara, California, USA, August 20-24, 2000 Proceedings (pp. 432-450). Springer. https://doi.org/10.1007/3-540-44598-6_27

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

Aranha, D. F., Fuentes-Castañeda, L., Knapp, E., Menezes, A. & Rodriguez-Henriquez, F. (2013). Implementing Pairings at the 192-Bit Security Level. In M. Abdalla & T. Lange (Eds.), Pairing-Based Cryptography – Pairing 2012 (pp. 177-195). Springer. https://doi.org/10.1007/978-3-642-36334-4_11

Damgård, I. B., Keller, M., Keller, E., Miles, C. & Smart, N. P. (2012). Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol. Lecture Notes in Computer Science, 7485, 241-263. https://doi.org/10.1007/978-3-642-32928-9_14

Aranha, D. F. & Medwed, M. (2023). IACR Transactions on Cryptographic Hardware and Embedded Systems. Ruhr Universität Bochum. IACR Transactions of Cryptographic Hardware and Embedded Systems Vol. 2023 No. 1-4 https://tches.iacr.org/index.php/TCHES/issue/view/312

Damgård, I. B., Fitzi, M., Nielsen, J. B. & Toft, T. (2005). How to Split a Shared Secret into Shared Bits in Constant-Round. Cryptology ePrint Archive. http://eprint.iacr.org/2005/140.pdf

Fitzi, M., Nielsen, J. B. & Wolf, S. (2007). How to Share a Key (Invited paper). Paper presented at 45th Annual Allerton Conference on Communication, Control, and Computing, 2007, Urbana-Champaign, United States.

Damgård, I. B., Pedersen, T. B. & Salvail, L. (2014). How to re-use a one-time pad safely and almost optimally even if P = NP. Natural Computing, 13(4), 469-486. https://doi.org/10.1007/s11047-014-9454-5

Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016). How to prove knowledge of small secrets. In J. Katz & M. Robshaw (Eds.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_17

Fleischhacker, N., Larsen, K. G. & Simkin, M. (2023). How to Compress Encrypted Data. 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. 551-577). Springer. https://doi.org/10.1007/978-3-031-30545-0_19

Jakobsen, S. K. & Orlandi, C. (2016). How To Bootstrap Anonymous Communication. In ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (pp. 333-344). Association for Computing Machinery. https://doi.org/10.1145/2840728.2840743

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://arxiv.org/pdf/1502.05273v1

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://eprint.iacr.org/2015/130

Damgård, I. B., Goldreich, O., Okamoto, T. & Wigderson, A. (1995). Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. In D. Coppersmith (Ed.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (pp. 325-338). Springer. https://doi.org/10.1007/3-540-44750-4_26

Agarwal, A., Bienstock, A., Damgård, I. & Escudero, D. (2025). Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication. 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. 234-265). Springer Nature. https://doi.org/10.1007/978-981-96-0938-3_8

Neumann, L., Guimaraes, A., Aranha, D. F. & Borin, E. (2024). Homomorphic WiSARDs: Efficient Weightless Neural Network training over encrypted data. Abstract from 4th Workshop on Artificial Intelligence and Cryptography, Zurich, Switzerland. https://arxiv.org/abs/2403.20190

Neumann, L., Guimaraes, A., Aranha, D. F. & Borin, E. (2025). Homomorphic WiSARDs: Efficient Weightless Neural Network training over encrypted data. In M. Fischlin & V. Moonsamy (Eds.), Applied Cryptography and Network Security - 23rd International Conference, ACNS 2025, Proceedings (pp. 309-338) https://doi.org/10.1007/978-3-031-95767-3_12

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

Guimaraes, A., Neumann, L., Andaló, F. A., Aranha, D. F. & Borin, E. (2022). Homomorphic evaluation of large look-up tables for inference on human genome data in the cloud. In Proceedings - 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing Workshops, SBAC-PADW 2022 (pp. 33-38). IEEE. https://doi.org/10.1109/SBAC-PADW56527.2022.00015

Damgård, I. B., Geisler, M. & Krøigaard, M. (2008). Homomorphic encryption and secure comparison. International Journal of Applied Cryptography, 1(1), 22-31. https://doi.org/10.1504/IJACT.2008.017047

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). High-Speed Parallel Software Implementation of the ηT Pairing. In J. Pieprzyk (Ed.), Topics in Cryptology - CT-RSA 2010 (pp. 89-105). Springer. https://doi.org/10.1007/978-3-642-11925-5_7

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

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from The Coq Workshop 2020. https://coq-workshop.gitlab.io/2020/abstracts/Coq2020_04-02-primes.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from 2nd Workshop on Formal Methods for Blockchains. https://fmbc.gitlab.io/2020/files/FMBC2020.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2023). High-assurance field inversion for curve-based cryptography. In 2023 IEEE 36th Computer Security Foundations Symposium (CSF) (pp. 552-567). IEEE. https://doi.org/10.1109/CSF57540.2023.00008

Lindell, Y., Nissim, K. & Orlandi, C. (2013). Hiding the Input-Size in Secure Two-Party Computation. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (Vol. 8197, pp. 421-440). Springer VS. https://doi.org/10.1007/978-3-642-41019-2_6

Aranha, D. F., Costache, A., Guimaraes, A. & Soria-Vazquez, E. (2025). HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical. 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 (Vol. V, pp. 302-334). Springer. https://doi.org/10.1007/978-981-96-0935-2_10

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

Aranha, D. F., Fouque, P.-A., Gerard, B., Kammerer, J.-G., Tibouchi, M. & Zapalowicz, J.-C. (2014). GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias. In P. Sarkar & T. Iwata (Eds.), Advances in Cryptology – ASIACRYPT 2014 (pp. 262-281). Springer. https://doi.org/10.1007/978-3-662-45611-8_14

Zhao, Y., Nielsen, J. B., Deng, R. H. & Feng, D. (2005). Generic yet Practical ZK Arguments from any Public-Coin HVZK. Electronic Colloquium on Computational Complexity, (TR05-162), 1-16.

Damgård, I. B. & Koprowski, M. (2002). Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. In L. R. Knudsen (Ed.), Advances in Cryptology - EUROCRYPT 2002: International Conference on the Theory and Applications of Cryptographic Techniques Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings (pp. 256-271). Springer. https://doi.org/10.1007/3-540-46035-7_17

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

David, B., Magri, B., Matt, C., Nielsen, J. B. & Tschudi, D. (2022). GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy. In CCS'22 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 683-696). Association for Computing Machinery. https://doi.org/10.1145/3548606.3559375

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

van Baarsen, A. N. & Pu, S. (2026). Fuzzy Private Set Intersection from VOLE. In G. Hanaoka & B.-Y. Yang (Eds.), Advances in Cryptology – ASIACRYPT 2025 : 31st International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, December 8–12, 2025, Proceedings, Part V (pp. 327-360) https://doi.org/10.1007/978-981-95-5116-3_11

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

Lunemann, C. & Nielsen, J. B. (2011). Fully simulatable quantum-secure coin-flipping and applications. Lecture Notes in Computer Science, 6737, 21-40. https://doi.org/10.1007/978-3-642-21969-6_2

Faonio, A., Nielsen, J. B. & Venturi, D. (2017). Fully Leakage-resilient Signatures Revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model. Theoretical Computer Science, 660(C), 23-56. https://doi.org/10.1016/j.tcs.2016.11.016

Faonio, A. & Nielsen, J. B. (2017). Fully Leakage-Resilient Codes. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10174, pp. 333-358). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_14

Damgård, I. B., Geisler, M. & Nielsen, J. B. (2010). From Passive to Covert Security at Low Cost. Lecture Notes in Computer Science, 5978, 128-145. https://doi.org/10.1007/978-3-642-11799-2_9

Displaying results 351 to 400 out of 612

8

Revised 14.01.2026

-

Marianne Dammand Iversen