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

Francati, D., Friolo, D., Malavolta, G. & Venturi, D. (2023). Multi-key and Multi-input Predicate Encryption from Learning with Errors. In C. Hazay & M. Stam (Eds.), Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III (pp. 573-604). Springer. https://doi.org/10.1007/978-3-031-30620-4_19

Caragiannis, I., Garg, J., Rathi, N., Sharma, E. & Varricchio, G. (2023). New Fairness Concepts for Allocating Indivisible Items. In E. Elkind (Ed.), IJCAI '23: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (pp. 2554-2562). Article 284 Association for Computing Machinery.

Blaabjerg, J. F. & Askarov, A. (2023). OblivIO: Securing reactive programs by oblivious execution with bounded traffic overheads. Paper presented at 36th IEEE Computer Security Foundations Symposium, Dubrovnik, Croatia.

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2023). Oblivious Transfer with Constant Computational Overhead. In C. Hazay & M. Stam (Eds.), Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part I (pp. 271-302). Springer. https://doi.org/10.1007/978-3-031-30545-0_10

Bucarelli, M. S., Larsen, M. F., Schwiegelshohn, C. & Toftrup, M. B. (2023). On Generalization Bounds for Projective Clustering.

Bucarelli, M. S., Larsen, M. F., Schwiegelshohn, C. & Toftrup, M. B. (2023). On Generalization Bounds for Projective Clustering. In Advances in Neural Information Processing Systems https://papers.nips.cc/paper_files/paper/2023/hash/e30bf4765ae6b16a87fb4d7b0b3b3dec-Abstract-Conference.html

Cheng, P. (2023). On Geometric Range Searching and Its Variants. Århus Universitet.

Afshani, P., Cheng, P., Basu Roy, A. & Wei, Z. (2023). On Range Summary Queries. In K. Etessami, U. Feige & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (pp. 7:1-7:17). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2023.7

Chakraborty, S., Kayal, C., Mittal, R., Paraashar, M., Sanyal, S. & Saurabh, N. (2023). On the Composition of Randomized Query Complexity and Approximate Degree. In N. Megow & A. Smith (Eds.), Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM 2023 Article 63 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63

Boudgoust, K., Jeudy, C., Roux-Langlois, A. & Wen, W. (2023). On the Hardness of Module Learning with Errors with Short Distributions. Journal of Cryptology, 36(1), Article 1. https://doi.org/10.1007/s00145-022-09441-3

Badrinarayanan, S., Miao, P., Mukherjee, P. & Ravi, D. (2023). On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. In G. N. Rothblum & H. Wee (Eds.), Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part II (Vol. 14370, pp. 124-155). Springer, Cham. https://doi.org/10.1007/978-3-031-48618-0_5

Hall-Andersen, M. N. & Nielsen, J. B. (2023). On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles. In C. Hazay & M. Stam (Eds.), Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23–27, 2023, Proceedings, Part II (pp. 438-469). Springer. https://doi.org/10.1007/978-3-031-30617-4_15, https://doi.org/10.1007/978-3-031-30617-415

Hu, E., Grønbæk, J. E., Houck, A. & Heo, S. (2023). OpenMic: Utilizing Proxemic Metaphors for Conversational Floor Transitions in Multiparty Video Meetings. In A. Schmidt, K. Väänänen, T. Goyal, P. O. Kristensson, A. Peters, S. Mueller, J. R. Williamson & M. L. Wilson (Eds.), CHI'23: Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems Article 793 Association for Computing Machinery. https://doi.org/10.1145/3544548.3581013

Srinivasan, S. & Tripathi, U. (2023). Optimal Explicit Small-Depth Formulas for the Coin Problem. In B. Saha & R. A. Servedio (Eds.), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 881-894). Association for Computing Machinery. https://doi.org/10.1145/3564246.3585238

Shaik, I. & van de Pol, J. (2023). Optimal Layout Synthesis for Quantum Circuits as Classical Planning. In 2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD) IEEE. https://doi.org/10.1109/ICCAD57390.2023.10323924

Tunç, H. C., Abdulla, P. A., Chakraborty, S., Krishna, S., Mathur, U. & Pavlogiannis, A. (2023). Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proceedings of the ACM on Programming Languages , 7(PLDI), 761–785. Article 137. https://doi.org/10.1145/3591251

Mai, T., Munteanu, A., Musco, C., Rao, A. B., Schwiegelshohn, C. & Woodruff, D. P. (2023). Optimal Sketching Bounds for Sparse Linear Regression. Proceedings of Machine Learning Research, 206, 11288-11316. https://proceedings.mlr.press/v206/mai23a.html

Caragiannis, I. & Rathi, N. (2023). Optimizing over Serial Dictatorships. In A. Deligkas & A. Filos-Ratsikas (Eds.), Algorithmic Game Theory: 16th International Symposium, SAGT 2023, Egham, UK, September 4–7, 2023, Proceedings (pp. 329-346). Springer. https://doi.org/10.1007/978-3-031-43254-5_19

