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

Guimaraes, A., Borin, E. & Aranha, D. F. (2022). MOSFHET: Optimized Software for FHE over the Torus. Abstract from 5th Homomorphic Encryption Standards Meeting, Geneva, Switzerland.

Braun, L., Demmler, D., Schneider, T. & Tkachenko, O. (2022). MOTION – A Framework for Mixed-Protocol Multi-Party Computation. ACM Transactions on Privacy and Security, 25(2), Article 8. https://doi.org/10.1145/3490390

Baum, C., Braun, L., Munch-Hansen, A. & Scholl, P. (2022). MozZ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs over Z2k. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 329-358). Springer. https://doi.org/10.1007/978-3-031-15985-5_12

Scholl, P., Simkin, M. & Siniscalchi, L. (2022). Multiparty Computation with Covert Security and Public Verifiability. In D. Dachman-Soled (Ed.), 3rd Conference on Information-Theoretic Cryptography, ITC 2022 Article 8 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2022.8

Dahl, J. F., Gregersen, S. B., Andersen, U., Schulz, H.-J., Madsen, J., Sode, L. & Corredig, M. (2022). Multiple techniques to characterize high protein anisotropic structures. Abstract from 5th Food Structure and Functionality Symposium, Cork, Ireland.

Dahl, J. F., Gregersen, S. B., Andersen, U., Schulz, H.-J., Madsen, J., Sode, L. & Corredig, M. (2022). New methodological approaches to study anisotropic structures in foods. Abstract from 36th EFFoST International Conference, Dublin.

Ganesh, C., Khoshakhlagh, H. & Parisella, R. (2022). NIWI and New Notions of Extraction for Algebraic Languages. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 687-710). Springer. https://doi.org/10.1007/978-3-031-14791-3_30

Daniel, G. (2022). Normalization for Multimodal Type Theory. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022 Article 2 Association for Computing Machinery. https://doi.org/10.1145/3531130.3532398

Boschini, C., Damgård, I. & Orlandi, C. (2022). On Access Control Encryption Without Sanitization. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 220-243). Springer. https://doi.org/10.1007/978-3-031-14791-3_10

Afshani, P., de Berg, M., Buchin, K., Gao, J., Löffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Yang, H. T. (2022). On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.2

Esteves, A., Bouquet, E., Pfeuffer, K. & Alt, F. (2022). One-handed Input for Mobile Devices via Motion Matching and Orbits Controls. Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, 6(2), 1-24. Article 51. https://doi.org/10.1145/3534624

Gkountouna, O., Doka, K., Xue, M., Cao, J. & Karras, P. (2022). One-off Disclosure Control by Heterogeneous Generalization. In 31st USENIX Security Symposium (USENIX Security 22) (pp. 3363-3377). USENIX - The Advanced Computing Systems Association. https://www.usenix.org/conference/usenixsecurity22/presentation/gkountouna

Afshani, P. & Cheng, P. (2022). On Semialgebraic Range Reporting. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.3

Simkin, M., Siniscalchi, L. & Yakoubov, S. (2022). On Sufficient Oracles for Secure Computation with Identifiable Abort. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 494-515). Springer. https://doi.org/10.1007/978-3-031-14791-3_22

Orlandi, C., Ravi, D. & Scholl, P. (2022). On the Bottleneck Complexity of MPC with Correlated Randomness. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 194-220). Springer. https://doi.org/10.1007/978-3-030-97121-2_8

Berthelsen, M. L. T. & Hansen, K. A. (2022). On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. Theory of Computing Systems, 66(3), 519-545. https://doi.org/10.1007/s00224-022-10080-1

Van Bergerem, S., Grohe, M. & Ritzert, M. (2022). On the Parameterized Complexity of Learning First-Order Logic. In PODS 2022 - Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 337-346). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524151

Limaye, N., Srinivasan, S. & Tavenas, S. (2022). On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. In S. Lovett (Ed.), 37th Computational Complexity Conference, CCC 2022 Article 32 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CCC.2022.32

