Publications

List of publications

Sort by: Date | Author | Title

Costa Lopes, A. & Aranha, D. F. (2017). Platform-agnostic Low-intrusion Optical Data Exfiltration. In P. Mori, S. Furnell & O. Camp (Eds.), ICISSP 2017 - Proceedings of the 3rd International Conference on Information Systems Security and Privacy (Vol. 1, pp. 474-480) https://doi.org/10.5220/0006211504740480

Damgård, I., Escudero, D. & Polychroniadou, A. (2023). Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 7:1--7:21). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.7

Alves, P., Nayara Ortiz, J. & Aranha, D. F. (2022). Performance of hierarchical transforms in homomorphic encryption: A case study on logistic regression inference. Abstract from 1st Annual FHE.org Conference on Fully Homomorphic Encryption, Trondheim, Norway.

Alves, P., Nayara Ortiz, J. & Aranha, D. F. (2023). Performance of hierarchical transforms in homomorphic encryption: a case study on logistic regression inference. Journal of Cryptographic Engineering, 13(3), 295-310. https://doi.org/10.1007/s13389-023-00325-1

Damgård, I. B., Meldgaard, S. T. & Nielsen, J. B. (2011). Perfectly Secure Oblivious RAM without Random Oracles. Lecture Notes in Computer Science, 6597, 144-163. https://doi.org/10.1007/978-3-642-19571-6_10

Damgård, I. B., Ishai, Y. & Krøigaard, M. (2010). Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. Lecture Notes in Computer Science, 6110, 445-465. https://doi.org/10.1007/978-3-642-13190-5_23

Damgård, I. B. & Nielsen, J. B. (2001). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. B R I C S 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. (1988). Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals. In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 328-335). Springer. https://doi.org/10.1007/0-387-34799-2_26

Aranha, D. F., Knapp, E., Menezes, A. & Rodriguez-henriquez, F. (2011). Parallelizing the Weil and Tate Pairings. In L. Chen (Ed.), Cryptography and Coding (pp. 275-295). Springer. https://doi.org/10.1007/978-3-642-25516-8_17

Chen, L., Damgård, I. B. & Pedersen, T. P. (1995). Parallel divertibility of proofs of knowledge (Extended abstract). In A. De Santis (Ed.), Advances in Cryptology - EUROCRYPT'94: Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, May 9-12, 1994 Proceedings (pp. 140-155). Springer. https://doi.org/10.1007/BFb0053431

Harnik, D., Ishai, Y., Kushilevitz, E. & Nielsen, J. B. (2008). OT-Combiners Via Secure Computation. Lecture Notes in Computer Science, 4948, 393-411. https://doi.org/10.1007/978-3-540-78524-8_22

Årdal, M. A., Adj, G., Alblooshi, A., Aranha, D. F., A. Canales-Martínez, I., Chavez-Saab, J., Gazzoni Filho, D. L., Reijnders, K. & Rodriguez-Henriquez, F. (2025). Optimized One-Dimensional SQIsign Verification on Intel and Cortex-M4. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2025(1), 497-522. https://doi.org/10.46586/tches.v2025.i1.497-522

Guimaraes, A., Aranha, D. F. & Borin, E. (2019). Optimized implementation of QC‐MDPC code‐based cryptography. Concurrency and Computation: Practice & Experience, 31(18), Article e5089. https://doi.org/10.1002/cpe.5089

Brandt, M., Orlandi, C., Shrishak, K. & Shulman, H. (2020). Optimal Transport Layer for Secure Computation. In P. Samarati, S. D. C. D. Vimercati, M. S. Obaidat & J. Ben-Othman (Eds.), ICETE 2020 - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications (Vol. Volume 3: SECRYPT, pp. 130-141). SCITEPRESS Digital Library. https://doi.org/10.5220/0009826801300141

Aranha, D. F., Beuchat, J.-L., Detrey, J. & Estibals, N. (2012). Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves. In O. Dunkelman (Ed.), Topics in Cryptology – CT-RSA 2012 (pp. 98-115). Springer. https://doi.org/10.1007/978-3-642-27954-6_7

Hall-Andersen, M. N. & Nielsen, J. B. (2023). On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles. 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 II (pp. 438-469). Springer. https://doi.org/10.1007/978-3-031-30617-4_15, https://doi.org/10.1007/978-3-031-30617-415

Orlandi, C., Ravi, D. & Scholl, P. (2022). On the Bottleneck Complexity of MPC with Correlated Randomness. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 194-220). Springer. https://doi.org/10.1007/978-3-030-97121-2_8

Damgård, I. B. & Mikkelsen, G. L. (2009). On the Theory and Practice of Personal Digital Signatures. Lecture Notes in Computer Science, 277-296. https://doi.org/10.1007/978-3-642-00468-1

Beerliová-Trubíniová, Z., Hirt, M. & Nielsen, J. B. (2010). On the theoretical gap between synchronous and asynchronous MPC protocols. In A. Richa & R. Guerraoui (Eds.), Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. PODC '10 (pp. 211-218). Association for Computing Machinery. https://doi.org/10.1145/1835698.1835746

Damgård, I. B. (1988). On The Randomness of Legendre and Jacobi Sequences. In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 163-172). Springer. https://doi.org/10.1007/0-387-34799-2_13

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

Ishai, Y., Kushilevitz, E., Meldgaard, S. T., Orlandi, C. & Paskin-Cherniavsky, A. (2013). On the Power of Correlated Randomness in Secure Computation. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 600-620 ). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_34

