Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. (1993). Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Preprocessing. 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. 341-355). Springer. https://doi.org/10.1007/3-540-47555-9_28

Damgård, I. B. & Groth, J. (2003). Non-interactive and Reusable Non-malleable Commitment Schemes. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (pp. 426-437). Association for Computing Machinery. https://doi.org/10.1145/780542.780605

Nielsen, J. B. (2001). Non-Committing Encryption is Too Easy in the Random Oracle Model. BRICS Report Series, (RS-01-47).

Matias, P., Y. S. Barbosa, P., N. C. Cardoso, T., Mariano, D. & Aranha, D. F. (2019). NIZKCTF: A Non-Interactive Zero-Knowledge Capture the Flag Platform. IEEE Security & Privacy, 16(6), 42-51. Article 8636460. https://doi.org/10.1109/MSEC.2018.2875324

Ganesh, C., Khoshakhlagh, H. & Parisella, R. (2022). NIWI and New Notions of Extraction for Algebraic Languages. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 687-710). Springer. https://doi.org/10.1007/978-3-031-14791-3_30

Damgård, I. B., Escudero Ospina, D. E., Frederiksen, T. K., Keller, M., Scholl, P. & Volgushev, N. (2019). New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. In Proceedings - 2019 IEEE Symposium on Security and Privacy, SP 2019 (pp. 1102-1120). Article 8835310 IEEE. https://doi.org/10.1109/SP.2019.00078

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

Damgård, I. B. & Pedersen, T. P. (1996). New Convertible Undeniable Signature Schemes. In U. Maurer (Ed.), Advances in Cryptology - EUROCRYPT '96: International Conference on the Theory and Application of Cryptographic Techniques Saragossa, Spain, May 12-16, 1996 Proceedings (pp. 372-386). Springer. https://doi.org/10.1007/3-540-68339-9_32

Damgård, I. B. & Knudsen, L. R. (1996). Multiple encryption with minimum key. In E. Dawson & J. Golic (Eds.), Cryptography: Policy and Algorithms: International Conference Brisbane, Queensland, Australia, July 3-5, 1995 Proceedings (pp. 156-164). Springer. https://doi.org/10.1007/BFb0032355

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., 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

Scholl, P., Simkin, M. & Siniscalchi, L. (2022). Multiparty Computation with Covert Security and Public Verifiability. In D. Dachman-Soled (Ed.), 3rd Conference on Information-Theoretic Cryptography, ITC 2022 Article 8 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2022.8

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

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

Damgård, I. B., Pastro, V., Smart, N. & Zakarias, S. N. H. (2011). Multiparty Computation from Somewhat Homomorphic Encryption. http://eprint.iacr.org/2011/535

Damgård, I. B., Pastro, V., Smart, N. & Zakarias, S. N. H. (2012). Multiparty computation from somewhat homomorphic encryption. Lecture Notes in Computer Science, 7417, 643-662. https://doi.org/10.1007/978-3-642-32009-5_38

Damgård, I. B. & Orlandi, C. (2010). Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. Lecture Notes in Computer Science, 6223, 558-576. https://doi.org/10.1007/978-3-642-14623-7_30

Hasler, S., Reisert, P., Rivinius, M. & Küsters, R. (2024). Multipars: Reduced-Communication MPC over Z2k. Proceedings on Privacy Enhancing Technologies, (2), 5-28. https://doi.org/10.56553/popets-2024-0038

Hasler, S., Reisert, P., Rivinius, M. & Küsters, R. (2023). Multipars: Reduced-Communication MPC over Z2k. https://eprint.iacr.org/2023/1932

Yakoubov, S., Pagnin, E. & Kolby, S. (2024). Multi Designated Verifier Ring Signatures. IACR Communications in Cryptology, 1(3). https://doi.org/10.62056/a33zivrzn

Keller, H., Orlandi, C., Paskin-Cherniavsky, A. & Ravi, D. (2023). MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 11:1-11:22). Article 11 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.11

Baum, C., Braun, L., Munch-Hansen, A. & Scholl, P. (2022). MozZ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs over Z2k. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 329-358). Springer. https://doi.org/10.1007/978-3-031-15985-5_12

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

Guimaraes, A., Borin, E. & Aranha, D. F. (2022). MOSFHET: Optimized Software for FHE over the Torus. Abstract from 5th Homomorphic Encryption Standards Meeting, Geneva, Switzerland.

Guimaraes, A., Borin, E. & Aranha, D. F. (2024). MOSFHET: Optimized Software for FHE over the Torus. Journal of Cryptographic Engineering, 14(3), 577-593. https://doi.org/10.1007/s13389-024-00359-z

Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S. & Peikert, C. (2018). More Efficient Commitments from Structured Lattice Assumptions. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 368-385). Springer VS. https://doi.org/10.1007/978-3-319-98113-0_20

