Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Sort by: Date | Author | Title

Dahl, M. & Damgård, I. B. (2013). Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption. Cryptology ePrint Archive. http://eprint.iacr.org/2013/296.pdf

Dahl, M. & Damgård, I. B. (2014). Universally composable symbolic analysis for two-party protocols based on homomorphic encryption. In P. Q. Nguyen & E. Oswald (Eds.), Advances in Cryptology – EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings (pp. 695-712). Springer VS. https://doi.org/10.1007/978-3-642-55220-5_38

Chakraborty, S., Magri, B., Nielsen, J. B. & Venturi, D. (2022). Universally Composable Subversion-Resilient Cryptography. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 272-302). Springer. https://doi.org/10.1007/978-3-031-06944-4_10

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.

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

David, B. M., Dowsley, R. & Nascimento, A. C. A. (2014). Universally composable oblivious transfer based on a variant of lPN. In D. Gritzalis, A. Kiayias & I. Askoxylakis (Eds.), Cryptology and Network Security: 13th International Conference, CANS 2014, Heraklion, Crete, Greece, October 22-24, 2014. Proceedings (pp. 143-158). Springer. https://doi.org/10.1007/978-3-319-12280-9_10

Mechler, J., Müller-Quade, J. & Nilges, T. (2016). Universally Composable (Non-Interactive) Two-Party Computation from Untrusted Reusable Hardware Tokens. http://eprint.iacr.org/2016/615

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

Strzebonski, A. & Tsigaridas, E. (2011). Univariate real root isolation in an extension field. In Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation (pp. 321-328). Association for Computing Machinery. https://doi.org/10.1145/1993886.1993934

de Montjoye, Y.-A., Radaelli, L., Singh, V. K. & Pentland, A. S. (2015). Unique in the shopping mall: On the reidentifiability of credit card metadata. Science, 347(6221), 536-539. https://doi.org/10.1126/science.1256297

Hilker, R., Sickinger, C., Pedersen, C. N. S. & Stoye, J. (2012). UniMoG - A unifying framework for genomic distance calculation and sorting based DCJ. Bioinformatics, 28(19), 2509-2511. https://doi.org/10.1093/bioinformatics/bts440

Bouvin, N. O. (1999). Unifying strategies for Web augmentation. In J. Westbomke, U. K. Wiil, J. J. Leggett, K. Tochtermann & J. M. Haake (Eds.), Proceedings of the tenth ACM Conference on Hypertext and hypermedia: returning to our diverse roots (pp. 91-100). Association for Computing Machinery. https://doi.org/10.1145/294469.294493

Turon, A., Dreyer , D. & Birkedal, L. (2013). Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency. In G. Morrisett & T. Uustalu (Eds.), Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP '13 (pp. 377-390 ). Association for Computing Machinery. https://doi.org/10.1145/2500365.2500600

Křivánek, J., Georgiev, I., Hachisuka, T., Vévoda, P., Šik, M., Nowrouzezahrai, D. & Jarosz, W. (2014). Unifying Points, Beams, and Paths in Volumetric Light Transport Simulation. A C M Transactions on Graphics, 33(4), Article 13. https://doi.org/10.1145/2601097.2601219

Aagaard, F. L., Kristensen, M., Gratzer, D. & Birkedal, L. (2022). Unifying Cubical and Multimodal Type Theory. Abstract from 28th International Conference on Types for Proofs and Programs, Nantes, France. https://types22.inria.fr/files/2022/06/TYPES_2022_paper_35.pdf

Torgersen, M. (2001). Unifying Abstractions. (DAIMI PhD Dissertation PD-01-2 ed.) Department of Computer Science.

Hansen, M. T., Jurdak, R. & Kusy, B. (2011). Unified broadcast in sensor networks. In 10th International Conference on Information Processing in Sensor Networks (IPSN), 2011 (pp. 306-317). IEEE Computer Society Press. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5779047

Saad-Sulonen, J., Halskov, K., Eriksson, E., Vines, J., Huybrechts, L. & Karasti, T. H. (2015). Unfolding Participation: What do we mean by participation – conceptually and in practice. Aarhus Series on Human Centered Computing , 1(1). https://doi.org/10.7146/aahcc.v1i1.21324

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

Berlin, R. & Klokmose, C. N. (2007). Undo in Dynamic and Distributed User Interfaces. Poster session presented at Danish HCI Research Symposium, DHRS 2007, København, Denmark.

Beldiceanu, N., Katriel, I. & Lorca, X. (2006). Undirected Forest Constraints. In Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006) (Vol. LNCS 3990, pp. 29-43). Springer.

Januzelli, J., Roy, L. & Xu, J. (2025). Under What Conditions Is Encrypted Key Exchange Actually Secure? In S. Fehr & P.-A. Fouque (Eds.), Advances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques: Proceedings (pp. 451-481). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-91124-8_16

Korn, M. (2010). Understanding Use Situated in Real-world Mobile Contexts. Paper presented at ACM Conference on Ubiquitous Computing. Ubicomp '10, København, Denmark. http://mkorn.binaervarianz.de/pub/ubicomp2010-ws.pdf

Chundury, P., Thakkar, U., Reyazuddin, Y., Jordan, J. B., Elmqvist, N. & Lazar, J. (2024). Understanding the Visualization and Analytics Needs of Blind and Low-Vision Professionals. In ASSETS 2024 - Proceedings of the 26th International ACM SIGACCESS Conference on Computers and Accessibility Article 111 Association for Computing Machinery. https://doi.org/10.1145/3663548.3688496

Van Oosterhout, A. (2019). Understanding the benefits and drawbacks of shape change in contrast or addition to other modalities. In DIS 2019 Companion - Companion Publication of the 2019 ACM Designing Interactive Systems Conference (pp. 113-116). Association for Computing Machinery. https://doi.org/10.1145/3301019.3324875

