Publications

List of publications

Hasler, S., Reisert, P. & Küsters, R. (2025). Pseudorandom Correlation Functions from Ring-LWR. In Advances in Cryptology - ASIACRYPT 2025 (Vol. 16251, pp. 401-438). Springer. https://doi.org/10.1007/978-981-95-5122-4_13

Hasler, S., Reisert, P. & Küsters, R. (2025). Pseudorandom Correlation Functions from Ring-LWR. https://publ.sec.uni-stuttgart.de/haslerreisertkuesters-iacr-2025-1637.pdf

Meyer, P., Orlandi, C., Roy, L. & Scholl, P. (2025). Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. In E. Boyle & M. Mahmoody (Eds.), Theory of Cryptography - 22nd International Conference, TCC 2024, Proceedings (pp. 71-97). Article 323579 Springer Nature. https://doi.org/10.1007/978-3-031-78023-3_3

Kyster, A., Nielsen, F. H., Oechsner, S. & Scholl, P. (2025). Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations. In M. Blanton, W. Enck & C. Nita-Rotaru (Eds.), 2025 IEEE Symposium on Security and Privacy (SP) (pp. 2491-2508). IEEE. https://doi.org/10.1109/SP61157.2025.00176

Aranha, D. F., Guimaraes, A., Hoffman, C. & Méaux, P. (2025). Secure and efficient transciphering for FHE-based MPC. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2025(3), 745-780. https://doi.org/10.46586/tches.v2025.i3.745-780

Acharya, A., Baig, M. A., Hofheinz, D., Azari, K. & Kamath, C. (2025). Securely Instantiating 'Half Gates' Garbling in the Standard Model. In T. Jager & J. Pan (Eds.), Public-Key Cryptography – PKC 2025 - 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, 2025, Proceedings (Vol. 15677, pp. 37-75). Springer LNCS. https://doi.org/10.1007/978-3-031-91829-2_2

Baum, C., Beullens, W., Braun, L., Delpech de Saint Guilhem, C., Klooß, M., Majenz, C., Mukherjee, S., Orsini, E., Ramacher, S., Rechberger, C., Roy, L. & Scholl, P. (2025). Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures. In Y. Tauman Kalai & S. F. Kamara (Eds.), Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings (pp. 124-156). Springer Science+Business Media. https://doi.org/10.1007/978-3-032-01887-8_5

Meyer, P., Orlandi, C., Roy, L. & Scholl, P. (2025). Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. In Y. Tauman Kalai & S. F. Kamara (Eds.), Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings (pp. 426-458). Springer Science+Business Media. https://doi.org/10.1007/978-3-032-01884-7_14

Tozawa, K., Morita, H. & Mizuki, T. (2025). Single-shuffle card-based protocol with eight cards per gate and its extensions. Natural Computing, 24(1), 131-147. https://doi.org/10.1007/s11047-024-10006-5

Aardal, M. A., Adj, G., F. Aranha, D., Basso, A., Canales Martínez, I. A., Chávez-Saab, J., Corte-Real Santos, M., Dartois, P., De Feo, L., Duparc, M., Komada Eriksen, J., Fouotsa, T. B., Filho, D. L. G., Hess, B., Kohel, D., Leroux, A., Longa, P., Maino, L., Meyer, M. ... Wesolowski, B. (2025). SQIsign 2.0: Algorithm specifications and supporting documentation. https://sqisign.org/spec/sqisign-20250205.pdf

Kolby, S. (2025). Studies on Scalable Security. [PhD dissertation, Aarhus University].

Abram, D., Malavolta, G. & Roy, L. (2025). Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits. In M. Koucky & N. Bansal (Eds.), STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 1875-1886). Association for Computing Machinery. https://doi.org/10.1145/3717823.3718164

Keilty, A. P., Aranha, D. F., Pagnin, E. & Henríquez, F. R. (2025). That's AmorE: Amortized Efficiency for Pairing Delegation. In Y. Tauman Kalai & S. F. Kamara (Eds.), Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings (pp. 211-246) https://doi.org/10.1007/978-3-032-01913-4_7

Kamp, S. H. (2025). Towards Scalable & Robust Distributed Computing. [PhD dissertation, Aarhus University]. Institut for Datalogi, Aarhus Universitet.

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+Business Media. https://doi.org/10.1007/978-3-031-91124-8_16

Amores-Sesar, I. & Cachin, C. (2025). We Will DAG You. In J. Garcia-Alfaro, K. Barker, G. Navarro-Arribas, C. Pérez-Solà, S. Delgado-Segura, S. Katsikas, F. Cuppens, C. Lambrinoudakis, N. Cuppens-Boulahia, M. Pawlicki & M. Choraś (Eds.), Computer Security. ESORICS 2024 International Workshops - DPM, CBT, and CyberICPS, Bydgoszcz, 2024, Revised Selected Papers (pp. 276-291). Springer Science+Business Media. https://doi.org/10.1007/978-3-031-82349-7_19

