Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

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

Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S. & Peikert, C. (2018). More Efficient Commitments from Structured Lattice Assumptions. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 368-385). Springer VS. https://doi.org/10.1007/978-3-319-98113-0_20

Damgård, I. B., Li, B. & Schwartzbach, N. I. (2021). More communication lower bounds for information-theoretic MPC. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2021.2

Boudgoust, K. & Keller, H. (2025). Module Learning with Errors with Truncated Matrices. In R. Niederhagen & M.-J. O. Saarinen (Eds.), Post-Quantum Cryptography - 16th International Workshop, PQCrypto 2025, Proceedings (Vol. Part 1, pp. 255-277). Springer. https://doi.org/10.1007/978-3-031-86599-2_9

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

Frederiksen, T. K., Jakobsen, T. P., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2013). MiniLEGO: Efficient secure two-party computation from general assumptions. In T. Johansson & P. Q. Nguyen (Eds.), Advances in Cryptology – EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings (pp. 537-556). Springer VS. https://doi.org/10.1007/978-3-642-38348-9_32

Faonio, A., Nielsen, J. B. & Venturi, D. (2015). Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation. In M. M. Halldórsson, K. Iwama, N. Kobayashi & B. Speckmann (Eds.), Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (Vol. Part 1, pp. 456-468). Springer VS. https://doi.org/10.1007/978-3-662-47672-7_37

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

Ghosh, S., Nielsen, J. B. & Nilges, T. (2017). Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Vol. 10624, pp. 629-659). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_22

Baum, C., Malozemoff, A. J., Scholl, P. & Rosen, M. (2021). Mac’n’Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. In Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings: Proceedings (pp. 92-122). Springer. https://doi.org/10.1007/978-3-030-84259-8_4

Jacob, R., Larsen, K. G. & Nielsen, J. B. (2019). Lower Bounds for Oblivious Data Structures. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2439-2447). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.149

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Nielsen, J. B. & Simkin, M. (2020). Lower bounds for leakage-resilient secret sharing. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 556-577). Springer. https://doi.org/10.1007/978-3-030-45721-1_20

Bendlin, R., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2011). Lower and Upper Bounds for Deniable Public-Key Encryption. Lecture Notes in Computer Science, 7073, 125-142. https://doi.org/10.1007/978-3-642-25385-0_7

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

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2020). Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. Journal of Cryptology, 33(4), 1732-1786. https://doi.org/10.1007/s00145-020-09355-y

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2017). Low cost constant round MPC combining BMR and oblivious transfer. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Vol. 10624, pp. 598-628). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_21

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2021). Low-Complexity Weak Pseudorandom Functions in textdollartextbackslashmathtt AC0[textbackslashmathtt MOD2]textdollar. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV (pp. 487-516). Springer. https://doi.org/10.1007/978-3-030-84259-8_17

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., 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

Aranha, D. F., Pagnin, E. & Rodriguez-Henriquez, F. (2021). LOVE a Pairing. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 320-340). Springer. https://doi.org/10.1007/978-3-030-88238-9_16

Cramer, R. & Damgård, I. B. (1997). Linear zero-knowledge-a note on efficient zero-knowledge proofs and arguments. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (pp. 436-445). Association for Computing Machinery. https://doi.org/10.1145/258533.258635

Cramer, R., Damgård, I. B., Döttling, N., Giacomelli, I. & Xing, C. (2016). Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. (pp. 1-31). Cryptology ePrint Archive. http://ia.cr/2016/397

Cramer, R., Damgård, I., Döttling, N., Giacomelli, I. & Xing, C. (2017). Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. In J. Shikata (Ed.), Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings (Vol. 10681, pp. 1-25). Springer VS. https://doi.org/10.1007/978-3-319-72089-0_1

Cramer, R., Damgård, I. B., Döttling, N. M., Fehr, S. & Spini, G. (2015). Linear secret sharing schemes from error correcting codes and universal hash functions. In E. Oswald & M. F. Fischlin (Eds.), Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II (pp. 313-336). Springer VS. https://doi.org/10.1007/978-3-662-46803-6_11

Damgård, I. B. & Thorbek, R. (2006). Linear Integer Secret Sharing and Distributed Exponentiation. In M. Yung, Y. Dodis, A. Kiayias & T. Malkin (Eds.), Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. Proceedings (pp. 75-90). Springer. https://doi.org/10.1007/11745853_6

Hubacek, P., Nielsen, J. B. & Rosen, A. (2013). Limits on the Power of Cryptographic Cheap Talk. In R. Canetti & J. A. Garay (Eds.), Advances in Cryptology – CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I (pp. 277-297 ). Springer VS. https://doi.org/10.1007/978-3-642-40041-4_16

Junio da Cruz, R., Reis, T. B. S., Aranha, D. F., Lopez, J. & Patil, H. K. (2016). Lightweight cryptography on ARM. Abstract from NIST Lightweight Cryptography Workshop, Gaithersburg, United States. https://www.researchgate.net/publication/312029226_Lightweight_Cryptography_on_ARM

