Publications

List of publications

Sort by: Date | Author | Title

Aranha, D. F., Hvass, B. S., Spitters, B. & Tibouchi, M. (2023). Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing. In CCS'23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 3228-3238). Association for Computing Machinery. https://doi.org/10.1145/3576915.3616597

Aranha, D. F., Battagliola, M. & Roy, L. D. (2024). Faster coercion-resistant e-voting by encrypted sorting. In E-Vote-ID 2023 (pp. 53-70). Gesellschaft fur Informatik (GI). https://doi.org/10.18420/e-vote-id2023_03

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

Frederiksen, T. K. & Nielsen, J. B. (2013). Fast and maliciously secure two-party computation using the GPU. In Applied Cryptography and Network Security: 11th International Conference, ACNS 2013, Banff, AB, Canada, June 25-28, 2013. Proceeding (pp. 339-356). Springer VS. https://doi.org/10.1007/978-3-642-38980-1_21

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

Scholl, P. (2018). Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. In M. Abdalla & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 (Vol. 10769, pp. 554-583). Springer VS. https://doi.org/10.1007/978-3-319-76578-5_19

Nielsen, P. M., Schori, C., Sørensen, J. L., Salvail, L., Damgård, I. B. & Polzik, E. S. (2001). Experimental quantum key distribution with proven security against realistic attacks. Journal of Modern Optics, 48, 1921-1942.

Damgård, I. B. & Nielsen, J. B. (2002). Expanding Pseudorandom Functions: or: From Known-Plaintext Security to Chosen-Plaintext Security. In M. Yung (Ed.), Advances in Cryptology - CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings (pp. 449-464). Springer. https://doi.org/10.1007/3-540-45708-9_29

Napoli, O., Martins do Rosario, V., Aranha, D. F. & Borin, E. (2020). Evaluation and Mitigation of Timing Side-channel Leakages on Multiple-target Dynamic Binary Translators. In C. Bianchini, C. Osthoff, P. Souza & R. Ferreira (Eds.), High Performance Computing Systems: WSCAD 2018 (pp. 152-167). Springer. https://doi.org/10.1007/978-3-030-41050-6_10

Damgård, I. B., Nielsen, J. B. & Orlandi, C. (2009). Essentially Optimal Universally Composable Oblivious Transfer. Lecture Notes in Computer Science, 5461, 1-14. https://doi.org/10.1007/978-3-642-00730-9

Ateniese, G., Dagdelen, Ö., Damgård, I. B. & Venturi, D. (2015). Entangled Encodings and Data Entanglement. In SCC '15: Proceedings of the 3rd International Workshop on Security in Cloud Computing (pp. 3-12). Association for Computing Machinery. https://doi.org/10.1145/2732516.2732524

Ateniese, G., Dagdelen, Ö., Damgård, I. B. & Venturi, D. (2012). Entangled Cloud Storage. http://eprint.iacr.org/2012/511

Ateniese, G., Dagdelen, Ö., Damgård, I. & Venturi, D. (2016). Entangled cloud storage. Future Generation Computer Systems - The International Journal of eScience, 62(9), 104-118. https://doi.org/10.1016/j.future.2016.01.008

Kamp, S. H., Nielsen, J. B., Thomsen, S. E. & Tschudi, D. (2022). Enig: Player Replaceable Finality Layers with Optimal Validity. Cryptology ePrint Archive. https://eprint.iacr.org/2022/201

Maitin-Shepard, J., Tibouchi, M. & Aranha, D. F. (2017). Elliptic Curve Multiset Hash. The Computer Journal, 60(4), 476-490. https://doi.org/10.1093/comjnl/bxw053

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

Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schröder, D. & Simkin, M. (2018). Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys. IET Information Security, 12(3), 166-183. https://doi.org/10.1049/iet-ifs.2017.0041

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

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

Mikkelsen, G. L., Keller, M. & Rupp, A. (2012). Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols. Lecture Notes in Computer Science, 7412, 147-166 . https://doi.org/10.1007/978-3-642-32284-6_9

Damgård, I. B. & Dupont, K. (2005). Efficient Threshold RSA Signatures with General Moduli and no Extra Assumptions. In S. Vaudenay (Ed.), Public Key Cryptography - PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005. Proceedings (pp. 346-361). Springer. https://doi.org/10.1007/978-3-540-30580-4_24