Aardal, M. A. & Aranha, D. F. (2024). 2DT-GLS: Faster and Exception-Free Scalar Multiplication in the GLS254 Binary Curve. In B. Smith & H. Wu (Eds.), Selected Areas in Cryptography - 29th International Conference, SAC 2022, Revised Selected Papers (Vol. 13742, pp. 53-74). Springer Science+Business Media. https://doi.org/10.1007/978-3-031-58411-4_3

Reisert, P., Rivinius, M., Krips, T., Hasler, S. & Küsters, R. (2024). Actively Secure Polynomial Evaluation from Shared Polynomial Encodings. https://publ.sec.uni-stuttgart.de/reisertriviniuskripshaslerkuesters-iacr-2024-1435.pdf

Reisert, P., Rivinius, M., Krips, T., Hasler, S. & Küsters, R. (2024). Actively Secure Polynomial Evaluation from Shared Polynomial Encodings. In Advances in Cryptology - ASIACRYPT 2024 (Vol. 15489, pp. 3-35). Springer. https://doi.org/10.1007/978-981-96-0938-3_1

Årdal, M. A., Aranha, D. F., Boudgoust, K., Kolby, S. & Takahashi, A. (2024). Aggregating Falcon Signatures with LaBRADOR. In L. Reyzin & D. Stebila (Eds.), Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings (pp. 71-106) https://doi.org/10.1007/978-3-031-68376-3_3

Braun, L., Castagnos, G., Damgård, I. B., Laguillaumie, F., Melissaris, K., Orlandi, C. & Tucker, I. (2024). An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. https://eprint.iacr.org/2024/717

Braun, L., Castagnos, G., Damgård, I., Laguillaumie, F., Melissaris, K., Orlandi, C. & Tucker, I. (2024). An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. In C. Galdi & D. H. Phan (Eds.), Security and Cryptography for Networks - 14th International Conference, SCN 2024, Amalfi, Italy, September 11-13, 2024, Proceedings, Part II (pp. 24-46). Springer. https://doi.org/10.1007/978-3-031-71073-5_2

Charbit, P., Couteau, G., Meyer, P. E. & Naserasr, R. (2024). A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. 167–199. Abstract from Theory of Cryptography, Milan, Italy. https://eprint.iacr.org/2024/1473

Aranha, D. F., Costache, A., Guimaraes, A. & Soria-Vazquez, E. (2024). A Practical Framework for Verifiable Computation over Encrypted Data. Abstract from 3rd Annual FHE.org Conference on Fully Homomorphic Encryption, Toronto, Canada. https://eprint.iacr.org/2023/1949

Aranha, D. F., Fotiadis, G. & Guillevic, A. (2024). A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level. IACR Communications in Cryptology, 1(3). https://doi.org/10.62056/angyl86bm

Hansen, B., Aamand, J., Blicher-Mathiesen, G., Christiansen, A. V., Claes, N., Dalgaard, T., Frederiksen, R. R., Jacobsen, B. H., Jakobsen, R., Kallesøe, A., Kim, H., Koch, J., Møller, I., Madsen, R. B., Schaper, S., Sandersen, P. B. E., Voutchkova, D. D. & Wiborg, I. (2024). Assessing groundwater denitrification spatially is the key to targeted agricultural nitrogen regulation. Scientific Reports, 14(1), Article 5538. https://doi.org/10.1038/s41598-024-55984-9

Pancholi, M. R. (2024). Beyond Knowledge Soundness of SNARKs. [PhD dissertation, Aarhus University]. Aarhus Universitet.

Melissaris Papanikolaou, N., Rachuri, R., Baum, C. & Scholl, P. (2024). Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. 454-488. Paper presented at 44th Annual International Cryptology Conference - CRYPTO 2024, Santa Barbara, California, United States. https://doi.org/10.1007/978-3-031-68397-8_14

Nan Cheng, Gupta, N., Mitrokotsa, A. & Tozawa, K. (2024). Constant-Round Private Decision Tree Evaluation for Secret Shared Data. Proceedings on Privacy Enhancing Technologies, 2024(1), 397-412. https://doi.org/10.56553/popets-2024-0023

Abram, D., Doerner, J., Ishai, Y. & Narayanan, V. (2024). Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output. In M. Joye & G. Leander (Eds.), Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2024, Proceedings (pp. 122–154). Springer. https://doi.org/10.1007/978-3-031-58740-5_5

Kolby, S., Ravi, D. & Yakoubov, S. (2024). Constant-Round YOSO MPC Without Setup. IACR Communications in Cryptology, 1(3). https://doi.org/10.62056/ae5w4fe-3

Braun, L. (2024). Cryptography After Prime Time. [PhD dissertation, Aarhus University]. Aarhus Universitet.

Damgård, I., Keller, H., Nelson, B., Orlandi, C. & Pagh, R. (2024). Differentially Private Selection from Secure Distributed Computing. In T.-S. Chua, C.-W. Ngo, R. Kumar, H. W. Lauw & R. K.-W. Lee (Eds.), WWW 2024 - Proceedings of the ACM Web Conference (pp. 1103-1114). Association for Computing Machinery. https://doi.org/10.1145/3589334.3645435

