Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

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

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets. In M. Abdalla & P. S. L. M. Barreto (Eds.), Progress in Cryptology – LATINCRYPT 2010 (pp. 144-161). Springer. https://doi.org/10.1007/978-3-642-14712-8_9

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

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). High-Speed Parallel Software Implementation of the ηT Pairing. In J. Pieprzyk (Ed.), Topics in Cryptology - CT-RSA 2010 (pp. 89-105). Springer. https://doi.org/10.1007/978-3-642-11925-5_7

Reistad, T. & Toft, T. (2010). Linear, Constant-rounds Bit-decomposition. Lecture Notes in Computer Science, 5984, 245-257. https://doi.org/10.1007/978-3-642-14423-3_17

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

Beerliová-Trubíniová, Z., Hirt, M. & Nielsen, J. B. (2010). On the theoretical gap between synchronous and asynchronous MPC protocols. In A. Richa & R. Guerraoui (Eds.), Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. PODC '10 (pp. 211-218). Association for Computing Machinery. https://doi.org/10.1145/1835698.1835746

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

Dupuis, F., Nielsen, J. B. & Salvail, L. (2010). Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. Lecture Notes in Computer Science, 6223, 685-706. https://doi.org/10.1007/978-3-642-14623-7_37

Bendlin, R. & Damgård, I. B. (2010). Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. Lecture Notes in Computer Science, 5978, 201-218. https://doi.org/10.1007/978-3-642-11799-2_13

Oliveira, L. B., Aranha, D. F., Gouvea, C. P. L., Scott, M., Camara, D. F., Lopez, J. & Dahab, R. (2010). TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks. Computer Communications, 34(3), 485-493. https://doi.org/10.1016/j.comcom.2010.05.013

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

Toft, T. (2009). Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. Lecture Notes in Computer Science, 357-371. https://doi.org/10.1007/978-3-642-00862-7_24

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

Nielsen, J. B. & Orlandi, C. (2009). LEGO for Two-Party Secure Computation. Lecture Notes in Computer Science, 5444, 368-386. https://doi.org/10.1007/978-3-642-00457-5_22

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

Fitzi, M. & Nielsen, J. B. (2009). On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. Lecture Notes in Computer Science, 5805, 449-463. https://doi.org/10.1007/978-3-642-04355-0_46

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

Miltersen, P. B., Nielsen, J. B. & Triandopoulos, N. (2009). Privacy-Enhancing Auctions Using Rational Cryptography. Lecture Notes in Computer Science, 5677, 541-558. https://doi.org/10.1007/978-3-642-03356-8_32

Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I. & Toft, T. (2009). Privacy-Preserving Face Recognition. Lecture Notes in Computer Science, 235-253. https://doi.org/10.1007/978-3-642-03168-7_14

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

Reistad, T. & Toft, T. (2009). Secret Sharing Comparison by Transformation and Rotation. Lecture Notes in Computer Science, 169-180. https://doi.org/10.1007/978-3-642-10230-1_14

Bøgetoft, P., Lund Christensen, D., Damgård, I. B., Geisler, M., Jacobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J. I., Schwartzbach, M. I., Toft, T. & Nielsen, K. (2009). Secure Multiparty Computation Goes Live. Lecture Notes in Computer Science, 5628, 325-343. https://doi.org/10.1007/978-3-642-03549-4_20

Toft, T. (2009). Solving Linear Programs Using Multiparty Computation. Lecture Notes in Computer Science, 5628, 90-107. https://doi.org/10.1007/978-3-642-03549-4_6

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

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. (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., Serge, F., Schaffner, C. & Salvail, L. (2008). Cryptography in the Bounded Quantum-Storage Model. S I A M Journal on Computing, 37(6), 1865-1890. https://doi.org/10.1137/060651343

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., Geisler, M. & Krøigaard, M. (2008). Homomorphic encryption and secure comparison. International Journal of Applied Cryptography, 1(1), 22-31. https://doi.org/10.1504/IJACT.2008.017047

Damgård, I. B., Nielsen, J. B. & Wichs, D. (2008). Isolated Proofs of Knowledge and Isolated Zero Knowledge. Lecture Notes in Computer Science, 4965, 509-526. https://doi.org/10.1007/978-3-540-78967-3_29

Harnik, D., Ishai, Y., Kushilevitz, E. & Nielsen, J. B. (2008). OT-Combiners Via Secure Computation. Lecture Notes in Computer Science, 4948, 393-411. https://doi.org/10.1007/978-3-540-78524-8_22

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. & 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., 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. & Toft, T. (2008). Trading Sugar Beet Quotas - Secure Multiparty Computation in Practice. ERCIM News, 73, 32-33.

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

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., Krøigaard, M. & Geisler, M. J. (2007). Efficient and Secure Comparison for On-Line Auctions. In J. Pieprzyk, H. Ghodosi & E. Dawson (Eds.), Information Security and Privacy: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007. Proceedings (Vol. 4586, pp. 416-430). Springer. https://doi.org/10.1007/978-3-540-73458-1_30

Fitzi, M., Nielsen, J. B. & Wolf, S. (2007). How to Share a Key (Invited paper). Paper presented at 45th Annual Allerton Conference on Communication, Control, and Computing, 2007, Urbana-Champaign, United States.

Damgård, I. B. & Thorbek, R. (2007). Non-interactive Proofs for Integer Multiplication. 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. 412-429). Springer. https://doi.org/10.1007/978-3-540-72540-4_24

Toft, T. (2007). Primitives and Applications for Multi-party Computation. Department of Computer Science, Aarhus University. Daimi PhD Dissertation No. PD-07-7

Damgård, I. B. & Nielsen, J. B. (2007). Scalable and Unconditionally Secure Multiparty Computation. In A. Menezes (Ed.), Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (pp. 572-590). Springer. https://doi.org/10.1007/978-3-540-74143-5_32

Damgård, I. B., Salvail, L., Schaffner, C. & Fehr, S. (2007). Secure Identification and QKD in the Bounded-Quantum-Storage Model. In A. Menezes (Ed.), Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (pp. 342-359). Springer. https://doi.org/10.1007/978-3-540-74143-5_19

Displaying results 451 to 500 out of 624

10

Revised 04.10.2023

-

Marianne Dammand Iversen