Publications

List of publications

Sort by: Date | Author | Title

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication. In B. Preneel & T. Takagi (Eds.), Cryptographic Hardware and Embedded Systems – CHES 2011 (pp. 108-123). Springer. https://doi.org/10.1007/978-3-642-23951-9_8

Aranha, D. F., J. Dominguez Perez, L., Mrabet, A. & Swchabe, P. (2016). Software Implementation. In N. El Mrabet & M. Joye (Eds.), Guide to Pairing-Based Cryptography Chapman & Hall/CRC.

Abdolmaleki, B., Khoshakhlagh, H. & Lipmaa, H. (2021). Smooth Zero-Knowledge Hash Functions. 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. 510-535). Springer. https://doi.org/10.1007/978-3-030-92518-5_23

Tozawa, K., Morita, H. & Mizuki, T. (2025). Single-shuffle card-based protocol with eight cards per gate and its extensions. Natural Computing. Advance online publication. https://doi.org/10.1007/s11047-024-10006-5

Tozawa, K., Morita, H. & Mizuki, T. (2023). Single-Shuffle Card-Based Protocol with Eight Cards per Gate. In D. Genova & J. Kari (Eds.), Unconventional Computation and Natural Computation: 20th International Conference, UCNC 2023, Jacksonville, FL, USA, March 13–17, 2023, Proceedings (pp. 171-185). Springer. https://doi.org/10.1007/978-3-031-34034-5_12

Almansa Guerra, J. F., Damgård, I. B. & Nielsen, J. B. (2006). Simplified Threshold RSA with Adaptive and Proactive Security. In S. Vaudenay (Ed.), Advances in Cryptology - Eurocrypt 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006. Proceedings (pp. 593-611). Springer. https://doi.org/10.1007/11761679_35

Boudgoust, K. & Scholl, P. (2023). Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus. In J. Guo & R. Steinfeld (Eds.), Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023, Proceedings, Part I (pp. 371-404). Springer. https://doi.org/10.1007/978-981-99-8721-4_12

Faust, S., Hazay, C., Nielsen, J. B., Nordholt, P. S. & Zottarel, A. (2016). Signature Schemes Secure Against Hard-to-Invert Leakage. Journal of Cryptology, 29(2), 422-455. https://doi.org/10.1007/s00145-015-9197-1

Faust, S., Hazay, C., Nielsen, J. B., Nordholt, P. S. & Zottarel, A. (2012). Signature Schemes Secure against Hard-to-Invert Leakage. Lecture Notes in Computer Science, 7658, 98-115. https://doi.org/10.1007/978-3-642-34961-4_8

Fehér, M., Yazdani, N., Aranha, D. F., Lucani Rötter, D. E., Hansen, M. T. & Vester, F. E. (2020). Side Channel Security of Smart Meter Data Compression Techniques. In 2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids, SmartGridComm 2020: Proceedings Article 9302931 IEEE. https://doi.org/10.1109/SmartGridComm47815.2020.9302931

Aranha, D. F., Berndt, S., Eisenbarth, T., Seker, O., Takahashi, A., Wilke, L. & Zaverucha, G. (2021). Side-Channel Protections for Picnic Signatures. Abstract from Third PQC Standardization Conference, Washington, United States.

Aranha, D. F., Berndt, S., Eisenbarth, T., Seker, O., Takahashi, A., Wilke, L. & Zaverucha, G. (2021). Side-Channel Protections for Picnic Signatures. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2021(4), 239-282. https://doi.org/10.46586/tches.v2021.i4.239-282

Boyar, J., Damgård, I. B. & Peralta, R. (2000). Short Non-Interactive Cryptographic Proofs. Journal of Cryptology, 13(4), 449-472. https://doi.org/10.1007/s001450010011

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

Damgård, I. B., Cramer, R. & Ishai, Y. (2005). Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. In J. Killian (Ed.), Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005. Proceedings (pp. 342-362). Springer. https://doi.org/10.1007/978-3-540-30576-7_19

Cascudo Pueyo, I., Damgård, I. B. & Ranellucci, S. (2014). Server-Aided Two-Party Computation with Simultaneous Corruption. (pp. 18). Cryptology ePrint Archive. Report / Cryptology ePrint Archive No. 2014/809 http://eprint.iacr.org/2014/809.pdf

