Publications

List of publications

Sort by: Date | Author | Title

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

Faonio, A., Nielsen, J. B. & Venturi, D. (2017). Predictable arguments of knowledge. 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. 121-150). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_6

Faonio, A. & Nielsen, J. B. (2017). Non-malleable Codes with Split-State Refresh. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (pp. 279-309). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_12

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

Faonio, A., Nielsen, J. B., Simkin, M. & Venturi, D. (2018). Continuously Non-malleable Codes with Split-State Refresh. In B. Preneel & F. Vercauteren (Eds.), Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Proceedings (Vol. 10892, pp. 121-139). Springer VS. https://doi.org/10.1007/978-3-319-93387-0_7

Faonio, A., Buus Nielsen, J., Simkin, M. & Venturi, D. (2019). Continuously non-malleable codes with split-state refresh. Theoretical Computer Science, 759, 98-132. https://doi.org/10.1016/j.tcs.2018.12.028

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

Eerikson, H., Keller, M., Orlandi, C., Pullonen, P., Puura, J. & Simkin, M. (2020). Use your brain! Arithmetic 3PC for any modulus with active security. In Y. T. Kalai, A. D. Smith & D. Wichs (Eds.), 1st Conference on Information-Theoretic Cryptography (ITC 2020) Article 5 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2020.5

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

Dupuis, F., Nielsen, J. B. & Salvail, L. (2012). Actively Secure Two-Party Evaluation of Any Quantum Operation. Lecture Notes in Computer Science, 7417, 794-811. https://doi.org/10.1007/978-3-642-32009-5_46

Döttling, N. M., Ghosh, S., Nielsen, J. B., Nilges, T. & Trifiletti, R. (2017). TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security: CCS '17 (pp. 2263-2276). Association for Computing Machinery. https://doi.org/10.1145/3133956.3134024

Dodis, Y. & Nielsen, J. B. (Eds.) (2015). Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II. Springer VS. Lecture Notes in Computer Science Vol. 9015 https://doi.org/10.1007/978-3-662-46497-7

Dodis, Y. & Nielsen, J. B. (Eds.) (2015). Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. Springer VS. Lecture Notes in Computer Science Vol. 9014 https://doi.org/10.1007/978-3-662-46494-6

Dinsdale-Young, T., Magri, B., Matt, C., Nielsen, J. B. & Tschudi, D. (2020). Afgjort: A partially synchronous finality layer for blockchains. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 24-44). Springer. https://doi.org/10.1007/978-3-030-57990-6_2

Díaz Cardell, S., Aranha, D. F. & Fuster-Sabater, A. (2020). Recovering decimation-based cryptographic sequences by means of linear CAs. Logic Journal of the IGPL, 28(4), 430–448. https://doi.org/10.1093/jigpal/jzz051

Davi Resende, A. C., Mochetti, K. & Aranha, D. F. (2015). PUF-Based Mutual Multifactor Entity and Transaction Authentication for Secure Banking. In T. Güneysu, G. Leander & A. Moradi (Eds.), Lightweight Cryptography for Security and Privacy (pp. 77-96). Springer. https://doi.org/10.1007/978-3-319-29078-2_5

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

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

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

Damgård, I. B., Fehr, S., Morozov, K. & Salvail, L. (2004). Unfair Noisy Channels and Oblivious Transfer. In M. Naor (Ed.), Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004. Proceedings (pp. 355-373). Springer. https://doi.org/10.1007/978-3-540-24638-1_20

Damgård, I. B., Fehr, S. & Salvail, L. (2004). Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks. In M. Franklin (Ed.), Advances in Cryptology - CRYPTO 2004: 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 2004. Proceedings (pp. 254-272). Springer. https://doi.org/10.1007/978-3-540-28628-8_16