Damgård, I. B., Li, B. & Schwartzbach, N. I. (2021). More communication lower bounds for information-theoretic MPC. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2021.2

Boudgoust, K. & Keller, H. (2025). Module Learning with Errors with Truncated Matrices. In R. Niederhagen & M.-J. O. Saarinen (Eds.), Post-Quantum Cryptography - 16th International Workshop, PQCrypto 2025, Proceedings (Vol. Part 1, pp. 255-277). Springer. https://doi.org/10.1007/978-3-031-86599-2_9

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

Frederiksen, T. K., Jakobsen, T. P., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2013). MiniLEGO: Efficient secure two-party computation from general assumptions. In T. Johansson & P. Q. Nguyen (Eds.), Advances in Cryptology – EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings (pp. 537-556). Springer VS. https://doi.org/10.1007/978-3-642-38348-9_32

Faonio, A., Nielsen, J. B. & Venturi, D. (2015). Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation. In M. M. Halldórsson, K. Iwama, N. Kobayashi & B. Speckmann (Eds.), Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (Vol. Part 1, pp. 456-468). Springer VS. https://doi.org/10.1007/978-3-662-47672-7_37

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

Ghosh, S., Nielsen, J. B. & Nilges, T. (2017). Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Vol. 10624, pp. 629-659). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_22

Morita, H., Pohle, E., Sadakane, K., Scholl, P., Tozawa, K. & Tschudi, D. (2025). MAESTRO: Multi-Party AES Using Lookup Tables. In Proceedings of the 34th USENIX Security Symposium (pp. 1965-1984). USENIX - The Advanced Computing Systems Association. https://doi.org/10.5555/3766078.3766180

Baum, C., Malozemoff, A. J., Scholl, P. & Rosen, M. (2021). Mac’n’Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. In Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings: Proceedings (pp. 92-122). Springer. https://doi.org/10.1007/978-3-030-84259-8_4

Jacob, R., Larsen, K. G. & Nielsen, J. B. (2019). Lower Bounds for Oblivious Data Structures. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2439-2447). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.149

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Nielsen, J. B. & Simkin, M. (2020). Lower bounds for leakage-resilient secret sharing. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 556-577). Springer. https://doi.org/10.1007/978-3-030-45721-1_20

Januzelli, J., Rosulek, M. & Roy, L. (2025). Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities. In Y. Tauman Kalai & S. F. Kamara (Eds.), Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings (pp. 589-618). Springer Science+Business Media. https://doi.org/10.1007/978-3-032-01884-7_19

Bendlin, R., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2011). Lower and Upper Bounds for Deniable Public-Key Encryption. Lecture Notes in Computer Science, 7073, 125-142. https://doi.org/10.1007/978-3-642-25385-0_7

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

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2020). Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. Journal of Cryptology, 33(4), 1732-1786. https://doi.org/10.1007/s00145-020-09355-y

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2017). Low cost constant round MPC combining BMR and oblivious transfer. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Vol. 10624, pp. 598-628). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_21

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

Abram, D. & Scholl, P. (2022). Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. 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, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 221-251). Springer. https://doi.org/10.1007/978-3-030-97121-2_9

Abram, D., Nof, A., Orlandi, C., Scholl, P. & Shlomovits, O. (2022). Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. In 2022 IEEE Symposium on Security and Privacy (SP) (pp. 2554-2572). IEEE. https://doi.org/10.1109/SP46214.2022.9833559

Agarwal, A., Baum, C., Braun, L. & Scholl, P. (2025). Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs. In S. Fehr & P.-A. Fouque (Eds.), Advances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2025, Proceedings: EUROCRYPT 2025 (Vol. 4, pp. 396-426). Springer. https://doi.org/10.1007/978-3-031-91134-7_14

Aranha, D. F., Pagnin, E. & Rodriguez-Henriquez, F. (2021). LOVE a Pairing. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 320-340). Springer. https://doi.org/10.1007/978-3-030-88238-9_16

Aranha, D. F., Blatchley Hansen, A. & Kingo Mogensen, T. (2026). LINE-Break: Cryptanalysis and Reverse Engineering of Letter Sealing. In ASIA CCS 2026 - Proceedings of the 21st ACM ASIA Conference on Computer and Communications Security (pp. 375-387) https://doi.org/10.1145/3779208.3805983

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

Displaying results 301 to 350 out of 649

7

Revised 04.08.2026

-

Marianne Dammand Iversen