Damgård, I. B. & Pfitzmann, B. (1998). Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP. In K. G. Larsen, S. Skyum & G. Winskel (Eds.), Automata, Languages and Programming: 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13-17, 1998 Proceedings (pp. 772-783). Springer. https://doi.org/10.1007/BFb0055101

Nielsen, J. B. (2002). Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-Committing Encryption Case. In M. Yung (Ed.), Advances in Cryptology — CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings (pp. 191-214). Springer. https://doi.org/10.1007/3-540-45708-9_8

Bendlin, R., Damgård, I. B., Orlandi, C. & Zakarias, S. N. H. (2011). Semi-Homomorphic Encryption and Multiparty Computation. Lecture Notes in Computer Science, 6632, 169-188. https://doi.org/10.1007/978-3-642-20465-4_11

Abram, D., Waters, B. & Zhandry, M. (2023). Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology: CRYPTO 2023, Proceedings (Vol. Part I, pp. 489-514). Springer. https://doi.org/10.1007/978-3-031-38557-5_16

Farshim, P., Orlandi, C. & Rosie, R. (2017). Security of Symmetric Primitives under Incorrect Usage of Keys. IACR Trans. Symmetric Cryptol., 2017(1), 449-473. https://doi.org/10.13154/tosc.v2017.i1.449-473

Aranha, D. F., Orlandi, C., Takahashi, A. & Zaverucha, G. (2020). Security of Hedged Fiat–Shamir Signatures under Fault Attacks. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 (pp. 644-674). Springer. https://doi.org/10.1007/978-3-030-45721-1_23

Chen, L. & Damgård, I. B. (1993). Security Bounds for Parallel Versions of Identification Protocols (extended abstract). 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. 461-466). Springer. https://doi.org/10.1007/3-540-47555-9_40

Floriano, E., Alchieri, E., Aranha, D. F. & Solis, P. (2018). Security and Privacy in Extensible Distributed Coordination. In 2018 IEEE Symposium on Computers and Communications, ISCC 2018 (pp. 34-37). Article 8538487

Kingo Mogensen, T. & Aranha, D. F. (2022). Security analysis of the passwordless MitID digital identity system. Abstract from 27th Nordic Conference on Secure IT Systems (NordSec 2022), Reykjavik, Iceland.

Dalskov, A. P. K., Orlandi, C., Keller, M., Shrishak, K. & Shulman, H. (2020). Securing DNSSEC Keys via Threshold ECDSA from Generic MPC. In L. Chen, S. Schneider, N. Li & K. Liang (Eds.), European Symposium on Research in Computer Security : Computer Security – ESORICS 2020 (Vol. I, pp. 654-673). Springer. https://doi.org/10.1007/978-3-030-59013-0_32

Oliveira, L. B., Kansal, A., Gouvea, C. P. L., Aranha, D. F., Lopez, J., Priyantha, B., Goraczko, M. & Zhao, F. (2011). Secure-TWS: Authenticating Node to Multi-user Communication in Shared Sensor Networks. The Computer Journal, 55(4), 384-396. https://doi.org/10.1093/comjnl/bxr089

Dupuis, F., Nielsen, J. B. & Salvail, L. (2010). Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. Lecture Notes in Computer Science, 6223, 685-706. https://doi.org/10.1007/978-3-642-14623-7_37

Damgård, I. B., Faust, S. & Hazay, C. (2011). Secure Two-Party Computation with Low Communication. http://eprint.iacr.org/2011/508

Damgård, I. B., Kölker, J., Faust, S. & Hazay, C. (2012). Secure Two-Party Computation with Low Communication. Lecture Notes in Computer Science, 7194, 54-74 . https://doi.org/10.1007/978-3-642-28914-9_4

