Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Damgård, I. B. & Dupont, K. (2005). Efficient Threshold RSA Signatures with General Moduli and no Extra Assumptions. In S. Vaudenay (Ed.), Public Key Cryptography - PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005. Proceedings (pp. 346-361). Springer. https://doi.org/10.1007/978-3-540-30580-4_24

Zhao, Y., Nielsen, J. B., Deng, R. H. & Feng, D. (2005). Generic yet Practical ZK Arguments from any Public-Coin HVZK. Electronic Colloquium on Computational Complexity, (TR05-162), 1-16.

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

Pagter, J. I., Toft, T., Damgård, I. B., Bogetoft, P., Nielsen, K. & Jakobsen, T. (2005). Secure Computing, Economy, and Trust - A Generic Solution for Secure Auctions with Real-World Applications. B R I C S Report Series, (RS-05-18), 1-35.

Damgård, I. B., Cramer, R. & Ishai, Y. (2005). Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. In J. Killian (Ed.), Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005. Proceedings (pp. 342-362). Springer. https://doi.org/10.1007/978-3-540-30576-7_19

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

Canetti, R., Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2004). Adaptive versus Non-Adaptive Security of Multi-Party Protocols. Journal of Cryptology, 17(3), 153-207. https://doi.org/10.1007/s00145-004-0135-x

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. & Cramer, R. (2004). Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. In M. Naor (Ed.), Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004. Proceedings (pp. 223-237). Springer. https://doi.org/10.1007/978-3-540-24638-1_13

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

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

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.

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

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

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. (2003). Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers. In A. Lingas & B. J. Nilsson (Eds.), Fundamentals of Computation Theory (pp. 109-117). Springer. https://doi.org/10.1007/978-3-540-45077-1_11

Damgård, I. B. & Groth, J. (2003). Non-interactive and Reusable Non-malleable Commitment Schemes. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (pp. 426-437). Association for Computing Machinery. https://doi.org/10.1145/780542.780605

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

Canetti, R., Krawczyk, H. & Nielsen, J. B. (2003). Relaxing Chosen-Ciphertext Security. In D. Boneh (Ed.), Advances in Cryptology - CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings (pp. 565-582). Springer. https://doi.org/10.1007/978-3-540-45146-4_33

Damgård, I. B. & Jurik, M. J. (2003). Scalable Key-Escrow. B R I C S Report Series, (RS-03-22).

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

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

Damgård, I. B. & Jurik, M. J. (2002). Client/Server Tradeoffs for On-line Elections. In D. Naccache & P. Pailier (Eds.), Public Key Cryptography: 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 Paris, France, February 12-14, 2002 Proceedings (pp. 125-140). Springer. https://doi.org/10.1007/3-540-45664-3_9

Damgård, I. B. & Nielsen, J. B. (2002). Expanding Pseudorandom Functions: or: From Known-Plaintext Security to Chosen-Plaintext Security. In M. Yung (Ed.), Advances in Cryptology - CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings (pp. 449-464). Springer. https://doi.org/10.1007/3-540-45708-9_29

Damgård, I. B. & Koprowski, M. (2002). Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. In L. R. Knudsen (Ed.), Advances in Cryptology - EUROCRYPT 2002: International Conference on the Theory and Applications of Cryptographic Techniques Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings (pp. 256-271). Springer. https://doi.org/10.1007/3-540-46035-7_17

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

Nielsen, J. B. (2002). Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-Committing Encryption Case. In M. Yung (Ed.), Advances in Cryptology — CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings (pp. 191-214). Springer. https://doi.org/10.1007/3-540-45708-9_8

Damgård, I. B., Groth, J., Salomonsen, G. & Gritzalis, D. (Ed.) (2002). The Theory and Implementation of Electronic Voting Systems. In Secure Electronic Voting (Vol. 7, pp. 77-100). Kluwer Academic Publishers.

Damgård, I. B. & Jurik, M. J. (2001). A Generalisation, a Simplification and some Applications of Paillier's Probabilistic Public-Key System. In K. Kim (Ed.), Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13-15, 2001 Proceedings (pp. 119-136). Springer. https://doi.org/10.1007/3-540-44586-2_9

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

Nielsen, P. M., Schori, C., Sørensen, J. L., Salvail, L., Damgård, I. B. & Polzik, E. S. (2001). Experimental quantum key distribution with proven security against realistic attacks. Journal of Modern Optics, 48, 1921-1942.

Damgård, I. B. & Nielsen, J. B. (2001). From Known-Plaintext Security to Chosen-Plaintext Security. B R I C S Report Series, (RS-01-43).

Cramer, R., Damgård, I. B. & Nielsen, J. B. (2001). Multiparty Computation from Threshold Homomorphic Encryption. In B. Pfitzmann (Ed.), Advances in Cryptology - EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 280-300). Springer. https://doi.org/10.1007/3-540-44987-6_18

Nielsen, J. B. (2001). Non-Committing Encryption is Too Easy in the Random Oracle Model. B R I C S Report Series, (RS-01-47).

Canetti, R., Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2001). On Adaptive vs. Non-adaptive Security of Multiparty Protocols. In B. Pfitzmann (Ed.), Advances in Cryptology --- EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 262-279). Springer. https://doi.org/10.1007/3-540-44987-6_17

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

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. & Koprowski, M. (2001). Practical Threshold RSA Signatures Without a Trusted Dealer. In B. Pfitzmann (Ed.), Advances in Cryptology - EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 152-165). Springer. https://doi.org/10.1007/3-540-44987-6_10

Cramer, R. & Damgård, I. B. (2001). Secure Distributed Linear Algebra in a Constant Number of Rounds. In J. Killian (Ed.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 119-137). Springer. https://doi.org/10.1007/3-540-44647-8_7

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

Cramer, R., Damgård, I. B. & MacKenzie, P. (2000). Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions. In H. Imai & Y. Zheng (Eds.), Public Key Cryptography: Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings (pp. 354-373). Springer. https://doi.org/10.1007/978-3-540-46588-1_24

Cramer, R., Damgård, I. B. & Maurer, U. (2000). General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. 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. 316-334). Springer. https://doi.org/10.1007/3-540-45539-6_22

Damgård, I. B. & Nielsen, J. B. (2000). Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In M. Bellare (Ed.), Advances in Cryptology - CRYPTO 2000: 20th Annual International Cryptology Conference Santa Barbara, California, USA, August 20-24, 2000 Proceedings (pp. 432-450). Springer. https://doi.org/10.1007/3-540-44598-6_27

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

Boyar, J., Damgård, I. B. & Peralta, R. (2000). Short Non-Interactive Cryptographic Proofs. Journal of Cryptology, 13(4), 449-472. https://doi.org/10.1007/s001450010011

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

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

Cramer, R., Damgård, I. B., Dziembowski, S., Hirt, M. & Rabin, T. (1999). Efficient Multiparty Computations Secure Against an Adaptive Adversary. 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. 311-326). Springer. https://doi.org/10.1007/3-540-48910-X_22

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

Displaying results 501 to 550 out of 592

11

Revised 02.09.2025

-

Marianne Dammand Iversen