Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Asharov, G. & Orlandi, C. (2012). Calling Out Cheaters : Covert Security with Public VerifiabilitySecurity. Lecture Notes in Computer Science, 7658, 681-698 . https://doi.org/10.1007/978-3-642-34961-4_41

Sousa Jr., E. F., Alchieri, E., Aranha, D. F. & Solis, P. (2019). Building Secure Protocols for Extensible Distributed Coordination through Secure Extensions. Computers & Security, 87(November), Article 101583. https://doi.org/10.1016/j.cose.2019.101583

Damgård, I. B., Larsen, K. G. & Yakoubov, S. (2021). Broadcast secret-sharing, bounds and applications. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 Article 10 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2021.10

Damgård, I. B., Magri, B., Ravi, D., Siniscalchi, L. & Yakoubov, S. (2021). Broadcast-Optimal Two Round MPC with an Honest Majority. In Advances in Cryptology – CRYPTO 2021: Proceedings (pp. 155-184). Springer. https://doi.org/10.1007/978-3-030-84245-1_6

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2013). Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier. 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 (pp. 140-160 ). Springer VS. https://doi.org/10.1007/978-3-642-42045-0_8

Damgård, I., Faust, S., Mukherjee, P. & Venturi, D. (2017). Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. Journal of Cryptology, 30(1), 152-190. https://doi.org/10.1007/s00145-015-9218-0

Damgård, I., Orlandi, C. & Simkin, M. (2020). Black-box transformations from passive to covert security with public verifiability. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (Vol. Cham, pp. 647-676). Springer. https://doi.org/10.1007/978-3-030-56880-1_23

Aranha, D. F., Fouque, P-A., Qian, C., Tibouchi, M. & Zapalowicz, J-C. (2014). Binary Elligator Squared. In A. Joux & A. Youssef (Eds.), Selected Areas in Cryptography -- SAC 2014 Springer. https://doi.org/10.1007/978-3-319-13051-4_2

Patra, A. & Ravi, D. (2023). Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. Journal of Cryptology, 36(3), Article 30. https://doi.org/10.1007/s00145-023-09468-0

Baum, C., Damgård, I. B., Toft, T. & Zakarias, R. W. (2016). Better Preprocessing for Secure Multiparty Computation. In M. Manulis, A-R. Sadeghi & S. Schneider (Eds.), Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings: 14th International Conference on Applied Cryptography and Network Security (Vol. 9696, pp. 327-345). Springer VS. https://doi.org/10.1007/978-3-319-39555-5_18

Baum, C., de Saint Guilhem, C. D., Kales, D., Orsini, E., Scholl, P. & Zaverucha, G. (2021). Banquet: Short and Fast Signatures from AES. 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 I (pp. 266-297). Springer. https://doi.org/10.1007/978-3-030-75245-3_11

Damgård, I., Ganesh, C., Khoshakhlagh, H., Orlandi, C. & Siniscalchi, L. (2021). Balancing Privacy and Accountability in Blockchain Identity Management. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 552-576). Springer. https://doi.org/10.1007/978-3-030-75539-3_23

Damgård, I. B. (Ed.), Aceto, L., Goldberg, L. A., Halldórsson, M. M., Ingólfsdóttir, A. & Walukiewicz, I. (2008). Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I. Springer. Lecture Notes in Computer Science Vol. 5125 https://doi.org/10.1007/978-3-540-70575-8

Aceto, L., Damgård, I. B., Goldberg, L. A., Halldórsson, M. M., Ingólfsdóttir, A. & Walukiewicz, I. (2008). Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II. Springer. Lecture Notes in Computer Science Vol. 5126 https://doi.org/10.1007/978-3-540-70583-3

Damgård, I. B., Cramer, R. & de Haan, R. (2007). Atomic Secure Multi-party Multiplication with Low Communication. In M. Naor (Ed.), Advances in Cryptology - EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007. Proceedings (pp. 329-346). Springer. https://doi.org/10.1007/978-3-540-72540-4_19

Damgård, I. B., Salvail, L., Fehr, S., Schaffner, C. & Renner, R. (2007). A Tight High-Order Entropic Quantum Uncertainty Relation with Applications. In A. Menezes (Ed.), Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (pp. 360-378). Springer. https://doi.org/10.1007/978-3-540-74143-5_20

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

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

Hirt, M., Nielsen, J. B. & Przydatek, B. (2008). Asynchronous Multi-Party Computation with Quadratic Communication. Lecture Notes in Computer Science, 5126, 473-485. https://doi.org/10.1007/978-3-540-70583-3_39

Damgård, I. B., Geisler, M., Krøigaard, M. & Nielsen, J. B. (2009). Asynchronous Multiparty Computation: Theory and Implementation. Lecture Notes in Computer Science, 5443, 160-179. https://doi.org/10.1007/978-3-642-00468-1_10

Abspoel, M., Cramer, R., Damgård, I., Escudero, D., Rambaud, M., Xing, C. & Yuan, C. (2020). Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/pkZ. In S. Moriai & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings (Vol. III, pp. 151-180). Springer. https://doi.org/10.1007/978-3-030-64840-4_6

Aranha, D. F., El Housni, Y. & Guillevic, A. (2023). A survey of elliptic curves for proof systems. Designs, Codes and Cryptography, 91, 3333–3378. https://doi.org/10.1007/s10623-022-01135-y

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