Damgård, I. B., Dupont-Dupuis, F. & Nielsen, J. B. (2015). On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation. In Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (pp. 87-104). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_6

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

Damgård, I. B., Nielsen, J. B. & Orlandi, C. (2010). On the Necessary and Sufficient Assumptions for UC Computation. Lecture Notes in Computer Science, 5978, 109-127. https://doi.org/10.1007/978-3-642-11799-2_8

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., Killian, J. & Salvail, L. (1999). On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. In J. Stern (Ed.), Advances in Cryptology - EUROCRYPT '99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2-6, 1999 Proceedings (pp. 56-73). Springer. https://doi.org/10.1007/3-540-48910-X_5

Damgård, I. B., Pedersen, T. P. & Pfitzmann, B. (1994). On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures. In D. R. Stinson (Ed.), Advances in Cryptology - CRYPTO' 93: 13th Annual International Cryptology Conference Santa Barbara, California, USA August 22-26, 1993 Proceedings (pp. 250-265). Springer. https://doi.org/10.1007/3-540-48329-2_22

Damgård, I. B., Pedersen, T. P. & Pfitzmann, B. (1997). On the existence of statistically hiding bit commitment schemes and fail-stop signatures. Journal of Cryptology, 10(3), 163-194. https://doi.org/10.1007/s001459900026

Damgård, I. B. (1989). On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs. In G. Brassard (Ed.), Advances in Cryptology - CRYPTO' 89 Proceedings (pp. 17-27). Springer. https://doi.org/10.1007/0-387-34805-0_3

Cramer, R., Damgård, I. B. & Fehr, S. (2001). On the Cost of Reconstructing a Secret or VSS with Optimal Reconstruction. In J. Killian (Ed.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 503-524). Springer. https://doi.org/10.1007/3-540-44647-8_30

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. & Ranellucci, S. (2016). On the Computational Overhead of MPC with Dishonest Majority. http://eprint.iacr.org/2016/643

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

Cramer, R., Damgård, I. B. & Dziembowski, S. (2000). On the complexity of verifiable secret sharing and multiparty computation. In Proceedings of the thirty-second annual ACM symposium on Theory of computing (pp. 325-334). Association for Computing Machinery. https://doi.org/10.1145/335305.335343

Trifiletti, R., Nielsen, J. B., Frederiksen, T. K. & Jakobsen, T. P. (2016). On the Complexity of Additively Homomorphic UC Commitments. In E. Kushilevitz & T. Malkin (Eds.), Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings (Vol. 9562, pp. 542-565). Springer VS. https://doi.org/10.1007/978-3-662-49096-9

Damgård, I. B., Nielsen, J. B., Polychroniadou, A. & Raskin, M. (2016). On the Communication Required for Unconditionally Secure Multiplication. In Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings (Vol. 9815, pp. 459-488). Springer VS. https://doi.org/10.1007/978-3-662-53008-5_16

Polychroniadou, A., Damgård, I. B., Garg, S., Mukherjee, P., Nielsen, J. B. & Pandey, O. (2016). On the Communication and Round Complexity of Secure Computation. Institut for Datalogi, Aarhus Universitet. http://cs.au.dk/fileadmin/user_upload/IvanFest_AP.pdf

Jakobsen, J. & Orlandi, C. (2015). On the CCA (in)security of MTProto. http://eprint.iacr.org/2015/1177

Jakobsen, J. & Orlandi, C. (2016). On the CCA (in)security of MTProto. In Proceedings of the 6th Workshop on Security and Privacy in Smartphones and Mobile Devices: SPSM '16 (pp. 113-116). Association for Computing Machinery. https://doi.org/10.1145/2994459.2994468

Cramer, R., Damgård, I. B. & Pastro, V. (2011). On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. http://eprint.iacr.org/2011/301

Cramer, R., Damgård, I. B. & Pastro, V. (2012). On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. Lecture Notes in Computer Science, 7412, 62-79 . https://doi.org/10.1007/978-3-642-32284-6_4

Damgård, I. B. & Cramer, R. (2009). On the Amortized Complexity of Zero-Knowledge Protocols. Lecture Notes in Computer Science, 5677, 177-191. https://doi.org/10.1007/978-3-642-03356-8_11

Cramer, R., Damgård, I. B. & Keller, M. (2014). On the Amortized Complexity of Zero-Knowledge Protocols. Journal of Cryptology, 27(2), 284-316. https://doi.org/10.1007/s00145-013-9145-x

Simkin, M., Siniscalchi, L. & Yakoubov, S. (2022). On Sufficient Oracles for Secure Computation with Identifiable Abort. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 494-515). Springer. https://doi.org/10.1007/978-3-031-14791-3_22

Ben-Sasson, E., Ben-Tov, I., Damgård, I., Ishai, Y. & Ron-Zewi, N. (2016). On public key encryption from noisy codewords. In Public-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 9615, pp. 417-446). Springer VS. https://doi.org/10.1007/978-3-662-49387-8_16

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

Ishai, Y., Kumarasubramanian, A., Orlandi, C. & Sahai, A. (2011). On Invertible Sampling and Adaptive Security. Lecture Notes in Computer Science, 6477, 466-482. https://doi.org/10.1007/978-3-642-17373-8_27

Brandt, J. & Damgård, I. B. (1993). On generation of probable primes by incremental search. In Advances in cryptology - CRYPTO '92 (pp. 358-370). Springer.

Displaying results 201 to 250 out of 571

Revised 07.03.2025

Marianne Dammand Iversen