Cramer, R. & Damgård, I. B. (1995). Secure Signature Schemes based on Interactive Protocols. In D. Coppersmith (Ed.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (pp. 297-310). Springer. https://doi.org/10.1007/3-540-44750-4_24

Damgård, I. B., Nielsen, J. B., Fitzi, M. & Desmedt, Y. (2007). Secure Protocols with Asymmetric Trust. In Advances in Cryptology - ASIACRYPT 2007: 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007. Proceedings (pp. 357-375). Springer. https://doi.org/10.1007/978-3-540-76900-2_22

Keller, H., Möllering, H., Schneider, T., Tkachenko, O. & Zhao, L. (2024). Secure Noise Sampling for DP in MPC with Finite Precision. In ARES '24: Proceedings of the 19th International Conference on Availability, Reliability and Security Article 25 Association for Computing Machinery. https://doi.org/10.1145/3664476.3664490

Bøgetoft, P., Lund Christensen, D., Damgård, I. B., Geisler, M., Jacobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J. I., Schwartzbach, M. I., Toft, T. & Nielsen, K. (2009). Secure Multiparty Computation Goes Live. Lecture Notes in Computer Science, 5628, 325-343. https://doi.org/10.1007/978-3-642-03549-4_20

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

Cramer, R., Damgård, I. B. & Nielsen, J. B. (2015). Secure Multiparty Computation and Secret Sharing. Cambridge University Press.

Damgård, I. B. & Keller, M. (2010). Secure Multiparty AES. Lecture Notes in Computer Science, 6052, 367-374. https://doi.org/10.1007/978-3-642-14577-3_31

Damgård, I. B., Salvail, L., Schaffner, C. & Fehr, S. (2007). Secure Identification and QKD in the Bounded-Quantum-Storage Model. In A. Menezes (Ed.), Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (pp. 342-359). Springer. https://doi.org/10.1007/978-3-540-74143-5_19

Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. (2014). Secure identification and QKD in the bounded-quantum-storage model. Theoretical Computer Science, 560(1), 12-26. https://doi.org/10.1016/j.tcs.2014.09.014

Lucani Rötter, D. E., Nielsen, L., Orlandi, C., Pagnin, E. & Vestergaard, R. (2020). Secure generalized deduplication via multi-key revealing encryption. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 298-318). Springer. https://doi.org/10.1007/978-3-030-57990-6_15

Cramer, R. & Damgård, I. B. (2001). Secure Distributed Linear Algebra in a Constant Number of Rounds. In J. Killian (Ed.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 119-137). Springer. https://doi.org/10.1007/3-540-44647-8_7

Pagter, J. I., Toft, T., Damgård, I. B., Bogetoft, P., Nielsen, K. & Jakobsen, T. (2005). Secure Computing, Economy, and Trust - A Generic Solution for Secure Auctions with Real-World Applications. B R I C S Report Series, (RS-05-18), 1-35.

Damgård, I. B., Kölker, J. & Toft, T. (2012). Secure Computation, I/O-Efficient Algorithms and Distributed Signatures. Lecture Notes in Computer Science, 7178, 278-295 . https://doi.org/10.1007/978-3-642-27954-6_18

Orlandi, C. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.

Damgård, I., Ravi, D., Tschudi, D. & Yakoubov, S. (2023). Secure Communication in Dynamic Incomplete Networks. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 13:1--13:21). Article 13 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.13

Applebaum, B., Damgård, I., Ishai, Y., Nielsen, M. & Zichron, L. (2017). Secure Arithmetic Computation with Constant Computational Overhead. In H. Shacham & J. Katz (Eds.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Vol. 10401, pp. 223-254). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_8

Damgård, I. B., Kölker, J. & Miltersen, P. B. (2012). Secret Sharing and Secure Computing from Monotone Formulae. http://eprint.iacr.org/2012/536

Damgård, I. B. & Cramer, R. (2004). Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. In M. Naor (Ed.), Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004. Proceedings (pp. 223-237). Springer. https://doi.org/10.1007/978-3-540-24638-1_13

Chillotti, I., Orsini, E., Scholl, P., Smart, N. P. & Leeuwen, B. V. (2022). Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 540-563). Springer. https://doi.org/10.1007/978-3-031-14791-3_24

Damgård, I. B. & Ishai, Y. (2006). Scalable Secure Multiparty Computation. In C. Dwork (Ed.), Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings (pp. 501-520). Springer. https://doi.org/10.1007/11818175_30

Displaying results 101 to 150 out of 566

Revised 07.03.2025

Marianne Dammand Iversen