Damgård, I. B. & Frandsen, G. S. (2003). An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. In A. Lingas & B. J. Nilsson (Eds.), Fundamentals of Computation Theory (pp. 118-131). Springer. https://doi.org/10.1007/978-3-540-45077-1_12

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. & Fujisaki, E. (2002). A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In Y. Zheng (Ed.), Advances in Cryptology - ASIACRYPT 2002: 8th International Conference on the Theory and Application of Cryptology and Information Security Queenstown, New Zealand, December 1-5, 2002 Proceedings (pp. 77-85). Springer. https://doi.org/10.1007/3-540-36178-2_8

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

Damgård, I. B., Groth, J., Salomonsen, G. & Gritzalis, D. (Ed.) (2002). The Theory and Implementation of Electronic Voting Systems. In Secure Electronic Voting (Vol. 7, pp. 77-100). Kluwer Academic Publishers.

Damgård, I. B. & Jurik, M. J. (2001). A Generalisation, a Simplification and some Applications of Paillier's Probabilistic Public-Key System. In K. Kim (Ed.), Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13-15, 2001 Proceedings (pp. 119-136). Springer. https://doi.org/10.1007/3-540-44586-2_9

Damgård, I. B. & Jurik, M. J. (2003). A Length-Flexible Threshold Cryptosystem with Applications. In R. Safavi-Naini & J. Seberry (Eds.), Information Security and Privacy: 8th Australasian Conference, ACISP 2003 Wollongong, Australia, July 9–11, 2003 Proceedings (pp. 350-364). Springer. https://doi.org/10.1007/3-540-45067-X_30

Damgård, I. B. & Jurik, M. J. (2002). Client/Server Tradeoffs for On-line Elections. In D. Naccache & P. Pailier (Eds.), Public Key Cryptography: 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 Paris, France, February 12-14, 2002 Proceedings (pp. 125-140). Springer. https://doi.org/10.1007/3-540-45664-3_9

Damgård, I. B. & Jurik, M. J. (2003). Scalable Key-Escrow. BRICS Report Series, (RS-03-22).

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

Damgård, I. B. & Koprowski, M. (2001). Practical Threshold RSA Signatures Without a Trusted Dealer. 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. 152-165). Springer. https://doi.org/10.1007/3-540-44987-6_10

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

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

Damgård, I. B. & Nielsen, J. B. (2001). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. BRICS Report Series, (RS-01-41).

Damgård, I. B. & Nielsen, J. B. (2002). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. In M. Yung (Ed.), Advances in Cryptology - CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings (pp. 581-596). Springer. https://doi.org/10.1007/3-540-45708-9_37

Damgård, I. B. & Nielsen, J. B. (2003). Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In D. Boneh (Ed.), Advances in Cryptology - CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings (pp. 247-264). Springer. https://doi.org/10.1007/978-3-540-45146-4_15

Damgård, I. B., Pedersen, T. B. & Salvail, L. (2004). On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-way Quantum Transmission. In C. Cachin & J. Camenisch (Eds.), Advances in Cryptology - EUROCRYPT 2004: International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings (pp. 91-108). Springer. https://doi.org/10.1007/978-3-540-24676-3_6

Damgård, I. B., Salvail, L., Schaffner, C. & Fehr, S. (2005). Cryptography In The Bounded Quantum-Storage Model. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (pp. 449-458). IEEE. https://doi.org/10.1109/SFCS.2005.30

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

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

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

Damgård, I. B., Salvail, L. & Pedersen, T. B. (2005). A Quantum Cipher with Near Optimal Key-Recycling. In V. Shoup (Ed.), Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005. Proceedings (pp. 494-510). Springer. https://doi.org/10.1007/11535218_30

Damgård, I. B. & Ishai, Y. (2005). Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In V. Shoup (Ed.), Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005. Proceedings (pp. 378-394). Springer. https://doi.org/10.1007/11535218_23

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

Damgård, I. B., Dupont, K. & Pedersen, M. Ø. (2006). Unclonable Group Identification. 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. 555-572). Springer. https://doi.org/10.1007/11761679_33

Damgård, I. B. & Frandsen, G. S. (2006). An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate. Journal of Cryptology, 19(4), 489-520. https://doi.org/10.1007/s00145-006-0332-x

Displaying results 201 to 250 out of 599

Revised 04.11.2025

Marianne Dammand Iversen