Rachuri, R. & Scholl, P. (2022). Le Mans: Dynamic and Fluid MPC for Dishonest Majority. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 719-749). Springer. https://doi.org/10.1007/978-3-031-15802-5_25

Nielsen, J. B. & Orlandi, C. (2009). LEGO for Two-Party Secure Computation. Lecture Notes in Computer Science, 5444, 368-386. https://doi.org/10.1007/978-3-642-00457-5_22

Damgård, I. B. (Ed.) (1999). Lectures on Data Security: Modern Cryptology in Theory and Practice. Springer. Lecture Notes in Computer Science Vol. 1561 https://doi.org/10.1007/3-540-48969-X

Nielsen, J. B., Venturi, D. & Zottarel, A. (2014). Leakage-resilient signatures with graceful degradation. In H. Krawczyk (Ed.), Public-Key Cryptography – PKC 2014: 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings (pp. 362-379). Springer. https://doi.org/10.1007/978-3-642-54631-0_21

Damgård, I. B., Hazay, C. & Patra, A. (2012). Leakage Resilient Secure Two-Party Computation. http://eprint.iacr.org/2011/256

Aranha, D. F., Baum, C., Gjøsteen, K., Silde, T. & Tunge, T. (2021). Lattice-Based Proof of Shuffle and Applications to Electronic Voting. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 227-251). Springer. https://doi.org/10.1007/978-3-030-75539-3_10

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

Oliveira, T., Lopez, J., Aranha, D. F. & Rodriguez-henriquez, F. (2013). Lambda Coordinates for Binary Elliptic Curves. In G. Bertoni & J.-S. Coron (Eds.), Cryptographic Hardware and Embedded Systems - CHES 2013 (pp. 311-330). Springer. https://doi.org/10.1007/978-3-642-40349-1_18

Aranha, D. F., Novaes, F. R., Takahashi, A., Tibouchi, M. & Yarom, Y. (2020). LadderLeak: Breaking ECDSA with Less than One Bit of Nonce Leakage. In CCS 2020 - Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 225-242). Association for Computing Machinery. https://doi.org/10.1145/3372297.3417268

Aranha, D. F., Lin, C., Orlandi, C. & Simkin, M. (2022). Laconic Private Set-Intersection From Pairings. In CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 111-124). Association for Computing Machinery. https://doi.org/10.1145/3548606.3560642

Constantin-Sukul, L. R. J., Ø. Gammelgaard, R., Henriksen, A. & Aranha, D. F. (2025). Key recovery on static Kyber based on transient execution attacks. In Proceedings of the 1st Microarchitecture Security Conference https://doi.org/10.46586/uasc.2025.006

Damgård, I. B. & Park, S. (2012). Is Public-Key Encryption Based on LPN Practical? http://eprint.iacr.org/2012/699

Damgård, I. B., Nielsen, J. B. & Wichs, D. (2008). Isolated Proofs of Knowledge and Isolated Zero Knowledge. Lecture Notes in Computer Science, 4965, 509-526. https://doi.org/10.1007/978-3-540-78967-3_29

Orlandi, C. (2011). Is Multiparty Computation Any Good In Practice? I E E E International Conference on Acoustics, Speech and Signal Processing. Proceedings, 5848-5851. https://doi.org/10.1109/ICASSP.2011.5947691

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

Guimaraes, A., Borin, E. & Aranha, D. F. (2019). Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography. In M. Baldi, E. Persichetti & P. Santini (Eds.), Code-Based Cryptography - 7th International Workshop, CBC 2019, Revised Selected Papers (pp. 44-68). Springer. https://doi.org/10.1007/978-3-030-25922-8_3

Damgård, I. B. (1994). Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract). In D. R. Stinson (Ed.), Advances in Cryptology - CRYPTO' 93: 13th Annual International Cryptology Conference Santa Barbara, California, USA August 22-26, 1993 Proceedings (pp. 100-109). Springer. https://doi.org/10.1007/3-540-48329-2_9

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

Damgård, I., Escudero, D. & Ravi, D. (2021). Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. In Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings (pp. 591-622). Springer. https://doi.org/10.1007/978-3-030-90459-3_20

Damgård, I. B., Fehr, S., Lunemann, C., Salvail, L. & Schaffner, C. (2009). Improving the Security of Quantum Protocols via Commit-and-Open. Lecture Notes in Computer Science, 408-427. https://doi.org/10.1007/978-3-642-03356-8_24

Aranha, D. F., Dalskov, A., Orlandi, C. & Escudero Ospina, D. E. (2021). Improved Threshold Signatures, Proactive Secret Sharing and Input Certification from LSS Isomorphisms. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 382-404). Springer. https://doi.org/10.1007/978-3-030-88238-9_19

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

Displaying results 301 to 350 out of 595

7

Revised 04.11.2025

-

Marianne Dammand Iversen