Toft, T. (2013). A Secure Priority Queue; or: On Secure Datastructures from Multiparty Computation.. Paper presented at International Conference on Information Security and Cryptology, Seoul, Korea, Republic of. http://www.wikicfp.com/cfp/program?id=1397&s=ICISC&f=International%20Conference%20on%20Information%20Security%20and%20Cryptology

Toft, T. (2014). A secure priority queue; or: On secure datastructures from multiparty computation. In H-S. Lee & D-G. Han (Eds.), Information Security and Cryptology -- ICISC 2013: 16th International Conference, Seoul, Korea, November 27-29, 2013, Revised Selected Papers (Vol. 8565, pp. 20-33). Springer. https://doi.org/10.1007/978-3-319-12160-4_2

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

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. (2007). A "proof-reading" of Some Issues in Cryptography. In Automata, Languages and Programming: 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007. Proceedings (pp. 2-11). Springer. https://doi.org/10.1007/978-3-540-73420-8_2

Damgård, I. B., Toft, T., Pagter, J. I., Jakobsen, T., Bogetoft, P. & Nielsen, K. (2006). A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In G. Di Crescenzo & A. Rubin (Eds.), Financial Cryptography and Data Security: 10th International Conference, FC 2006 Anguilla, British West Indies, February 27-March 2, 2006 Revised Selected Papers (pp. 142-147). Springer. https://doi.org/10.1007/11889663_10

Baum, C., Braun, L., Munch-Hansen, A., Razet, B. & Scholl, P. (2021). Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. In CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (pp. 192-211). Association for Computing Machinery. https://doi.org/10.1145/3460120.3484812

Hogräfer, M., Burkhardt, J. & Schulz, H-J. (2022). A Pipeline for Tailored Sampling for Progressive Visual Analytics. In J. Bernard & M. Angelini (Eds.), Proceedings of the 13th International EuroVis Workshop on Visual Analytics (EuroVA) (pp. 49-53). Eurographics Association. https://doi.org/10.2312/eurova.20221079

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

Brandt, J., Damgård, I. B. & Landrock, P. (1988). Anonymous and verifiable registration in databases. In Advances in cryptology - EUROCRYPT '88 (pp. 167-176). Springer. https://doi.org/10.1007/3-540-45961-8_14

Blundo, C., Maio, C. D., Parente, M. & Siniscalchi, L. (2019). An intelligent and private method to profile social network users. In 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) (Vol. June 2019 , pp. 1-6). IEEE. https://doi.org/10.1109/FUZZ-IEEE.2019.8858912

Schwartzbach, N. I. (2021). An Incentive-Compatible Smart Contract for Decentralized Commerce. In IEEE International Conference on Blockchain and Cryptocurrency, ICBC 2021 (pp. 1-3). IEEE. https://doi.org/10.1109/ICBC51069.2021.9461077

Damgård, I. B. & Frandsen, G. S. (2001). An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates.

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

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

Hansen, K. M., Larsen, S. B., Pagter, J. I., Pedersen, M. Ø. & Thomsen, J. (2004). An Evaluation of an OSGi-based Residential Pervasive Computing Platform. In N. Guimarães & P. Isaías (Eds.), Proceedings of the IADIS Applied Computing Conference (pp. 246-253). International Association for Development, IADIS. http://www.iadis.net/dl/Search_list_open.asp?code=602

Damgård, I. B., Lauritsen, R. & Toft, T. (2014). An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation. 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. 398-415 ). Springer. https://doi.org/10.1007/978-3-319-10879-7_23

Toft, T. (2006). An efficient, unconditionally secure equality test for secret shared values. In Proceedings of the 2006 Workshop on Models for Cryptographic Protocols

Abspoel, M., Dalskov, A., Escudero Ospina, D. E. & Nof, A. (2021). An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. In K. Sako & N. O. Tippenhauer (Eds.), Applied Cryptography and Network Security - 19th International Conference, ACNS 2021, Proceedings: 19th International Conference, ACNS 2021, Kamakura, Japan, June 21–24, 2021, Proceedings (Vol. II, pp. 122-154). Springer. https://doi.org/10.1007/978-3-030-78375-4_6

Abram, D., Damgård, I., Orlandi, C. & Scholl, P. (2022). An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 (pp. 421-452). Springer. https://doi.org/10.1007/978-3-031-15985-5_15

Ghosh, S. & Nilges, T. (2019). An algebraic approach to maliciously secure private set intersection. In Y. Ishai & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 154-185). Springer VS. https://doi.org/10.1007/978-3-030-17659-4_6

Cramer, R., Damgård, I., Xing, C. & Yuan, C. (2017). Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. 10210, pp. 479-500). Springer VS. https://doi.org/10.1007/978-3-319-56620-7_17

Simkin, M. (2020). Alice, Bits, and Bob.

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

Braun, L., Cammarota, R. & Schneider, T. (2021). A Generic Hybrid 2PC Framework with Application to Private Inference of Unmodified Neural Networks: Extended Abstract. Poster session presented at Privacy in Machine Learning.

Displaying results 551 to 600 out of 624

12

Revised 04.10.2023

-

Marianne Dammand Iversen