Publications

List of publications

Sort by: Date | Author | Title

Fujii, H. & Aranha, D. F. (2017). Curve25519 for the Cortex-M4 and beyond. In 5th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT 2017)

Fuchsbauer, G., Gay, R., Kowalczyk, L. & Orlandi, C. (2017). Access Control Encryption for Equality, Comparison, and More. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II (Vol. 10175, pp. 88-118). Springer VS. https://doi.org/10.1007/978-3-662-54388-7_4

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

Frederiksen, T. K., Nielsen, J. B. & Orlandi, C. (2014). Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge. (pp. 30). Cryptology ePrint Archive. http://eprint.iacr.org/2014/598.pdf

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

Frederiksen, T. K., Nielsen, J. B. & Orlandi, C. (2015). Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. In E. Oswald & M. Fischlin (Eds.), Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II (pp. 191-219). Springer VS. https://doi.org/10.1007/978-3-662-46803-6_7

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

Floriano, E., Alchieri, E., Aranha, D. F. & Solis, P. (2017). Providing privacy on the tuple space model. Journal of Internet Services and Applications, 8(19), Article 19. https://doi.org/10.1186/s13174-017-0070-3

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 https://doi.org/10.1109/ISCC.2018.8538487

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

Fleischhacker, N. & Simkin, M. (2021). On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021 : 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10–13, 2021, Proceedings, Part II (pp. 618-648). Springer. https://doi.org/10.1007/978-3-030-75248-4_22

Fleischhacker, N., Larsen, K. G. & Simkin, M. (2023). How to Compress Encrypted Data. 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 I (pp. 551-577). Springer. https://doi.org/10.1007/978-3-031-30545-0_19

Fleischhacker, N., Larsen, K. G., Obremski, M. & Simkin, M. (2024). Invertible Bloom Lookup Tables with Less Memory and Randomness. In T. Chan, J. Fischer, J. Iacono & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms, ESA 2024 Article 54 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2024.54

Fitzi, M., Nielsen, J. B. & Wolf, S. (2007). How to Share a Key (Invited paper). Paper presented at 45th Annual Allerton Conference on Communication, Control, and Computing, 2007, Urbana-Champaign, United States.

Fitzi, M. & Nielsen, J. B. (2009). On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. Lecture Notes in Computer Science, 5805, 449-463. https://doi.org/10.1007/978-3-642-04355-0_46

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

Faz-Hernandez, A., Fujii, H., Aranha, D. F. & Lopez, J. (2017). A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA). 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. 170-189). Springer. https://doi.org/10.1007/978-3-319-71501-8_10

Fauzi, P. M., Meiklejohn, S., Mercer, R. H. & Orlandi, C. (2019). Quisquis: A New Design for Anonymous Cryptocurrencies. In Advances in Cryptology – ASIACRYPT 2019 (pp. 649-678) https://doi.org/10.1007/978-3-030-34578-5

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

Faust, S., Mukherjee, P., Nielsen, J. B. & Venturi, D. (2014). Continuous Non-malleable Codes. In Y. Lindell (Ed.), Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings (pp. 465-488). Springer. https://doi.org/10.1007/978-3-642-54242-8_20

Faust, S., Mukherjee, P., Nielsen, J. B. & Venturi, D. (2015). A Tamper and Leakage Resilient von Neumann Architecture. In J. Katz (Ed.), Public-Key Cryptography, PKC 2015: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 -- April 1, 2015, Proceedings (pp. 579-603). Springer VS. https://doi.org/10.1007/978-3-662-46447-2_26

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., Mukherjee, P., Nielsen, J. B. & Venturi, D. (2020). Continuously Non-malleable Codes in the Split-State Model. Journal of Cryptology, 33(4), 2034-2077. https://doi.org/10.1007/s00145-020-09362-z

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

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

Escudero, D. & Damgård, I. (2026). Preface. In D. Escudero & I. Damgård (Eds.), Progress in Cryptology – LATINCRYPT 2025: 9th International Conference on Cryptology and Information Security in Latin America, Medellín, Colombia, October 1–3, 2025, Proceedings (pp. v). Springer. https://doi.org/10.1007/978-3-032-06754-8

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

Displaying results 201 to 250 out of 651

Revised 04.08.2026

Marianne Dammand Iversen