Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Giacomelli, I., Madsen, J. & Orlandi, C. (2016). ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In Proceedings of the 25th USENIX Security Symposium: (USENIX Security 16) (pp. 1069-1083). USENIX - The Advanced Computing Systems Association. https://www.usenix.org/system/files/conference/usenixsecurity16/sec16_paper_giacomelli.pdf

Jawurek, M., Kerschbaum, F. & Orlandi, C. (2013). Zero-knowledge using garbled circuits: Or how to prove non-algebraic statements efficiently. In A.-R. Sadeghi , V. Gligor & M. Yung (Eds.), Proceedings of the ACM Conference on Computer and Communications Security, CCS '13 (pp. 955-966). Association for Computing Machinery. https://doi.org/10.1145/2508859.2516662

Damgård, I. B. & López-Alt, A. (2012). Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions. Lecture Notes in Computer Science, 7485, 38-56 . https://doi.org/10.1007/978-3-642-32928-9_3

Benarroch, D., Campanelli, M., Fiore, D., Gurkan, K. & Kolonelos, D. (2021). Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. In N. Borisov & C. Diaz (Eds.), Financial Cryptography and Data Security: 25th International Conference, FC 2021, Virtual Event, March 1–5, 2021, Revised Selected Papers, Part I (pp. 393-414). Springer. https://doi.org/10.1007/978-3-662-64322-8_19

Damgård, I. B. & Cramer, R. (1998). Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? In H. Krawczyk (Ed.), Advances in Cryptology - CRYPTO '98: 18th Annual International Cryptology Conference Santa Barbara, California, USA August 23-27, 1998 Proceedings (pp. 424-441). Springer. https://doi.org/10.1007/BFb0055745

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

Campanelli, M., Engelmann, F. & Orlandi, C. (2022). Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks (pp. 761-784). Springer. https://doi.org/10.1007/978-3-031-14791-3_33

Brandt, J., Damgård, I. B., Landrock, P. & Pedersen, T. P. (1988). Zero-Knowledge Authentication Scheme with Secret Key Exchange (extended abstract). In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 583-588). Springer. https://doi.org/10.1007/0-387-34799-2_43

Brandt, J., Damgård, I. B., Landrock, P. & Pedersen, T. (1998). Zero-knowledge authentication scheme with secret key exchange. Journal of Cryptology, 11(3), 147-159. https://doi.org/10.1007/s001459900041

Gentry, C., Halevi, S., Krawczyk, H., Magri, B., Nielsen, J. B., Rabin, T. & Yakoubov, S. (2021). YOSO: You Only Speak Once: Secure MPC with Stateless Ephemeral Roles. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: Annual International Cryptology Conference (pp. 64-93). Springer. https://doi.org/10.1007/978-3-030-84245-1_3

Damgård, I., Orlandi, C. & Simkin, M. (2018). Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (Vol. 10992, pp. 799-829). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_27

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

Ganesh, C., Kondi, Y. M., Orlandi, C., Pancholi, M. R., Takahashi, A. & Tschudi, D. (2023). Witness-Succinct Universally-Composable SNARKs. 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. 315–346). Springer. https://doi.org/10.1007/978-3-031-30617-4_11

Scholl, P., Smart, N. P. & Wood, T. (2017). When It’s All Just Too Much: Outsourcing MPC-Preprocessing. In M. O'Neill (Ed.), Cryptography and Coding - 16th IMA International Conference, IMACC 2017, Proceedings (Vol. 10655, pp. 77-99). Springer VS. https://doi.org/10.1007/978-3-319-71045-7_4

Ganesh, C., Khoshakhlagh, H., Kohlweiss, M., Nitulescu, A. & Zając, M. (2022). What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation Extractable? In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks (pp. 735-760). Springer. https://doi.org/10.1007/978-3-031-14791-3_32

Kamp, S. H., Magri, B., Matt, C., Nielsen, J. B., Thomsen, S. E. & Tschudi, D. (2021). Weight-Based Nakamoto-Style Blockchains. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021: 7th International Conference on Cryptology and Information Security in Latin America Bogotá, Colombia, October 6–8, 2021, Proceedings (pp. 299-319). Springer International Publishing. https://doi.org/10.1007/978-3-030-88238-9_15

