Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Aranha, D. F., Karabina, K., Longa, P., Gebotys, C. H. & Lopez, J. (2011). Faster Explicit Formulas for Computing Pairings over Ordinary Curves. In K. G. Paterson (Ed.), Advances in Cryptology – EUROCRYPT 2011 (pp. 48-68). Springer. https://doi.org/10.1007/978-3-642-20465-4_5

Lunemann, C. & Nielsen, J. B. (2011). Fully simulatable quantum-secure coin-flipping and applications. Lecture Notes in Computer Science, 6737, 21-40. https://doi.org/10.1007/978-3-642-21969-6_2

Orlandi, C. (2011). Is Multiparty Computation Any Good In Practice? I E E E International Conference on Acoustics, Speech and Signal Processing. Proceedings, 5848-5851. https://doi.org/10.1109/ICASSP.2011.5947691

Bendlin, R., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2011). Lower and Upper Bounds for Deniable Public-Key Encryption. Lecture Notes in Computer Science, 7073, 125-142. https://doi.org/10.1007/978-3-642-25385-0_7

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

Ishai, Y., Kumarasubramanian, A., Orlandi, C. & Sahai, A. (2011). On Invertible Sampling and Adaptive Security. Lecture Notes in Computer Science, 6477, 466-482. https://doi.org/10.1007/978-3-642-17373-8_27

Cramer, R., Damgård, I. B. & Pastro, V. (2011). On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. http://eprint.iacr.org/2011/301

Mikkelsen, G. L. (2011). On the Protection of Digital Identities Through Threshold Cryptography. Department of Computer Science, Aarhus University.

Aranha, D. F., Knapp, E., Menezes, A. & Rodriguez-henriquez, F. (2011). Parallelizing the Weil and Tate Pairings. In L. Chen (Ed.), Cryptography and Coding (pp. 275-295). Springer. https://doi.org/10.1007/978-3-642-25516-8_17

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

Orlandi, C. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.

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

Oliveira, L. B., Kansal, A., Gouvea, C. P. L., Aranha, D. F., Lopez, J., Priyantha, B., Goraczko, M. & Zhao, F. (2011). Secure-TWS: Authenticating Node to Multi-user Communication in Shared Sensor Networks. The Computer Journal, 55(4), 384-396. https://doi.org/10.1093/comjnl/bxr089

Bendlin, R., Damgård, I. B., Orlandi, C. & Zakarias, S. N. H. (2011). Semi-Homomorphic Encryption and Multiparty Computation. Lecture Notes in Computer Science, 6632, 169-188. https://doi.org/10.1007/978-3-642-20465-4_11

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication. In B. Preneel & T. Takagi (Eds.), Cryptographic Hardware and Embedded Systems – CHES 2011 (pp. 108-123). Springer. https://doi.org/10.1007/978-3-642-23951-9_8

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. Journal of Cryptographic Engineering, 1, 187-199. https://doi.org/10.1007/s13389-011-0017-8

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

Aranha, D. F., Dahab, R., Lopez, J. & Oliveira, L. B. (2010). Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications, 4(2), 169-187. https://doi.org/10.3934/amc.2010.4.169

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

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

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

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

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

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

Displaying results 451 to 500 out of 627

10

Revised 26.01.2026

-

Marianne Dammand Iversen