Publications

List of publications

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 and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-58411-4_3

Å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

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. Aarhus University.

Pasquini, D., Francati, D., Ateniese, G. & Evgenios M. Kornaropoulos, E. M. (2024). Breach Extraction Attacks: Exposing and Addressing the Leakage in Second Generation Compromised Credential Checking Services. In 2024 IEEE Symposium on Security and Privacy (SP): Proceedings (pp. 1405-1423). IEEE. https://doi.org/10.1109/SP54263.2024.00114

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

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: Protocols for Z2k and Groups of Unknown Order. Aarhus University.

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

Hall-Andersen, M. N. (2024). Either/Or. Aarhus University.

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. In M. Wooldridge, J. Dy & S. Natarajan (Eds.), Technical Tracks 14 (9 ed., pp. 9555-9563). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v38i9.28811

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

Francati, D., Friolo, D., Malavolta, G. & Venturi, D. (2024). Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors. Journal of Cryptology, 37(3), Article 24. https://doi.org/10.1007/s00145-024-09504-7

Francati, D. & Venturi, D. (2024). Non-malleable Fuzzy Extractors. In C. Pöpper & L. Batina (Eds.), Applied Cryptography and Network Security: 22nd International Conference, ACNS 2024, Abu Dhabi, United Arab Emirates, March 5–8, 2024, Proceedings, Part I (pp. 135-155). Springer. https://doi.org/10.1007/978-3-031-54770-6_6

Boudgoust, K. & Roux-Langlois, A. (2024). Overfull: Too Large Aggregate Signatures Based on Lattices. The Computer Journal, 67(2), 719-727. https://doi.org/10.1093/comjnl/bxad013

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

Haselwarter, P. G., Hvass, B. S., Hansen, L. L., Winterhalter, T., Hriţcu, C. & Spitters, B. (2024). The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography. In A. Timany, D. Traytel, B. Pientka & S. Blazy (Eds.), CPP 2024: Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 30-44). Association for Computing Machinery. https://doi.org/10.1145/3636501.3636961

Melissaris Papanikolaou, N., Ravi, D. & Yakoubov, S. (2024). Threshold-Optimal MPC With Friends and Foes. In A. Chattopadhyay, S. Bhasin, S. Picek & C. Rebeiro (Eds.), Progress in Cryptology – INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II (Vol. 2, pp. 3-24). Springer. https://doi.org/10.1007/978-3-031-56235-8_1

Aranha, D. F., El Housni, Y. & Guillevic, A. (2023). A survey of elliptic curves for proof systems. Designs, Codes and Cryptography, 91, 3333–3378. https://doi.org/10.1007/s10623-022-01135-y

Roy, L. & Xu, J. (2023). A Universally Composable PAKE with Zero Communication Cost: (And Why It Shouldn’t Be Considered UC-Secure). In A. Boldyreva & V. Kolesnikov (Eds.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part I (pp. 714-743). Springer. https://doi.org/10.1007/978-3-031-31368-4_25

Soureshjani, F. H., Hall-Andersen, M., Jahanara, M., Kam, J., Gorzny, J. & Ahmadvand, M. (2023). Automated Analysis of Halo2 Circuits. In S. Graham-Lengrand & M. Preiner (Eds.), Proceedings of the 21st International Workshop on Satisfiability Modulo Theories (SMT 2023) co-located with the 29th International Conference on Automated Deduction (CADE 2023), Rome, Italy, July, 5-6, 2023 (Vol. 3429, pp. 3-17). CEUR-WS.org. https://ceur-ws.org/Vol-3429/paper3.pdf

Patra, A. & Ravi, D. (2023). Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. Journal of Cryptology, 36(3), Article 30. https://doi.org/10.1007/s00145-023-09468-0

Ciampi, M., Damgård, I., Ravi, D., Siniscalchi, L., Xia, Y. & Yakoubov, S. (2023). Broadcast-Optimal Four-Round MPC in the Plain Model. In G. Rothblum & H. Wee (Eds.), Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II (pp. 3-32). Springer. https://doi.org/10.1007/978-3-031-48618-0_1

Damgård, I., Ravi, D., Siniscalchi, L. & Yakoubov, S. (2023). Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. 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. 87-106). Springer. https://doi.org/10.1007/978-3-031-44469-2_5

Chiang, J. H. Y., David, B., Gama, M. & Lebeda, C. J. (2023). Correlated-Output Differential Privacy and Applications to Dark Pools. In J. Bonneau & S. M. Weinberg (Eds.), 5th Conference on Advances in Financial Technologies, AFT 2023 Article 11 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.11

