Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

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

Damgård, I. B. (Ed.) (1991). Advances in Cryptology - EUROCRYPT '90: Workshop on the Theory and Application of Cryptographic Techniques Aarhus, Denmark, May 21-24, 1990 Proceedings. Springer. Lecture Notes in Computer Science Vol. 473 https://doi.org/10.1007/3-540-46877-3

Damgård, I. B. (1993). Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Preprocessing. In R. A. Rueppel (Ed.), Advances in Cryptology - EUROCRYPT' 92: Workshop on the Theory and Application of Cryptographic Techniques Balatonfüred, Hungary, May 24-28, 1992 Proceedings (pp. 341-355). Springer. https://doi.org/10.1007/3-540-47555-9_28

Damgård, I. B. & Knudsen, L. R. (1994). The breaking of the AR Hash Function. In T. Helleseth (Ed.), Advances in Cryptology - EUROCRYPT '93: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23-27, 1993 Proceedings Springer. https://doi.org/10.1007/3-540-48285-7_25

Damgård, I. B. (1994). Practical and Provably Secure Release of a Secret and Exchange of Signatures. In T. Helleseth (Ed.), Advances in Cryptology - EUROCRYPT '93: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23-27, 1993 Proceedings (pp. 200-217). Springer. https://doi.org/10.1007/3-540-48285-7_17

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. (1994). Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract). 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. 100-109). Springer. https://doi.org/10.1007/3-540-48329-2_9

Damgård, I. B. (1995). Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology, 8(4), 201-222. https://doi.org/10.1007/BF00191356

Damgård, I. B. & Knudsen, L. R. (1996). Multiple encryption with minimum key. In E. Dawson & J. Golic (Eds.), Cryptography: Policy and Algorithms: International Conference Brisbane, Queensland, Australia, July 3-5, 1995 Proceedings (pp. 156-164). Springer. https://doi.org/10.1007/BFb0032355

Damgård, I. B., Goldreich, O., Okamoto, T. & Wigderson, A. (1995). Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. In D. Coppersmith (Ed.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (pp. 325-338). Springer. https://doi.org/10.1007/3-540-44750-4_26

Damgård, I. B. & Pedersen, T. P. (1996). New Convertible Undeniable Signature Schemes. In U. Maurer (Ed.), Advances in Cryptology - EUROCRYPT '96: International Conference on the Theory and Application of Cryptographic Techniques Saragossa, Spain, May 12-16, 1996 Proceedings (pp. 372-386). Springer. https://doi.org/10.1007/3-540-68339-9_32

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

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., Pedersen, T. P. & Pfitzmann, B. (1998). Statistical secrecy and multibit commitments. I E E E Transactions on Information Theory, 44(3), 1143-1151. https://doi.org/10.1109/18.669255

Damgård, I. B. (Ed.) (1999). Lectures on Data Security: Modern Cryptology in Theory and Practice. Springer. Lecture Notes in Computer Science Vol. 1561 https://doi.org/10.1007/3-540-48969-X

Damgård, I. B. (1999). Commitment Schemes and Zero-Knowledge Protocols. In I. B. Damgård (Ed.), Lectures on Data Security: Modern Cryptology in Theory and Practice (pp. 63-86). Springer. https://doi.org/10.1007/3-540-48969-X_3

Damgård, I. B. & Pfitzmann, B. (1998). Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP. In K. G. Larsen, S. Skyum & G. Winskel (Eds.), Automata, Languages and Programming: 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13-17, 1998 Proceedings (pp. 772-783). Springer. https://doi.org/10.1007/BFb0055101

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., 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. (2000). Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In B. Preneel (Ed.), Advances in Cryptology - EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings (pp. 418-430). Springer. https://doi.org/10.1007/3-540-45539-6_30

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., Jurik, M. J. & Nielsen, J. B. (2010). A generalization of Paillier's public-key system with applications to electronic voting. International Journal of Information Security, 9(6), 371-385. https://doi.org/10.1007/s10207-010-0119-9

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. & Orlandi, C. (2010). Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. Lecture Notes in Computer Science, 6223, 558-576. https://doi.org/10.1007/978-3-642-14623-7_30

Damgård, I. B. & Keller, M. (2010). Secure Multiparty AES. Lecture Notes in Computer Science, 6052, 367-374. https://doi.org/10.1007/978-3-642-14577-3_31

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., Fitzi, M., Nielsen, J. B. & Toft, T. (2005). How to Split a Shared Secret into Shared Bits in Constant-Round. Cryptology ePrint Archive. http://eprint.iacr.org/2005/140.pdf

Damgård, I. B., Funder, J. L., Nielsen, J. B. & Salvail, L. (2011). Superposition Attacks on Cryptographic Protocols. http://arxiv.org/abs/1108.6313v1

Damgård, I. B., Hazay, C. & Patra, A. (2012). Leakage Resilient Secure Two-Party Computation. http://eprint.iacr.org/2011/256

Damgård, I. B., Faust, S. & Hazay, C. (2011). Secure Two-Party Computation with Low Communication. http://eprint.iacr.org/2011/508

Damgård, I. B., Pastro, V., Smart, N. & Zakarias, S. N. H. (2011). Multiparty Computation from Somewhat Homomorphic Encryption. http://eprint.iacr.org/2011/535

Damgård, I. B., Kölker, J. & Toft, T. (2012). Secure Computation, I/O-Efficient Algorithms and Distributed Signatures. Lecture Notes in Computer Science, 7178, 278-295 . https://doi.org/10.1007/978-3-642-27954-6_18

Damgård, I. B., Pastro, V., Smart, N. & Zakarias, S. N. H. (2012). Multiparty computation from somewhat homomorphic encryption. Lecture Notes in Computer Science, 7417, 643-662. https://doi.org/10.1007/978-3-642-32009-5_38

Damgård, I. B., Keller, M., Keller, E., Miles, C. & Smart, N. P. (2012). Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol. Lecture Notes in Computer Science, 7485, 241-263. https://doi.org/10.1007/978-3-642-32928-9_14

Damgård, I. B., Kölker, J., Faust, S. & Hazay, C. (2012). Secure Two-Party Computation with Low Communication. Lecture Notes in Computer Science, 7194, 54-74 . https://doi.org/10.1007/978-3-642-28914-9_4

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

Damgård, I. B. & Zakarias, S. N. H. (2012). Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. Cryptology ePrint Archive. http://eprint.iacr.org/2012/512

Damgård, I. B., Kölker, J. & Miltersen, P. B. (2012). Secret Sharing and Secure Computing from Monotone Formulae. http://eprint.iacr.org/2012/536

Damgård, I. B. & Park, S. (2012). Is Public-Key Encryption Based on LPN Practical? http://eprint.iacr.org/2012/699

Damgård, I. B. (2011). Quantum Communication Attacks on Classical Cryptographic Protocols. Abstract from 5th International Conference on Information Theoretic Security, Amsterdam, Netherlands. https://doi.org/10.1007/978-3-642-20728-0_16

Damgård, I. B. & Zakarias, S. (2013). Constant-overhead secure computation of Boolean circuits using preprocessing. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 621-641). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_35