Caragiannis, I. & Schwartzbach, N. I. (2023). Outsourcing Adjudication to Strategic Jurors. In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (pp. 2546-2553). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/283

Pfeuffer, K., Obernolte, J., Dietz, F., Mäkelä, V., Sidenmark, L., Manakhov, P., Pakanen, M. & Alt, F. (2023). PalmGazer: Unimanual Eye-hand Menus in Augmented Reality. In T. Huang, M. Sra & F. Argelaguet (Eds.), SUI '23: Proceedings of the 2023 ACM Symposium on Spatial User Interaction (pp. 1–12). Article 11 Association for Computing Machinery. https://doi.org/10.1145/3607822.3614523

Johns, C. A., Evangelista Belo, J. M., Pfeuffer, K. & Klokmose, C. N. (2023). Pareto Optimal Layouts for Adaptive Mixed Reality. In CHI 2023 - Extended Abstracts of the 2023 CHI Conference on Human Factors in Computing Systems Article 223 Association for Computing Machinery. https://doi.org/10.1145/3544549.3585732

Grønbæk, J. E., Pfeuffer, K., Velloso, E., Astrup, M., Pedersen, M. I., Kjær, M., Leiva, G. & Gellersen, H. (2023). Partially Blended Realities: Aligning Dissimilar Spaces for Distributed Mixed Reality Meetings. In A. Schmidt, K. Väänänen, T. Goyal, P. O. Kristensson, A. Peters, S. Mueller, J. R. Williamson & M. L. Wilson (Eds.), CHI '23: Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems Article 456 Association for Computing Machinery. https://doi.org/10.1145/3544548.3581515

Alves, P., Nayara Ortiz, J. & Aranha, D. F. (2023). Performance of hierarchical transforms in homomorphic encryption: a case study on logistic regression inference. Journal of Cryptographic Engineering, 13(3), 295-310. https://doi.org/10.1007/s13389-023-00325-1

Damgård, I., Escudero, D. & Polychroniadou, A. (2023). Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 7:1--7:21). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.7

Airiau, S., Aziz, H., Caragiannis, I., Kruger, J., Lang, J. & Peters, D. (2023). Portioning using ordinal preferences: Fairness and efficiency. Artificial Intelligence, 314, Article 103809. https://doi.org/10.1016/j.artint.2022.103809

Bourneuf, R., Folwarczný, L., Hubáček, P., Rosen, A. & Schwartzbach, N. I. (2023). PPP-Completeness and Extremal Combinatorics. In Y. T. Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference (ITCS 2023) (pp. 1-20). Article 22 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2023.22

Alpos, O., Cachin, C., Kamp, S. H. & Nielsen, J. B. (2023). Practical Large-Scale Proof-Of-Stake Asynchronous Total-Order Broadcast. In J. Bonneau & S. M. Weinberg (Eds.), 5th Conference on Advances in Financial Technologies, AFT 2023 Article 31 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.31

Liu-Zhang, C.-D., Matt, C., Maurer, U., Rito, G. & Thomsen, S. E. (2023). Practical Provably Secure Flooding for Blockchains. In S. Agrawal & D. Lin (Eds.), Advances in Cryptology - ASIACRYPT 2022: ASIACRYPT 2022 (pp. 774–805). Springer. https://doi.org/10.1007/978-3-031-22963-3_26

Sølvsten, S. & van de Pol, J. (2023). Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. In É. André & J. Sun (Eds.), Automated technology for verification and analysis: Part II (pp. 72-92). Springer. https://doi.org/10.1007/978-3-031-45332-8_4

Vanegas, H., Cabarcas, D. & Aranha, D. F. (2023). Privacy-Preserving Edit Distance Computation Using Secret-Sharing Two-Party Computation. In A. Aly & M. Tibouchi (Eds.), Progress in Cryptology – LATINCRYPT 2023: 8th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2023, Quito, Ecuador, October 3–6, 2023, Proceedings (pp. 67-86). Springer. https://doi.org/10.1007/978-3-031-44469-2_4

Madsen, M. & Pol, J. V. D. (2023). Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism. In K. Ali & G. Salvaneschi (Eds.), 37th European Conference on Object-Oriented Programming (ECOOP 2023) Article 18 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.18

Han, W. & Schulz, H.-J. (2023). Providing visual analytics guidance through decision support. Information Visualization, 22(2), 140-165. https://doi.org/10.1177/14738716221147289

Baum, C., Braun, L., Delpech de Saint Guilhem, C., Klooß, M., Orsini, E., Roy, L. D. & Scholl, P. (2023). Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology: CRYPTO 2023 (pp. 581-615). Springer. https://doi.org/10.1007/978-3-031-38554-4_19

Munch-Hansen, A. (2023). Quattro Formaggi: Zero-Knowledge from VOLE. Århus Universitet.

