Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. & Pedersen, M. Ø. (2008). RFID Security: Tradeoffs between Security and Efficiency. Lecture Notes in Computer Science, 318-332. https://doi.org/10.1007/978-3-540-79263-5

Damgård, I. B., Hofheinz, D., Kiltz, E. & Thorbek, R. I. (2008). Public-Key Encryption with Non-interactive Opening. Lecture Notes in Computer Science, 239-255. https://doi.org/10.1007/978-3-540-79263-5_15

Damgård, I. B., Krøigaard, M., Ishai, Y., Nielsen, J. B. & Smith, A. (2008). Scalable Multiparty Computation with Nearly Optimal Work and Resilience. Lecture Notes in Computer Science, 5157, 241-261. https://doi.org/10.1007/978-3-540-85174-5_14

Damgård, I. B., Knudsen, L. & Thomsen, S. S. (2008). Dakota- Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography. Lecture Notes in Computer Science, 144-155. https://doi.org/10.1007/978-3-540-68914-0_9

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

Damgård, I. B., Nielsen, J. B. & Orlandi, C. (2009). Essentially Optimal Universally Composable Oblivious Transfer. Lecture Notes in Computer Science, 5461, 1-14. https://doi.org/10.1007/978-3-642-00730-9

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

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

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

Damgård, I. B. & Mikkelsen, G. L. (2010). Efficient, Robust and Constant-Round Distributed RSA Key Generation. Lecture Notes in Computer Science, 5978, 183-200. https://doi.org/10.1007/978-3-642-11799-2_12

Damgård, I. B., Krøigaard, M. & Geisler, M. (2009). A correction to 'efficient and secure comparison for on-line auctions'. International Journal of Applied Cryptography, 1(4), 323-324. https://doi.org/10.1504/IJACT.2009.028031

Damgård, I. B., Fehr, S., Lunemann, C., Salvail, L. & Schaffner, C. (2009). Improving the Security of Quantum Protocols via Commit-and-Open. Lecture Notes in Computer Science, 408-427. https://doi.org/10.1007/978-3-642-03356-8_24

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

Damgård, I. B. & Lunemann, C. (2009). Quantum-Secure Coin-Flipping and Applications. Lecture Notes in Computer Science, 52-69. https://doi.org/10.1007/978-3-642-10366-7_4

Damgård, I. B., Geisler, M. & Nielsen, J. B. (2010). From Passive to Covert Security at Low Cost. Lecture Notes in Computer Science, 5978, 128-145. https://doi.org/10.1007/978-3-642-11799-2_9

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. (1987). Concatenated Group Codes and Their Exponents. I E E E Transactions on Information Theory, Vol. 33, Issue 6.

Damgård, I. B. (1987). Collision Free Hash Functions and Public Key Signature Schemes. In D. Chaum & W. L. Price (Eds.), Advances in Cryptology - EUROCRYPT' 87: Workshop on the Theory and Application of Cryptographic Techniques Amsterdam, The Netherlands, April 13-15, 1987 Proceedings (pp. 203-216). Springer. https://doi.org/10.1007/3-540-39118-5_19

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

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

Damgård, I. B. (1989). A Design Principle for Hash Functions. In G. Brassard (Ed.), Advances in Cryptology - CRYPTO' 89 Proceedings (pp. 416-427). Springer. https://doi.org/10.1007/0-387-34805-0_39

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

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

Displaying results 251 to 300 out of 567

6

Revised 07.03.2025

-

Marianne Dammand Iversen