Baum, C., David, B., Dowsley, R., Kishore, R., Nielsen, J. B. & Oechsner, S. (2023). CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. In A. Boldyreva & V. Kolesnikov (Eds.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part I (Vol. 1, pp. 439-470). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-31368-4_16

Abram, D., Beimel, A., Ishai, Y., Kushilevitz, E. & Narayanan, V. (2023). Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. Paper presented at Theory of Cryptography. TCC 2023, Taipei, Taiwan.

Campanelli, M., Hall-Andersen, M. N. & Kamp, S. H. (2023). Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. In J. Calandrino & C. Troncoso (Eds.), SEC '23: Proceedings of the 32nd USENIX Conference on Security Symposium (pp. 4391–4408). Article 246 Association for Computing Machinery. https://doi.org/10.5555/3620237.3620483

Larsen, K. G., Obremski, M. & Simkin, M. (2023). Distributed Shuffling in Adversarial Environments. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.10

Green, M., Hall-Andersen, M. N., Hennenfent, E., Kaptchuk, G., Perez, B. & Van Laer, G. (2023). Efficient Proofs of Software Exploitability for Real-world Processors. Proceedings on Privacy Enhancing Technologies, 2023(1), 627-640. https://doi.org/10.56553/popets-2023-0036

Boudgoust, K., Jeudy, C., Roux-Langlois, A. & Wen, W. (2023). Entropic Hardness of Module-LWE from Module-NTRU. In T. Isobe & S. Sarkar (Eds.), Progress in Cryptology – INDOCRYPT 2022: 23rd International Conference on Cryptology in India, Kolkata, India, December 11–14, 2022, Proceedings (pp. 78-99). Springer. https://doi.org/10.1007/978-3-031-22912-1_4

Chiang, J. H. Y., David, B., Eyal, I. & Gong, T. (2023). FairPoS: Input Fairness in Permissionless Consensus. In J. Bonneau & S. M. Weinberg (Eds.), 5th Conference on Advances in Financial Technologies, AFT 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.10

Aranha, D. F., Hvass, B. S., Spitters, B. & Tibouchi, M. (2023). Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing. In CCS'23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 3228-3238). Association for Computing Machinery. https://doi.org/10.1145/3576915.3616597

Hvass, B. S. (2023). Foundational Verification of Cryptographic Primitives. Århus Universitet.

Braun, L., Huppert, M., Khayata, N., Schneider, T. & Tkachenko, O. (2023). FUSE - Flexible File Format and Intermediate Representation for Secure Multi-Party Computation. In J. Liu, Y. Xiang, S. Nepal & G. Tsudik (Eds.), ASIA CCS 2023 - Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security (pp. 649-663). Association for Computing Machinery. https://doi.org/10.1145/3579856.3590340

Blundo, C., Cimato, S. & Siniscalchi, L. (2023). Heuristics for constrained role mining in the post-processing framework. Journal of Ambient Intelligence and Humanized Computing, 14(8), 9925-9937. https://doi.org/10.1007/s12652-021-03648-1

Hvass, B. S., Aranha, D. F. & Spitters, B. (2023). High-assurance field inversion for curve-based cryptography. In 2023 IEEE 36th Computer Security Foundations Symposium (CSF) (pp. 552-567). IEEE. https://doi.org/10.1109/CSF57540.2023.00008

Kohlweiss, M., Pancholi, M. R. & Takahashi, A. (2023). How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. In G. Rothblum & H. Wee (Eds.), Theory of Cryptography: Book Subtitle 21st International Conference, TCC 2023, Taipei, Taiwan, November 29–December 2, 2023, Proceedings, Part III (pp. 486–512). Springer. https://doi.org/10.1007/978-3-031-48621-0_17

Fleischhacker, N., Larsen, K. G. & Simkin, M. (2023). How to Compress Encrypted Data. 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. 551-577). Springer. https://doi.org/10.1007/978-3-031-30545-0_19

Aranha, D. F. & Medwed, M. (2023). IACR Transactions on Cryptographic Hardware and Embedded Systems. Ruhr Universität Bochum. IACR Transactions of Cryptographic Hardware and Embedded Systems Vol. 2023 No. 1-4 https://tches.iacr.org/index.php/TCHES/issue/view/312

Burkhardt, J., Damgård, I., Frederiksen, T. K., Orlandi, C. & Ghosh, S. (2023). Improved Distributed RSA Key Generation Using the Miller-Rabin Test. In W. Meng, C. D. Jensen, C. Cremers & E. Kirda (Eds.), CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 2501-2515). Association for Computing Machinery. https://doi.org/10.1145/3576915.3623163

Thomsen, S. E. (2023). Message Dissemination in the Nakamoto Era. Århus Universitet.

Damgård, I., Ravi, D., Siniscalchi, L. & Yakoubov, S. (2023). Minimizing Setup in Broadcast-Optimal Two Round MPC. 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. 129-158). Springer. https://doi.org/10.1007/978-3-031-30617-4_5

Keller, H., Orlandi, C., Paskin-Cherniavsky, A. & Ravi, D. (2023). MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 11:1-11:22). Article 11 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.11

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

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

Displaying results 1 to 50 out of 695

Revised 04.11.2024

Marianne Dammand Iversen