Braun, L., Pancholi, M. R., Rachuri, R. & Simkin, M. (2023). Ramen: Souper Fast Three-Party Computation for RAM Programs. In CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 3284-3297). Association for Computing Machinery. https://doi.org/10.1145/3576915.3623115

Lunding, M. S., Grønbæk, J. E., Grymer, N., Wells, T., Houben, S. & Petersen, M. G. (2023). Reality and Beyond: Proxemics as a Lens for Designing Handheld Collaborative Augmented Reality. Proceedings of the ACM on Human-Computer Interaction, 7(ISS), 21-40. Article 427. https://doi.org/10.1145/3626463

Tommasel, A. & Assent, I. (2023). Recommendation fairness and where to find it: An empirical study on fairness of user recommender systems. In J. He, T. Palpanas, X. Hu, A. Cuzzocrea, D. Dou, D. Slezak, W. Wang, A. Gruca, J. C.-W. Lin & R. Agrawal (Eds.), IEEE International Conference on Big Data, BigData 2023, Sorrento, Italy, December 15-18, 2023 (pp. 4195-4204). IEEE. https://doi.org/10.1109/BIGDATA59044.2023.10386616

Bødker, S., Fox, S., Lalone, N., Marathe, M. & Soden, R. (2023). (Re)Connecting History to the Theory and Praxis of HCI. ACM Transactions on Computer-Human Interaction, 30(2), Article 16. https://doi.org/10.1145/3589804

Afshani, P. & Killmann, R. (2023). Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. Computational Geometry: Theory and Applications, 111, Article 101959. https://doi.org/10.1016/j.comgeo.2022.101959

Francati, D., Friolo, D., Maitra, M., Malavolta, G., Rahimi, A. & Venturi, D. (2023). Registered (Inner-Product) Functional Encryption. In J. Guo & R. Steinfeld (Eds.), Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023, Proceedings, Part V (pp. 98-133). Springer. https://doi.org/10.1007/978-981-99-8733-7_4

Caragiannis, I. & Narang, S. (2023). Repeatedly Matching Items to Agents Fairly and Efficiently. In A. Deligkas & A. Filos-Ratsikas (Eds.), Algorithmic Game Theory: 16th International Symposium, SAGT 2023, Egham, UK, September 4–7, 2023, Proceedings (pp. 347-364). Springer. https://doi.org/10.1007/978-3-031-43254-5_20

Caragiannis, I. & Narang, S. (2023). Repeatedly Matching Items to Agents Fairly and Efficiently. In AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (pp. 2670-2672). Association for Computing Machinery.

Madsen, M., Starup, J. L. & Lutze, M. (2023). Restrictable Variants: A Simple and Practical Alternative to Extensible Variants. In K. Ali & G. Salvaneschi (Eds.), 37th European Conference on Object-Oriented Programming, ECOOP 2023 (pp. 17:1-17:27). Article 17 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.17

Tommasel, A., Pablos Sarabia, R. & Assent, I. (2023). Re²Dan: Retrieval of Medical Documents for e-Health in Danish. In Proceedings of the 17th ACM Conference on Recommender Systems, RecSys 2023 (pp. 1208-1211). Association for Computing Machinery. https://doi.org/10.1145/3604915.3610655

Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A. & Srinivasan, S. (2023). Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Computational Complexity, 32(1), Article 3. https://doi.org/10.1007/s00037-023-00236-x

Damgård, I., Ravi, D., Tschudi, D. & Yakoubov, S. (2023). Secure Communication in Dynamic Incomplete Networks. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 13:1--13:21). Article 13 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.13

Braun, L., Damgård, I. B. & Orlandi, C. (2023). Secure Multiparty Computation from Threshold Encryption Based on Class Groups. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology: CRYPTO 2023 (pp. 613-645). Springer. https://doi.org/10.1007/978-3-031-38557-5_20

Abram, D., Waters, B. & Zhandry, M. (2023). Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology: CRYPTO 2023, Proceedings (Vol. Part I, pp. 489-514). Springer. https://doi.org/10.1007/978-3-031-38557-5_16

Quercia, A., Morrison, A., Scharr, H. & Assent, I. (2023). SGD Biased towards Early Important Samples for Efficient Training. In G. Chen, L. Khan, X. Gao, M. Qiu, W. Pedrycz & X. Wu (Eds.), IEEE International Conference on Data Mining, ICDM 2023, Shanghai, China, December 1-4, 2023 (pp. 1289-1294). IEEE. https://doi.org/10.1109/ICDM58522.2023.00163

Boudgoust, K. & Scholl, P. (2023). Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus. In J. Guo & R. Steinfeld (Eds.), Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023, Proceedings, Part I (pp. 371-404). Springer. https://doi.org/10.1007/978-981-99-8721-4_12

Displaying results 251 to 300 out of 5490

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University