Publications

List of publications

Sort by: Date | Author | Title

Nissim, K., Orlandi, C. & Smorodinsky, R. (2012). Privacy-aware mechanism design. In B. Faltings (Ed.), Proceedings of the ACM Conference on Electronic Commerce, EC '12 (pp. 774-789). Association for Computing Machinery. https://doi.org/10.1145/2229012.2229073

Nielsen, J. B. (2002). A Threshold Pseudorandom Function Construction and Its Applications. In M. Yung (Ed.), Advances in Cryptology — CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings (pp. 43-59). Springer. https://doi.org/10.1007/3-540-45708-9_26

Nielsen, J. B. (2001). Non-Committing Encryption is Too Easy in the Random Oracle Model. BRICS Report Series, (RS-01-47).

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

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.

Nielsen, J. B. (Ed.), Alwen, J., Cachin, C., Pereira, O., Sadeghi, A.-R., Schoenmakers, B., Shelat, A. & Visconti, I. (2007). Summary Report on Rational Cryptographic Protocols. ECRYPT - European Network of Excellence in Cryptology.

Nielsen, J. B. (Ed.), Damgård, I. B., Salvail, L. & Cachin, C. (2006). Summary Report on Unconditionally Secure Protocols. (pp. 1- 25). ECRYPT - European Network of Excellence in Cryptology.

Nielsen, J. B. & Orlandi, C. (2009). LEGO for Two-Party Secure Computation. Lecture Notes in Computer Science, 5444, 368-386. https://doi.org/10.1007/978-3-642-00457-5_22

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2011). A New Approach to Practical Active-Secure Two-Party Computation. http://eprint.iacr.org/2011/091

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2012). A New Approach to Practical Active-Secure Two-Party Computation. Lecture Notes in Computer Science, 7417, 681-700 . https://doi.org/10.1007/978-3-642-32009-5_40

Nielsen, J. B., Venturi, D. & Zottarel, A. (2013). On the Connection between Leakage Tolerance and Adaptive Security. In K. Kurosawa & G. Hanaoka (Eds.), Public-Key Cryptography – PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26 – March 1, 2013. Proceedings (pp. 497-515 ). Springer VS. https://doi.org/10.1007/978-3-642-36362-7_30

Nielsen, J. B., Venturi, D. & Zottarel, A. (2014). Leakage-resilient signatures with graceful degradation. In H. Krawczyk (Ed.), Public-Key Cryptography – PKC 2014: 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings (pp. 362-379). Springer. https://doi.org/10.1007/978-3-642-54631-0_21

Nielsen, J. B. (2015). Tamper and leakage resilient von Neumann architectures from continuous non-malleable codes. In S. Wolf & A. Lehmann (Eds.), 8th International Conference on Information Theoretic Security, ICITS 2015 (Vol. 9063, pp. XI-XII). Springer.

Nielsen, J. B. & Orlandi, C. (2016). Cross and Clean: Amortized Garbled Circuits with Constant Overhead. In M. Hirt & A. Smith (Eds.), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (Vol. 9985, pp. 582-603). Springer VS. https://doi.org/10.1007/978-3-662-53641-4_22

Nielsen, J. B. & Ranellucci, S. (2016). Reactive garbling: Foundation, instantiation, application. In J. H. Cheon & T. Takagi (Eds.), Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 10032, pp. 1022-1052). Springer VS. https://doi.org/10.1007/978-3-662-53890-6_34

Nielsen, J. B. & Ranellucci, S. (2016). On the Computational Overhead of MPC with Dishonest Majority. http://eprint.iacr.org/2016/643

Nielsen, J. B., Schneider, T. & Trifiletti, R. (2017). Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS ’17 (pp. 1-15). Internet Society. https://doi.org/10.14722/ndss.2017.23075

Nielsen, J. B. & Ranellucci, S. (2017). On the computational overhead of MPC with dishonest majority. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10175, pp. 369-395). Springer VS. https://doi.org/10.1007/978-3-662-54388-7_13

Nielsen, J. B. & Simkin, M. (2020). Lower bounds for leakage-resilient secret sharing. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 556-577). Springer. https://doi.org/10.1007/978-3-030-45721-1_20

Nielsen, J. B. (2003). On Protocol Security in the Cryptographic Model (BRICS Dissertation Series DS-03-8 ed.). Aarhus Universitet.

Neumann, L., Guimaraes, A., Aranha, D. F. & Borin, E. (2024). Homomorphic WiSARDs: Efficient Weightless Neural Network training over encrypted data. Abstract from 4th Workshop on Artificial Intelligence and Cryptography, Zurich, Switzerland. https://arxiv.org/abs/2403.20190

Neumann, L., Guimaraes, A., Aranha, D. F. & Borin, E. (2025). Homomorphic WiSARDs: Efficient Weightless Neural Network training over encrypted data. In M. Fischlin & V. Moonsamy (Eds.), Applied Cryptography and Network Security - 23rd International Conference, ACNS 2025, Proceedings (pp. 309-338) https://doi.org/10.1007/978-3-031-95767-3_12

Nayara Ortiz, J., Ricardo de Araujo, R., Aranha, D. F., Rodrigues Costa, S. I. & Dahab, R. (2021). The Ring-LWE Problem in Lattice-based Cryptography: The Case of Twisted Embeddings. Entropy, 23(9), Article 1108. https://doi.org/10.3390/e23091108

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

