Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. & Nielsen, J. B. (2001). From Known-Plaintext Security to Chosen-Plaintext Security. BRICS Report Series, (RS-01-43).

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2014). Framework for Outsourcing of Secure Computation. In G.-J. Ahn , A. Oprea & R. Safavi-Naini (Eds.), Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW '14 (pp. 81-92 ). Association for Computing Machinery. https://doi.org/10.1145/2664168.2664170

Ubys, L., Vancea, V. N., Kulik, T., Larsen, P. G., Boudjadar, J. & Aranha, D. F. (2022). Formal Model In-The-Loop for Secure Industrial Control Networks. In Formal Aspects of Component Software - 18th International Conference, FACS 2022, Proceedings (pp. 74-89). Springer. https://doi.org/10.1007/978-3-031-20872-0_5

Kulik, T., Boudjadar, J. & Aranha, D. F. (2021). Formally Verified Credentials Management for Industrial Control Systems. In Proceedings - 2021 IEEE/ACM 9th International Conference on Formal Methods in Software Engineering, FormaliSE 2021: 9th IEEE/ACM International Conference on Formal Methods in Software Engineering (pp. 75-85). IEEE. https://doi.org/10.1109/FormaliSE52586.2021.00014

Matt, C., Nielsen, J. B. & Thomsen, S. E. (2022). Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks. Cryptology ePrint Archive. https://eprint.iacr.org/2022/010

Matt, C., Nielsen, J. B. & Thomsen, S. E. (2022). Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks. In Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings: 42nd Annual International Cryptology Conference, CRYPTO 2022, Procerdings (pp. 400-430). Springer, Cham. https://doi.org/10.1007/978-3-031-15979-4_14

Velasquez, K., Perez Abreu, D., Assis, M. R. M., Senna, C., Aranha, D. F., Bittencourt, L. F., Laranjeiro, N., Curado, M., Vieira, M., Monteiro, E. & Madeira, E. (2018). Fog orchestration for the Internet of Everything: state-of-the-art and research challenges. Journal of Internet Services and Applications, 9(14), Article 14. https://doi.org/10.1186/s13174-018-0086-3

Ganesh, C., Orlandi, C., Pancholi, M. R., Takahashi, A. & Tschudi, D. (2025). Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model). Journal of Cryptology, 38(1), Article 11. https://doi.org/10.1007/s00145-024-09525-2

Ganesh, C., Orlandi, C., Pancholi, M. R., Takahashi, A. & Tschudi, D. (2022). Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 (pp. 397-426). Springer. https://doi.org/10.1007/978-3-031-07085-3_14

Baum, C., Jadoul, R., Orsini, E., Scholl, P. & Smart, N. P. (2022). Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. In CCS'22 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 293-306). Association for Computing Machinery. https://doi.org/10.1145/3548606.3559354

Damgård, I., Jakobsen, T. P., Nielsen, J. B., Pagter, J. I. & Østergaard, M. B. (2020). Fast threshold ECDSA with honest majority. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 382-400). Springer. https://doi.org/10.1007/978-3-030-57990-6_19

Damgård, I., Jakobsen, T. P., Nielsen, J. B., Pagter, J. I. & Østergaard, M. B. (2022). Fast threshold ECDSA with honest majority. Journal of Computer Security, 30(1), 167-196. https://doi.org/10.3233/JCS-200112

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

Davi Resende, A. C., Railsback, D., Dowsley, R., Nascimento, A. C. A. & Aranha, D. F. (2022). Fast Privacy-Preserving Text Classification based on Secure Multiparty Computation. IEEE Transactions on Information Forensics and Security, 17, 428-442. https://doi.org/10.1109/TIFS.2022.3144007

Oliveira, T., Aranha, D. F., Lopez, J. & Rodriguez-henriquez, F. (2014). Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation. In A. Joux & A. Youssef (Eds.), Selected Areas in Cryptography -- SAC 2014 (pp. 324-344). Springer. https://doi.org/10.1007/978-3-319-13051-4_20

Zakarias, R. W. & Damgård, I. B. (2015). Fast Oblivious AES A Dedicated application of the MiniMac protocol. https://eprint.iacr.org/2015/989.pdf

Damgård, I. & Zakarias, R. (2016). Fast oblivious AES a dedicated application of the MiniMac protocol. In D. Pointcheval, A. Nitaj & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2016 - 8th International Conference on Cryptology in Africa, Proceedings (Vol. 9646, pp. 245-264). Springer VS. https://doi.org/10.1007/978-3-319-31517-1_13

Orlandi, C. (2017). Faster Zero-Knowledge Protocols and Applications: Invited Talk Abstract. In P. Farshim & E. Simion (Eds.), Innovative Security Solutions for Information Technology and Communications - 10th International Conference,SecITC 2017, Revised Selected Papers: Innovative Security Solutions for Information Technology and Communications (Vol. 10543, pp. 1-11). Springer VS. https://doi.org/10.1007/978-3-319-69284-5_1

Davi Resende, A. C. & Aranha, D. F. (2021). Faster unbalanced Private Set Intersection in the semi-honest setting. Journal of Cryptographic Engineering, 11(1), 21-38. https://doi.org/10.1007/s13389-020-00242-7

Davi Resende, A. C. & Aranha, D. F. (2018). Faster Unbalanced Private Set Intersection. In S. Meiklejohn & K. Sako (Eds.), Financial Cryptography and Data Security - 22nd International Conference, FC 2018, Revised Selected Papers: 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 – March 2, 2018, Revised Selected Papers (1 ed., pp. 203-221). Springer. https://doi.org/10.1007/978-3-662-58387-6

Frederiksen, T. K., Jakobsen, T. P. & Nielsen, J. B. (2014). Faster Maliciously Secure Two-Party Computation Using the GPU. In M. Abdalla & R. D. Prisco (Eds.), Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 358-379 ). Springer. https://doi.org/10.1007/978-3-319-10879-7_21

Aranha, D. F., Faz-Hernandez, A., Lopez, J. & Rodriguez-henriquez, F. (2012). Faster Implementation of Scalar Multiplication on Koblitz Curves. In A. Hevia & G. Neven (Eds.), Progress in Cryptology – LATINCRYPT 2012 (pp. 177-193). Springer. https://doi.org/10.1007/978-3-642-33481-8_10

Alves, P. G. M. R., Nayara Ortiz, J. & Aranha, D. F. (2021). Faster Homomorphic Encryption over GPGPUs via hierarchical DGT. In N. Borisov & C. Diaz (Eds.), Financial Cryptography and Data Security - 25th International Conference, FC 2021, Revised Selected Papers (pp. 520-540). Springer. https://doi.org/10.1007/978-3-662-64331-0_27

Aranha, D. F., Karabina, K., Longa, P., Gebotys, C. H. & Lopez, J. (2011). Faster Explicit Formulas for Computing Pairings over Ordinary Curves. In K. G. Paterson (Ed.), Advances in Cryptology – EUROCRYPT 2011 (pp. 48-68). Springer. https://doi.org/10.1007/978-3-642-20465-4_5

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

Displaying results 401 to 450 out of 612

Revised 14.01.2026

Marianne Dammand Iversen