Abram, D. (2024). Distributed (Correlation) Samplers: A Study on the Round Complexity of Cryptographic Sampling Protocols. [PhD dissertation, Aarhus University]. Aarhus Universitet.

Loss, J. & Nielsen, J. B. (2024). Early Stopping for Any Number of Corruptions. In M. Joye & G. Leander (Eds.), Advances in Cryptology – EUROCRYPT 2024: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. III, pp. 457-488). Springer. https://doi.org/10.1007/978-3-031-58734-4_16

Aranha, D. F., Battagliola, M. & Roy, L. D. (2024). Faster coercion-resistant e-voting by encrypted sorting. In E-Vote-ID 2023 (pp. 53-70). Gesellschaft fur Informatik (GI). https://doi.org/10.18420/e-vote-id2023_03

Bui, D., Couteau, G., Meyer, P., Passelègue, A. & Riahinia, M. (2024). Fast Public-Key Silent OT and More from Constrained Naor-Reingold. In M. Joye & G. Leander (Eds.), Advances in Cryptology – EUROCRYPT 2024 (pp. 88-118). Springer. https://doi.org/10.1007/978-3-031-58751-1_4

Neumann, L., Guimaraes, A., Aranha, D. F. & Borin, E. (2024). Homomorphic WiSARDs: Efficient Weightless Neural Network training over encrypted data. Abstract from 4th Workshop on Artificial Intelligence and Cryptography, Zurich, Switzerland. https://arxiv.org/abs/2403.20190

Obremski, M., Ribeiro, J., Roy, L., Standaert, F.-X. & Venturi, D. (2024). Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. In L. Reyzin & D. Stebila (Eds.), Advances in Cryptology -- CRYPTO 2024 (pp. 461-491). Springer Nature. https://doi.org/10.1007/978-3-031-68391-6_14

Brzuska, C., Couteau, G., Egger, C., Karanko, P. & Meyer, P. E. (2024). Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs. In C. Galdi & D. Hieu Phan (Eds.), Security and Cryptography for Networks - 14th International Conference, SCN 2024, Proceedings (pp. 97–116). Springer Nature. https://doi.org/10.1007/978-3-031-71073-5_5

Fleischhacker, N., Larsen, K. G., Obremski, M. & Simkin, M. (2024). Invertible Bloom Lookup Tables with Less Memory and Randomness. In T. Chan, J. Fischer, J. Iacono & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms, ESA 2024 Article 54 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2024.54

Marandi, A., Alves, P. G. M. R., Aranha, D. F. & Jacobsen, R. H. (2024). Lattice-based Homomorphic Encryption for Privacy-Preserving Smart Meter Data Analytics. The Computer Journal, 67(5), 1687-1698. https://doi.org/10.1093/comjnl/bxad093

Burkhardt, J., Caragiannis, I., Fehrs, K., Russo, M., Schwiegelshohn, C. & Shyam, S. (2024). Low-Distortion Clustering with Ordinal and Limited Cardinal Information. Proceedings of the AAAI Conference on Artificial Intelligence, 38(9), 9555-9563. https://doi.org/10.1609/aaai.v38i9.28811

Braun, L., Gascón, A., Raykova, M., Schoppmann, P. & Seth, K. (2024). Malicious Security for Sparse Private Histogram. https://eprint.iacr.org/2024/469

Guimaraes, A., Borin, E. & Aranha, D. F. (2024). MOSFHET: Optimized Software for FHE over the Torus. Journal of Cryptographic Engineering, 14(3), 577-593. https://doi.org/10.1007/s13389-024-00359-z

Yakoubov, S., Pagnin, E. & Kolby, S. (2024). Multi Designated Verifier Ring Signatures. IACR Communications in Cryptology, 1(3). https://doi.org/10.62056/a33zivrzn

Hasler, S., Reisert, P., Rivinius, M. & Küsters, R. (2024). Multipars: Reduced-Communication MPC over Z2k. Proceedings on Privacy Enhancing Technologies, (2), 5-28. https://doi.org/10.56553/popets-2024-0038

Chillotti, I., Orsini, E., Scholl, P. & Van Leeuwen, B. (2024). Scooby: Improved multi-party homomorphic secret sharing based on FHE. Information and Computation, 297, Article 105133. https://doi.org/10.1016/j.ic.2023.105133

Keller, H., Möllering, H., Schneider, T., Tkachenko, O. & Zhao, L. (2024). Secure Noise Sampling for DP in MPC with Finite Precision. In ARES '24: Proceedings of the 19th International Conference on Availability, Reliability and Security Article 25 Association for Computing Machinery. https://doi.org/10.1145/3664476.3664490

Couteau, G., Bui, D. & Melissaris Papanikolaou, N. (2024). Structured-Seed Local Pseudorandom Generators and their Applications. https://eprint.iacr.org/2024/1027

Displaying results 51 to 100 out of 649

Revised 04.08.2026

Marianne Dammand Iversen