Ganesh, C., Orlandi, C., Tschudi, D. & Zohar, A. (2022). Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. In J. Garcia-Alfaro, J. L. Muñoz-Tapia, G. Navarro-Arribas & M. Soriano (Eds.), Data Privacy Management, Cryptocurrencies and Blockchain Technology : ESORICS 2021 International Workshops, DPM 2021 and CBT 2021 (pp. 173-191). Springer. https://doi.org/10.1007/978-3-030-93944-1_12

Aranha, D. F., Baum, C., Gjøsteen, K. & Silde, T. (2023). Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. In CCS'23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 1467-1481). Association for Computing Machinery. https://doi.org/10.1145/3576915.3616683

Camenisch, J. & Damgård, I. B. (2000). Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes (Extended Abstract). In T. Okamoto (Ed.), Advances in Cryptology - ASIACRYPT 2000: 6th International Conference on the Theory and Application of Cryptology and Information Security Kyoto, Japan, December 3-7, 2000 Proceedings (pp. 331-345). Springer. https://doi.org/10.1007/3-540-44448-3_25

Ateniese, G., Chen, L., Francati, D., Papadopoulos, D. & Tang, Q. (2023). Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity: (Revisiting Space-Based Security in the Adaptive Setting). In A. Boldyreva & V. Kolesnikov (Eds.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part II (pp. 63-93). Springer. https://doi.org/10.1007/978-3-031-31371-4_3

Campanelli, M. & Hall-Andersen, M. (2022). Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets fromWell-Studied Assumptions. In ASIA CCS 2022 - Proceedings of the 2022 ACM Asia Conference on Computer and Communications Security (pp. 652-666). Association for Computing Machinery. https://doi.org/10.1145/3488932.3517424

Attema, T., Cascudo, I., Cramer, R., Damgård, I. & Escudero, D. (2022). Vector Commitments over Rings and Compressed Σ -Protocols. In E. Kiltz & V. Vaikuntanathan (Eds.), Theory of Cryptography - 20th International Conference, TCC 2022, Proceedings (Vol. Part 1, pp. 173-202). Springer. https://doi.org/10.1007/978-3-031-22318-1_7

Boudgoust, K., Sakzad, A. & Steinfeld, R. (2022). Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems. Designs, Codes and Cryptography, 90(8), 1899-1936. https://doi.org/10.1007/s10623-022-01083-7

Baum, C., Cozzo, D. & P. Smart, N. (2020). Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ. In K. G. Paterson & D. Stebila (Eds.), Selected Areas in Cryptography – SAC 2019 - 26th International Conference, Revised Selected Papers: 26th International Conference, Waterloo, ON, Canada, August 12–16, 2019, Revised Selected Papers (pp. 274-302). Springer. https://doi.org/10.1007/978-3-030-38471-5_12

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 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2020.5

Kingo, T. & Aranha, D. F. (2023). User-centric security analysis of MitID: the Danish passwordless digital identity solution. Computers & Security, 132, Article 103376. https://doi.org/10.1016/j.cose.2023.103376

Hirt, M. & Nielsen, J. B. (2005). Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computations. In B. Roy (Ed.), Advances in Cryptology - ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005. Proceedings (pp. 79-99). Springer. https://doi.org/10.1007/11593447_5

Dahl, M. & Damgård, I. B. (2013). Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption. Cryptology ePrint Archive. http://eprint.iacr.org/2013/296.pdf

Dahl, M. & Damgård, I. B. (2014). Universally composable symbolic analysis for two-party protocols based on homomorphic encryption. In P. Q. Nguyen & E. Oswald (Eds.), Advances in Cryptology – EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings (pp. 695-712). Springer VS. https://doi.org/10.1007/978-3-642-55220-5_38

Chakraborty, S., Magri, B., Nielsen, J. B. & Venturi, D. (2022). Universally Composable Subversion-Resilient Cryptography. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 272-302). Springer. https://doi.org/10.1007/978-3-031-06944-4_10