Logins, A., Li, Y. & Karras, P. (2022). On the Robustness of Diffusion in a Network under Node Attacks. IEEE Transactions on Knowledge and Data Engineering, 34(12), 5884-5895. https://doi.org/10.1109/TKDE.2021.3071081

Zhong, Z., Jiang, Y. & Mottin, D. (2022). On the Robustness of Post-hoc GNN Explainers to Label Noise. Paper presented at Learning on Graphs Conference 2022.

Curticapean, R., Limaye, N. & Srinivasan, S. (2022). On the VNP-Hardness of Some Monomial Symmetric Polynomials. In A. Dawar & V. Guruswami (Eds.), 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022 Article 16 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.16

Bilstrup, K.-E. K., Kaspersen, M. H., Sørensen, M.-L. S. K. & Petersen, M. G. (2022). Opportunities and Challenges of Teaching Machine Learning as a Design Material with the micro:bit. In Participative Computing for Sustainable Futures : Adjunct Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI’22) (pp. 1-6). Article 45 Association for Computing Machinery. https://doi.org/10.1145/3547522.3547689

Bartal, Y., Fandina, O. N. & Larsen, K. G. (2022). Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 13 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.13

Larsen, K. G. & Ritzert, M. (2022). Optimal Weak to Strong Learning. arxiv.org. https://doi.org/10.48550/arXiv.2206.01563

Jørgensen, J. R. (2022). Parallel Algorithms for Clustering, Subspace Clustering, and Projected Clustering on the GPU. [PhD thesis, Aarhus University]. Aarhus Universitet.

Schwartzbach, N. I. (2022). Payment Schemes from Limited Information with Applications in Distributed Computing. In EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation (pp. 129-149) https://doi.org/10.1145/3490486.3538342

Alves, P., Nayara Ortiz, J. & Aranha, D. F. (2022). Performance of hierarchical transforms in homomorphic encryption: A case study on logistic regression inference. Abstract from 1st Annual FHE.org Conference on Fully Homomorphic Encryption, Trondheim, Norway.

Liu-Zhang, C.-D., Matt, C., Maurer, U., Rito, G. & Thomsen, S. E. (2022). Practical Provably Secure Flooding for Blockchains. In S. Agrawal & D. Lin (Eds.), Advances in Cryptology – ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, 2022, Proceedings: ASIACRYPT 2022 (pp. 774–805). Springer. https://doi.org/10.1007/978-3-031-22963-3_26

Brodal, G. S. (2022). Priority Queues with Decreasing Keys. In P. Fraigniaud & Y. Uno (Eds.), 11th International Conference on Fun with Algorithms, FUN 2022 (pp. 8:1-8:19). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FUN.2022.8

Aggarwal, D., Obremski, M., Ribeiro, J., Simkin, M. & Siniscalchi, L. (2022). Privacy Amplification with Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Transactions on Information Theory, 68(8), 5475-5495. https://doi.org/10.1109/TIT.2022.3167404

Bidlingmaier, M. E. (2022). Probabilistic Programming and Multiverse Models of Type Theory. [PhD thesis, Aarhus University]. Aarhus Universitet.

Lunding, M. S., Leiva, G., Grønbæk, J. E. & Petersen, M. G. (2022). ProjectAR: Rapid Prototyping of Projection Mapping with Mobile Augmented Reality. Poster session presented at Adjunct Proceedings of the 2022 Nordic Human-Computer Interaction Conference. https://doi.org/10.1145/3547522.3547679

Fleischhacker, N., Larsen, K. G. & Simkin, M. (2022). Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. 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. 764-781). Springer. https://doi.org/10.1007/978-3-031-07085-3_26

Strydonck, T. V., Georges, A. L., Guéneau, A., Trieu, A., Timany, A., Piessens, F., Birkedal, L. & Devriese, D. (2022). Proving full-system security properties under multiple attacker models on capability machines. In Proceedings - 2022 IEEE 35th Computer Security Foundations Symposium, CSF 2022 (pp. 80-95). IEEE. https://doi.org/10.1109/CSF54842.2022.9919645