Aranha, D. F., Azarderakhsh, R. & Karabina, K. (2017). Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves. In S. S. Ali, J.-L. Danger & T. Eisenbarth (Eds.), Security, Privacy, and Applied Cryptography Engineering - 7th International Conference, SPACE 2017, Proceedings: 7th International Conference, SPACE 2017, Goa, India, December 13-17, 2017, Proceedings (pp. 74-92). Springer. https://doi.org/10.1007/978-3-319-71501-8_5

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets. In M. Abdalla & P. S. L. M. Barreto (Eds.), Progress in Cryptology – LATINCRYPT 2010 (pp. 144-161). Springer. https://doi.org/10.1007/978-3-642-14712-8_9

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

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2011). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. http://eprint.iacr.org/2011/494

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2012). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Lecture Notes in Computer Science, 7178, 313-331. https://doi.org/10.1007/978-3-642-27954-6_20

Hazay, C., Mikkelsen, G. L., Rabin, T., Toft, T. & Nicolosi, A. A. (2019). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Journal of Cryptology, 32(2), 265-323. https://doi.org/10.1007/s00145-017-9275-7

Damgård, I. B. & Mikkelsen, G. L. (2010). Efficient, Robust and Constant-Round Distributed RSA Key Generation. Lecture Notes in Computer Science, 5978, 183-200. https://doi.org/10.1007/978-3-642-11799-2_12

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

Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P. & Troncoso-Pastoriza, J. R. (2020). Efficient protocols for oblivious linear function evaluation from ring-LWE. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 130-149). Springer. https://doi.org/10.1007/978-3-030-57990-6_7

Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P. & Troncoso-Pastoriza, J. R. (2022). Efficient protocols for oblivious linear function evaluation from ring-LWE. Journal of Computer Security, 30(1), 39-78. https://doi.org/10.3233/JCS-200116

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

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

Andrychowicz, M., Damgård, I. B., Dziembowski, S., Faust, S. & Polychroniadou, A. (2015). Efficient leakage resilient circuit compilers. In K. Nyberg (Ed.), Topics in Cryptology - CT-RSA 2015: The Cryptographer's Track at the RSA Conference 2015, San Francisco, CA, USA, April 20-24, 2015. Proceedings (pp. 311-329). Springer VS. https://doi.org/10.1007/978-3-319-16715-2_17

Abspoel, M., Cramer, R., Damgård, I. B., Escudero Ospina, D. E. & Yuan, C. (2019). Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. In D. Hofheinz & A. Rosen (Eds.), Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings: Proceedings (Vol. Part 1, pp. 471-501). Springer. https://doi.org/10.1007/978-3-030-36030-6_19

Aranha, D. F., Dahab, R., Lopez, J. & Oliveira, L. B. (2010). Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications, 4(2), 169-187. https://doi.org/10.3934/amc.2010.4.169

Baum, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2020). Efficient constant-round mpc with identifiable abort and public verifiability. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 562-592). Springer. https://doi.org/10.1007/978-3-030-56880-1_20

Damgård, I. B. (2000). Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. 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. 418-430). Springer. https://doi.org/10.1007/3-540-45539-6_30

Junio da Cruz, R., Guimaraes, A. & Aranha, D. F. (2020). Efficient and secure software implementations of Fantomas. Journal of Cryptographic Engineering, 10(3), 211–228. https://doi.org/10.1007/s13389-019-00218-2

Damgård, I. B., Krøigaard, M. & Geisler, M. J. (2007). Efficient and Secure Comparison for On-Line Auctions. In J. Pieprzyk, H. Ghodosi & E. Dawson (Eds.), Information Security and Privacy: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007. Proceedings (Vol. 4586, pp. 416-430). Springer. https://doi.org/10.1007/978-3-540-73458-1_30

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

Damgård, I. B. & Frandsen, G. S. (2003). Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers. In A. Lingas & B. J. Nilsson (Eds.), Fundamentals of Computation Theory (pp. 109-117). Springer. https://doi.org/10.1007/978-3-540-45077-1_11

Damgård, I. B. & Frandsen, G. S. (2005). Efficient algorithms for gcd and cubic residuosity in the ring of Eisenstein integers. Journal of Symbolic Computation, 39(6), 643-652. https://doi.org/10.1016/j.jsc.2004.02.006

Aranha, D. F., Bennedsen, E., Campanelli, M., Ganesh, C., Orlandi, C. & Takahashi, A. (2022). ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. 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 (pp. 584-614). Springer. https://doi.org/10.1007/978-3-030-97121-2_21

Loss, J. & Nielsen, J. B. (2024). Early Stopping for Any Number of Corruptions. In M. Joye & G. Leander (Eds.), Advances in Cryptology – EUROCRYPT 2024: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. III, pp. 457-488). Springer. https://doi.org/10.1007/978-3-031-58734-4_16

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

Kolesnikov, V., Nielsen, J. B., Rosulek, M., Trieu, N. & Trifiletti, R. (2017). DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 3-20). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133991

Larsen, K. G., Obremski, M. & Simkin, M. (2023). Distributed Shuffling in Adversarial Environments. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.10

Displaying results 451 to 500 out of 651

Revised 04.08.2026

Marianne Dammand Iversen