Bødker, S. (1998). Understanding representations in design. Human-Computer Interaction, 13(2), 107-125. https://doi.org/10.1207/s15327051hci1302_1

Teli, M., Rossitto, C., Lewkowicz, M. & Bødker, S. (2021). Understanding, Promoting, and Designing for Sustainable Appropriation of Technologies by Grassroots Communities. Towards a new wave of technological activism: Sustainable Appropriation of Technologies by Grassroots Communities. In C&T '21: Proceedings of the 10th International Conference on Communities & Technologies - Wicked Problems in the Age of Tech (pp. 332-335). Association for Computing Machinery. https://doi.org/10.1145/3461564.3468163

Bertelsen, O. W. (1997). Understanding objects in use-oriented design. In K. Braa & E. Monteiro (Eds.), Proceedings of the 20th Information Systems Research Seminar in Scandinavia (pp. 311-324)

Bødker, S. (1996). Understanding computer applications in use - a human activity analysis. In P. Bøgh Andersen, B. Holmquist, H. Klein & R. Possner (Eds.), Signs at work (pp. 325-348). De Gruyter.

Grönvall, E. & Verdezoto, N. (2013). Understanding Challenges and Opportunities of Preventive Blood Pressure Self-Monitoring at Home. In P. Palanque , F. Détienne & A. Tricot (Eds.), Proceedings of the 31st European Conference on Cognitive Ergonomics (ACM ECCE 2013) Association for Computing Machinery. https://doi.org/10.1145/2501907.2501962

Larsen-Ledet, I. (2020). Understanding and Supporting Collaborative Academic Writing as a Fragmented Process. Paper presented at The ECSCW 2019 Doctoral Colloquium, Salzburg, Austria. https://doi.org/10.18420/ecscw2019_dc6

Ciolfi, L., Cooke, M., Bertelsen, O. W. & Bannon, L. J. (2005). Understanding and Designing for Aesthetic Experience. In L. MacKinnon, O. Bertelsen & N. Bryan-Kinns (Eds.), The 19th British HCI Group Annual Conference (pp. 289-291). The British Computer Society.

Li, Y., Tan, T. & Xue, J. (2019). Understanding and analyzing Java reflection. ACM Transactions on Software Engineering and Methodology, 28(2), Article 7. https://doi.org/10.1145/3295739

Asilis, J., Høgsgaard, M. M. & Velegkas, G. (2025). Understanding Aggregations of Proper Learners in Multiclass Classification. Proceedings of Machine Learning Research, 272, 89-111.

Møller-Nielsen, P. (2022). Undersøgelser omkring analyse og manipulation af musik og tale: En antologi.

Kavvos, G. A. & Gratzer, D. (2023). Under Lock and Key: A Proof System for a Multimodal Logic. Bulletin of Symbolic Logic, 29(2), 264-293. https://doi.org/10.1017/bsl.2023.14

Jurdzinski, M., Nielsen, M. & Srba, J. (2003). Undecidability of Domino Games and Hhp-Bisimilarity. Information and Computation, 184(2), 343-368. https://doi.org/10.1016/S0890-5401(03)00064-6

Thiel, S. K. (2018). Uncovering the influence of game components on creativity. In CHI PLAY 2018 - Proceedings of the 2018 Annual Symposium on Computer-Human Interaction in Play Companion Extended Abstracts (pp. 637-645). Association for Computing Machinery. https://doi.org/10.1145/3270316.3271515

Tsirogiannis, C. & Tsirogiannis, C. (2016). Uncovering the Hidden Routes: Algorithms for Identifying Paths and Missing Links in Trade Networks . In T. Brughmans, A. Collar & F. Coward (Eds.), The Connected Past: Challenges to Network Studies in Archaeology and History Oxford University Press.

David, B. M., Dowsley, R., van der Graaf, J., Marques, D., Nascimento, A. C. A. & Pinto, A. (2015). Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra. I E E E Transactions on Information Forensics and Security, 11(1), 59 - 73 . https://doi.org/10.1109/TIFS.2015.2476783

Meldgaard, S. T. (2013). Unconditionally Secure Protocols. Institut for Datalogi, Aarhus Universitet.

Damgård, I. B., Nielsen, J. B., Toft, T., Kiltz, E. & Fitzi, M. (2006). Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In S. Halevi & T. Rabin (Eds.), Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings (pp. 285-304). Springer. https://doi.org/10.1007/11681878_15

Damgård, I., Nielsen, J. B., Ostrovsky, R. & Rosén, A. (2016). Unconditionally secure computation with reduced interaction. In M. Fischlin & J.-S. Coron (Eds.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. 9666, pp. 420-447). Springer VS. https://doi.org/10.1007/978-3-662-49896-5_15

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., Dupont, K. & Pedersen, M. Ø. (2006). Unclonable Group Identification. In S. Vaudenay (Ed.), Advances in Cryptology - EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006. Proceedings (pp. 555-572). Springer. https://doi.org/10.1007/11761679_33

Christensen, H. B. (2019). Uncle Henrik’s Clean Code Principles.

Kyng, M. & Mathiassen, L. (1976). Udkast til ansøgning om projekttilskud fra Teknologirådet.

Moradan, A., Draganov, A., Mottin, D. & Assent, I. (2021). UCoDe: Unified Community Detection with Graph Convolutional Networks. ArXiv. https://doi.org/10.48550/arXiv.2112.14822

Moradan, A., Draganov, A., Mottin, D. & Assent, I. (2023). UCoDe: unified community detection with graph convolutional networks. Machine Learning, 112(12), 5057-5080. https://doi.org/10.1007/s10994-023-06402-0

Displaying results 251 to 300 out of 5680

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University