Publications

List of publications

Sort by: Date | Author | Title

Acharya, A., Hazay, C. & Venkitasubramaniam, M. (2026). On Achieving "Best-in-the-Multiverse" MPC. In Theory of Cryptography: 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part I (Vol. 16268, pp. 119–151). Springer LNCS. https://doi.org/10.1007/978-3-032-12287-2_5

Acharya, A., Baig, M. A., Hofheinz, D., Azari, K. & Kamath, C. (2025). Securely Instantiating 'Half Gates' Garbling in the Standard Model. In Securely Instantiating 'Half Gates' Garbling in the Standard Model (Vol. 15677, pp. 37-75). Springer LNCS. https://doi.org/10.1007/978-3-031-91829-2

Acharya, A., Azari, K. & Kamath, C. (2025). On the Adaptive Security of Free-XOR-Based Garbling Schemes in the Plain Model. In S. Fehr & P.-A. Fouque (Eds.), Advances in Cryptology – EUROCRYPT 2025: 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4–8, 2025, Proceedings, Part VI (Vol. 15606, pp. 214-244). Springer LNCS. https://doi.org/10.1007/978-3-031-91095-1\_8

Acharya, A., Hazay, C., Prabhakaran, M. & Kolesnikov, V. (2026). Towards Building Efficient SCALES Protocols. In Advances in Cryptology – ASIACRYPT 2025: 31st International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, December 8–12, 2025, Proceedings, Part V (Vol. 16249, pp. 35-67). Springer LNCS. https://doi.org/10.1007/978-981-95-5116-3_2

Aceto, L., Damgård, I. B., Goldberg, L. A., Halldórsson, M. M., Ingólfsdóttir, A. & Walukiewicz, I. (2008). Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II. Springer. Lecture Notes in Computer Science Vol. 5126 https://doi.org/10.1007/978-3-540-70583-3

Abspoel, M., Cramer, R., Damgård, I. B., Escudero Ospina, D. E. & Yuan, C. (2019). Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. In D. Hofheinz & A. Rosen (Eds.), Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings: Proceedings (Vol. Part 1, pp. 471-501). Springer. https://doi.org/10.1007/978-3-030-36030-6_19

Abspoel, M., Cramer, R., Damgård, I., Escudero, D., Rambaud, M., Xing, C. & Yuan, C. (2020). Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/pkZ. In S. Moriai & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings (Vol. III, pp. 151-180). Springer. https://doi.org/10.1007/978-3-030-64840-4_6

Abram, D., Damgård, I., Scholl, P. & Trieflinger, S. (2021). Oblivious TLS via Multi-party Computation. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 51-74). Springer. https://doi.org/10.1007/978-3-030-75539-3_3

Abram, D. & Scholl, P. (2022). Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. 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. 221-251). Springer. https://doi.org/10.1007/978-3-030-97121-2_9

Abram, D., Scholl, P. & Yakoubov, S. (2022). Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. 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. 790-820). Springer. https://doi.org/10.1007/978-3-031-06944-4_27

Abram, D., Nof, A., Orlandi, C., Scholl, P. & Shlomovits, O. (2022). Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. In 2022 IEEE Symposium on Security and Privacy (SP) (pp. 2554-2572). IEEE. https://doi.org/10.1109/SP46214.2022.9833559

Abram, D., Damgård, I., Orlandi, C. & Scholl, P. (2022). An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 (pp. 421-452). Springer. https://doi.org/10.1007/978-3-031-15985-5_15

Abram, D., Beimel, A., Ishai, Y., Kushilevitz, E. & Narayanan, V. (2023). Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. 286-315. Paper presented at Theory of Cryptography. TCC 2023, Taipei, Taiwan. https://doi.org/10.1007/978-3-031-48615-9_11

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

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

Abram, D., Roy, L. & Scholl, P. (2024). Succinct Homomorphic Secret Sharing. In M. Joye & G. Leander (Eds.), Advances in Cryptology -- EUROCRYPT 2024 (pp. 301-330). Springer Nature. https://doi.org/10.1007/978-3-031-58751-1_11

Abram, D. (2024). Distributed (Correlation) Samplers: A Study on the Round Complexity of Cryptographic Sampling Protocols. [PhD dissertation, Aarhus University]. 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

Abram, D., Malavolta, G. & Roy, L. (2025). Key-Homomorphic Computations for RAM: Fully Succinct Randomised Encodings and More. In Y. Tauman Kalai & S. F. Kamara (Eds.), Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings (pp. 236-268). Springer Science+Business Media. https://doi.org/10.1007/978-3-032-01881-6_8

Abram, D., Malavolta, G. & Roy, L. (2026). Slightly Sublinear Trapdoor Hash Functions and PIR from Low-Noise LPN. In B. Applebaum & H. Lin (Eds.), Theory of Cryptography - 23rd International Conference, TCC 2025, Proceedings (pp. 280-300). Springer Science+Business Media. https://doi.org/10.1007/978-3-032-12287-2_10

Abram, D., Fehr, S., Obremski, M. & Scholl, P. (2026). On the Impossibility of Actively Secure Distributed Samplers. In B. Applebaum & H. Lin (Eds.), Theory of Cryptography: 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part IV (pp. 547-581). Springer Nature. https://doi.org/10.1007/978-3-032-12290-2_18

Abraham, I., Chouatt, E., Gilad, Y., Stern, G. & Yakoubov, S. (2025). Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. In ACM Symposium on Principles of Distributed Computing (PODC 2025) (pp. 28-38) https://doi.org/10.1145/3732772.3733533

Abdolmaleki, B., Khoshakhlagh, H. & Slamanig, D. (2019). A Framework for UC-Secure Commitments from Publicly Computable Smooth Projective Hashing. In M. Albrecht (Ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings (pp. 1-21). Springer. https://doi.org/10.1007/978-3-030-35199-1_1

Abdolmaleki, B., Khoshakhlagh, H. & Lipmaa, H. (2021). Smooth Zero-Knowledge Hash Functions. In A. Adhikari, R. Küsters & B. Preneel (Eds.), Progress in Cryptology – INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, 2021, Proceedings: 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings (pp. 510-535). Springer. https://doi.org/10.1007/978-3-030-92518-5_23

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

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

Displaying results 601 to 626 out of 626

Revised 26.01.2026

Marianne Dammand Iversen