Baum, C., David, B. & Dowsley, R. (2022). (Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. In C. Ge & F. Guo (Eds.), Provable and Practical Security - 16th International Conference, ProvSec 2022, Proceedings (pp. 249-272). Springer. https://doi.org/10.1007/978-3-031-20917-8_17

Jacobs, K., Devriese, D. & Timany, A. (2022). Purity of an ST monad: Full abstraction by semantically typed back-translation. Proceedings of the ACM on Programming Languages , 6(OOPSLA1), Article 82. https://doi.org/10.1145/3527326

Ganardi, M., Majumdar, R., Pavlogiannis, A., Schütze, L. & Zetzsche, G. (2022). Reachability in Bidirected Pushdown VASS. In M. Bojanczyk, E. Merelli & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Article 124 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.124

Tchernavskij, P., Webb, A. M., Gemeinhardt, H. & Mackay, W. E. (2022). Readymades & Repertoires: Artifact-Mediated Improvisation in Tabletop Role-Playing Games. In C&C '22: Creativity and Cognition (pp. 298-311). Association for Computing Machinery. https://doi.org/10.1145/3527927.3532798

Britz, D., Strutwolf, J. & Østerby, O. (2022). Rectangular electrodes: Simulation of accurate steady state currents and the behaviour of square electrode arrays. Electrochimica Acta, 404, Article 139750. https://doi.org/10.1016/j.electacta.2021.139750

Caragiannis, I., Gravin, N., Lu, P. & Wang, Z. (2022). Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. In M. Feldman, H. Fu & I. Talgam-Cohen (Eds.), Web and Internet Economics : 17th International Conference, WINE 2021 (pp. 131-148). Springer. https://doi.org/10.1007/978-3-030-94676-0_8

Blundo, C., Cimato, S. & Siniscalchi, L. (2022). Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints. The Computer Journal, 65(6), 1386-1411. https://doi.org/10.1093/comjnl/bxaa186

Ciampi, M., Ravi, D., Siniscalchi, L. & Waldner, H. (2022). Round-Optimal Multi-party Computation with Identifiable Abort. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 335-364). Springer. https://doi.org/10.1007/978-3-031-06944-4_12

Seisenberger, M., ter Beek, M. H., Fan, X., Ferrari, A., Haxthausen, A. E., James, P., Lawrence, A., Luttik, B., van de Pol, J. & Wimmer, S. (2022). Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway. In T. Margaria & B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation. Practice - 11th International Symposium, ISoLA 2022, Proceedings (pp. 246-268). Springer. https://doi.org/10.1007/978-3-031-19762-8_20

Hohma Ellen.Hohma@Tum.De, E., Frey, C. M. M., Beer, A. & Seidl, T. (2022). SCAR - Spectral Clustering Accelerated and Robustified. Proceedings of the VLDB Endowment, 15(11), 3031-3044. https://doi.org/10.14778/3551793.3551850

Chillotti, I., Orsini, E., Scholl, P., Smart, N. P. & Leeuwen, B. V. (2022). Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 540-563). Springer. https://doi.org/10.1007/978-3-031-14791-3_24

Goel, A., Hall-Andersen, M., Hegde, A. & Jain, A. (2022). Secure Multiparty Computation with Free Branching. 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. 397-426). Springer. https://doi.org/10.1007/978-3-031-06944-4_14

Kingo Mogensen, T. & Aranha, D. F. (2022). Security analysis of the passwordless MitID digital identity system. Abstract from 27th Nordic Conference on Secure IT Systems (NordSec 2022), Reykjavik, Iceland.

Chakraborty, S., Kayal, C. & Paraashar, M. (2022). Separations Between Combinatorial Measures for Transitive Functions. In M. Bojanczyk, E. Merelli & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Article 36 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.36

Tavenas, S., Limaye, N. & Srinivasan, S. (2022). Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. In S. Leonardi & A. Gupta (Eds.), STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (pp. 416-425). Association for Computing Machinery. https://doi.org/10.1145/3519935.3520044

Sterling, J. & Harper, R. (2022). Sheaf Semantics of Termination-Insensitive Noninterference. In A. P. Felty (Ed.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 Article 5 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2022.5

Displaying results 851 to 900 out of 5895

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University