Barak, B., Canetti, R., Nielsen, J. B., Pass, R. & IEEE (Ed.) (2004). Universally Composable Protocols with Relaxed Set-Up Assumptions. In Ikke angivet (pp. 186-195). IEEE Press.

Barak, B., Canetti, R., Nielsen, J. B. & Pass, R. (2004). Universally composable protocols with relaxed set-up assumptions. In 45th Annual IEEE Symposium on Foundations of Computer Science, 2004. Proceedings. (pp. 186-195). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2004.71

Damgård, I. B., Nielsen, J. B. & Wichs, D. (2009). Universally Composable Multiparty Computation with Partially Isolated Parties. Lecture Notes in Computer Science, 5444, 315-331. https://doi.org/10.1007/978-3-642-00457-5_19

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

Meldgaard, S. T. (2013). Unconditionally Secure Protocols. Institut for Datalogi, Aarhus Universitet.

Damgård, I. B., Nielsen, J. B., Toft, T., Kiltz, E. & Fitzi, M. (2006). Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In S. Halevi & T. Rabin (Eds.), Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings (pp. 285-304). Springer. https://doi.org/10.1007/11681878_15

Damgård, I., Nielsen, J. B., Ostrovsky, R. & Rosén, A. (2016). Unconditionally secure computation with reduced interaction. In M. Fischlin & J.-S. Coron (Eds.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. 9666, pp. 420-447). Springer VS. https://doi.org/10.1007/978-3-662-49896-5_15

Damgård, I. B. & Scafuro, A. (2013). Unconditionally Secure and Universally Composable Commitments from Physical Assumptions. 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. 100-119 ). Springer VS. https://doi.org/10.1007/978-3-642-42045-0_6

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

Kondi, Y., Orlandi, C. & Roy, L. (2023). Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology – CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20–24, 2023, Proceedings, Part I (pp. 646-677). Springer. https://doi.org/10.1007/978-3-031-38557-5_21

Damgård, I. B., Orlandi, C., Takahashi, A. & Tibouchi, M. (2022). Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. Journal of Cryptology, 35(2), Article 14. https://doi.org/10.1007/s00145-022-09425-3

Damgård, I. B., Orlandi, C., Takahashi, A. & Tibouchi, M. (2021). Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, 2021, Proceedings: 24rd IACR International Conference on Practice and Theory of Public-Key Cryptography, proceedings part 1 (pp. 99-130). Springer. https://doi.org/10.1007/978-3-030-75245-3_5

Damgård, I. B. & Knudsen, L. R. (1998). Two-Key Triple Encryption. Journal of Cryptology, 11(3), 209-218. https://doi.org/10.1007/s001459900044

Oliveira, T., Lopez, J. & Aranha, D. F. (2014). Two is the fastest prime: lambda coordinates for binary elliptic curves. Journal of Cryptographic Engineering, 4(1), 3-17. https://doi.org/10.1007/s13389-013-0069-z

Pinkas, B., Baum, C., Adi, Y., Keshet, Y. & Cisse, M. (2018). Turning your weakness into a strength: Watermarking deep neural networks by backdooring. In Proceedings of the 27th USENIX Security Symposium (pp. 1615-1631) https://arxiv.org/abs/1802.04633

Reyzin, L., Smith, A. & Yakoubov, S. (2021). Turning HATE Into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC. In Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings: Proceedings (Vol. 12716, pp. 361-378). Springer. https://doi.org/10.1007/978-3-030-78086-9_27

Rachuri, S. R., Suresh, A. & Chaudhari, H. (2020). Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning. In Proceedings 2020 Network and Distributed System Security Symposium (pp. 1-18). Internet Society. https://doi.org/10.14722/ndss.2020.23005

Damgård, I. B. & Toft, T. (2008). Trading Sugar Beet Quotas - Secure Multiparty Computation in Practice. ERCIM News, 73, 32-33.

Damgård, I. B. (1991). Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks. In J. Feigenbaum (Ed.), Advances in Cryptology - CRYPTO '91: Proceedings (pp. 445-456). Springer. https://doi.org/10.1007/3-540-46766-1_36

Displaying results 1 to 50 out of 669

1

Revised 02.09.2024

-

Marianne Dammand Iversen