Damgård, I. B., Keller, M., Larraia , E., Pastro, V., Scholl, P. & Smart, N. P. (2013). Practical Covertly Secure MPC for Dishonest Majority – or: Breaking the SPDZ Limits. In J. Crampton , S. Jajodia & K. Mayes (Eds.), Computer Security – ESORICS 2013: 18th European Symposium on Research in Computer Security, Egham, UK, September 9-13, 2013. Proceedings (pp. 1-18 ). Springer VS. https://doi.org/10.1007/978-3-642-40203-6_1

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. 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., Funder, J., Nielsen, J. B. & Salvail, L. (2014). Superposition attacks on cryptographic protocols. In C. Padró (Ed.), Information Theoretic Security: 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings (pp. 142-161). Springer. https://doi.org/10.1007/978-3-319-04268-8_9

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2013). Tamper Resilient Cryptography Without Self-Destruct. IACR Cryptology ePrint Archive, (2013). http://eprint.iacr.org/2013/124

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

Damgård, I. B., David, B. M., Giacomelli, I. & Nielsen, J. B. (2014). Compact VSS and Efficient Homomorphic UC Commitments. In P. Sarkar & T. Iwata (Eds.), Advances in Cryptology – ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014, Proceedings, Part II (pp. 213-232 ). Springer VS. https://doi.org/10.1007/978-3-662-45608-8_12

Damgård, I. B., Pedersen, T. B. & Salvail, L. (2014). How to re-use a one-time pad safely and almost optimally even if P = NP. Natural Computing, 13(4), 469-486. https://doi.org/10.1007/s11047-014-9454-5

Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. (2014). Secure identification and QKD in the bounded-quantum-storage model. Theoretical Computer Science, 560(1), 12-26. https://doi.org/10.1016/j.tcs.2014.09.014

Displaying results 301 to 350 out of 619

7

Revised 26.01.2026

-

Marianne Dammand Iversen