Munch-Hansen, A., Orlandi, C. & Yakoubov, S. (2021). Stronger Notions and a More Efficient Construction of Threshold Ring Signatures. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 363-381). Springer. https://doi.org/10.1007/978-3-030-88238-9_18

Miltersen, P. B., Nielsen, J. B. & Triandopoulos, N. (2009). Privacy-Enhancing Auctions Using Rational Cryptography. Lecture Notes in Computer Science, 5677, 541-558. https://doi.org/10.1007/978-3-642-03356-8_32

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

Mikkelsen, G. L. (2011). On the Protection of Digital Identities Through Threshold Cryptography. Department of Computer Science, Aarhus University.

Meyer, P., Orlandi, C., Roy, L. & Scholl, P. (2025). Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. In E. Boyle & M. Mahmoody (Eds.), Theory of Cryptography - 22nd International Conference, TCC 2024, Proceedings (pp. 71-97). Article 323579 Springer Nature. https://doi.org/10.1007/978-3-031-78023-3_3

melo, A. C. M. A., Silva, N. S. B., Mendes, H. C. & Aranha, D. F. (2006). Obtaining possible execution histories on multiple memory consistency models. In XXV International Conference of the Chilean Computer Science Society (SCCC'05) IEEE. https://doi.org/10.1109/SCCC.2005.1587870

Melissaris Papanikolaou, N., Rachuri, R., Baum, C. & Scholl, P. (2024). Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. 454-488. Paper presented at 44th Annual International Cryptology Conference - CRYPTO 2024, Santa Barbara, California, United States. https://doi.org/10.1007/978-3-031-68397-8_14

Melissaris Papanikolaou, N., Ravi, D. & Yakoubov, S. (2024). Threshold-Optimal MPC With Friends and Foes. In A. Chattopadhyay, S. Bhasin, S. Picek & C. Rebeiro (Eds.), Progress in Cryptology – INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II (Vol. 2, pp. 3-24). Springer. https://doi.org/10.1007/978-3-031-56235-8_1

Meiklejohn, S. & Orlandi, C. (2015). Privacy-enhancing overlays in bitcoin. In M. Brenner , N. Christin , B. Johnson & K. Rohloff (Eds.), Financial Cryptography and Data Security : FC 2015 International Workshops, BITCOIN, WAHC, and Wearable, San Juan, Puerto Rico, January 30, 2015, Revised Selected Papers (Vol. 8976, pp. 127-141). Springer. https://doi.org/10.1007/978-3-662-48051-9_10

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

Matias, P., Y. S. Barbosa, P., N. C. Cardoso, T., Mariano, D. & Aranha, D. F. (2019). NIZKCTF: A Non-Interactive Zero-Knowledge Capture the Flag Platform. IEEE Security & Privacy, 16(6), 42-51. Article 8636460. https://doi.org/10.1109/MSEC.2018.2875324

Marcedone , A. & Orlandi, C. (2014). Obfuscation ⇒ (IND-CPA Security ⇏ Circular Security). 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. 77-90). Springer VS. https://doi.org/10.1007/978-3-319-10879-7_5

Marandi, A., Alves, P. G. M. R., Aranha, D. F. & Jacobsen, R. H. (2024). Lattice-based Homomorphic Encryption for Privacy-Preserving Smart Meter Data Analytics. The Computer Journal, 67(5), 1687-1698. https://doi.org/10.1093/comjnl/bxad093

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

Maia Neto, A. L., Souza, A. L. F., Cunha, I., Nogueira, M., Oliveira Nunes, I., Cotta, L., Gentille, N., Loureido, A. A. F., Aranha, D. F., Kupwade Patil, H. & Oliveira, L. B. (2016). AoT: Authentication and Access Control for the Entire IoT Device Life-Cycle. In Proceedings of the 14th ACM Conference on Embedded Networked Sensor Systems, SenSys 2016 (pp. 1-15). ACM. https://doi.org/10.1145/2994551.2994555

Lunemann, C. & Nielsen, J. B. (2011). Fully simulatable quantum-secure coin-flipping and applications. Lecture Notes in Computer Science, 6737, 21-40. https://doi.org/10.1007/978-3-642-21969-6_2

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

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

Lindell, Y., Nissim, K. & Orlandi, C. (2013). Hiding the Input-Size in Secure Two-Party Computation. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (Vol. 8197, pp. 421-440). Springer VS. https://doi.org/10.1007/978-3-642-41019-2_6

Larsen, K. G. & Nielsen, J. B. (2018). Yes, There is an Oblivious RAM Lower Bound! In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology -- CRYPTO 2018 (pp. 523-542). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_18

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

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

Kyster, A., Nielsen, F. H., Oechsner, S. & Scholl, P. (2025). Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations. In M. Blanton, W. Enck & C. Nita-Rotaru (Eds.), 2025 IEEE Symposium on Security and Privacy (SP) (pp. 2491-2508). IEEE. https://doi.org/10.1109/SP61157.2025.00176

Kulik, T., Boudjadar, J. & Aranha, D. F. (2020). Towards Formally Verified Key Management for Industrial Control Systems. 119-129. Paper presented at 8th International Conference on Formal Methods in Software Engineering, Seoul, Korea, Republic of. https://doi.org/10.1145/3372020.3391555

Displaying results 51 to 100 out of 597

Revised 04.11.2025

Marianne Dammand Iversen