Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

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

Hogräfer, M., Burkhardt, J. & Schulz, H.-J. (2022). A Pipeline for Tailored Sampling for Progressive Visual Analytics. In J. Bernard & M. Angelini (Eds.), Proceedings of the 13th International EuroVis Workshop on Visual Analytics (EuroVA) (pp. 49-53). Eurographics Association. https://doi.org/10.2312/eurova.20221079

Hoffman, C., Cortes, M. L., Aranha, D. F. & Araujo, G. (2015). Computer security by hardware-intrinsic authentication. In 2015 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS) (pp. 143-152). IEEE. https://doi.org/10.1109/CODESISSS.2015.7331377

Hoffman, C., Gebotys, C. H., Aranha, D. F., Cortes, M. L. & Araujo, G. (2019). Circumventing Uniqueness of XOR Arbiter PUFs. In Proceedings - Euromicro Conference on Digital System Design, DSD 2019 (pp. 222-229). Article 8875236 IEEE. https://doi.org/10.1109/DSD.2019.00041

Hirt, M. & Nielsen, J. B. (2005). Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computations. In B. Roy (Ed.), Advances in Cryptology - ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005. Proceedings (pp. 79-99). Springer. https://doi.org/10.1007/11593447_5

Hirt, M., Nielsen, J. B. & Przydatek, B. (2005). Cryptographic Asynchronous Multi-party Computation with Optimal Resilience: Extended abstract. In R. Cramer (Ed.), Advances in Cryptology – EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005. Proceedings (pp. 322-340). Springer LNCS. https://doi.org/10.1007/11426639_19

Hirt, M. & Nielsen, J. B. (2006). Robust Multiparty Computation with Linear Communication Complexity. In C. Dwork (Ed.), Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference (pp. 463-482) https://doi.org/10.1007/11818175_28

Hirt, M., Nielsen, J. B. & Przydatek, B. (2008). Asynchronous Multi-Party Computation with Quadratic Communication. Lecture Notes in Computer Science, 5126, 473-485. https://doi.org/10.1007/978-3-540-70583-3_39

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2011). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. http://eprint.iacr.org/2011/494

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2012). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Lecture Notes in Computer Science, 7178, 313-331. https://doi.org/10.1007/978-3-642-27954-6_20

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

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). TinyKeys: A New Approach to Efficient Multi-Party Computation. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (Vol. 10993, pp. 3-33). Springer VS. https://doi.org/10.1007/978-3-319-96878-0_1

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). In T. Peyrin & S. Galbraith (Eds.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 11274, pp. 86-117). Springer VS. https://doi.org/10.1007/978-3-030-03332-3_4

Hazay, C., Mikkelsen, G. L., Rabin, T., Toft, T. & Nicolosi, A. A. (2019). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Journal of Cryptology, 32(2), 265-323. https://doi.org/10.1007/s00145-017-9275-7

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., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2022). TinyKeys: A New Approach to Efficient Multi-Party Computation. Journal of Cryptology, 35(2), Article 13. https://doi.org/10.1007/s00145-022-09423-5

Hasler, S., Krips, T., Küsters, R., Reisert, P. & Rivinius, M. (2023). Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. (pp. 372-386). https://doi.org/10.1145/3579856.3582809

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

Hasler, S., Reisert, P., Rivinius, M. & Küsters, R. (2023). Multipars: Reduced-Communication MPC over Z2k. https://eprint.iacr.org/2023/1932

Hasler, S., Reisert, P. & Küsters, R. (2026). Pseudorandom Correlation Functions from Ring-LWR. In G. Hanaoka & B.-Y. Yang (Eds.), Advances in Cryptology - ASIACRYPT 2025 - 31st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (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://eprint.iacr.org/2025/1637

Hasler, S. & Reisert, P. (2025). Pseudorandom Correlation Functions for Multiparty Beaver Triples from Sparse LPN. https://eprint.iacr.org/2025/2002

Hasler, S. (2026). Beyond DCR: HSS and PCFs from Subgroup Indistinguishability. Paper presented at Asiacrypt 2026, China. https://ia.cr/2026/2006

Harnik, D., Ishai, Y., Kushilevitz, E. & Nielsen, J. B. (2008). OT-Combiners Via Secure Computation. Lecture Notes in Computer Science, 4948, 393-411. https://doi.org/10.1007/978-3-540-78524-8_22

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

Hansen, A. B., Nielsen, J. B. & Simkin, M. (2025). OCash: Fully Anonymous Payments Between Blockchain Light Clients. In T. Jager & J. Pan (Eds.), Public-Key Cryptography – PKC 2025 - 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (pp. 169-202). Springer Science+Business Media. https://doi.org/10.1007/978-3-031-91832-2_6

Hallgren, P. A., Orlandi, C. & Sabelfeld, A. (2017). PrivatePool: Privacy-Preserving Ridesharing. In Proceedings - IEEE 30th Computer Security Foundations Symposium, CSF 2017 (pp. 276-291). Article 8049726 IEEE Press. https://doi.org/10.1109/CSF.2017.24

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

Hall-Andersen, M. N. & Aranha, D. F. (2026). Notes and Proofs for Divisor Techniques. https://blog.zksecurity.xyz/posts/divisor-notes/divisor-techniques.pdf

Haagh, H., Ji, Y., Li, C., Orlandi, C. & Song, Y. (2016). Revealing Encryption for Partial Ordering. http://eprint.iacr.org/2016/972.pdf

Haagh, H., Ji, Y., Li, C., Orlandi, C. & Song, Y. (2017). Revealing Encryption for Partial Ordering. In M. O’Neill (Ed.), Cryptography and Coding - 16th IMA International Conference, IMACC 2017, Proceedings (pp. 3-22). Springer VS. https://doi.org/10.1007/978-3-319-71045-7_1

Guimaraes, A., Aranha, D. F. & Borin, E. (2019). Optimized implementation of QC‐MDPC code‐based cryptography. Concurrency and Computation: Practice & Experience, 31(18), Article e5089. https://doi.org/10.1002/cpe.5089

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

Guimaraes, A., Borin, E. & Aranha, D. F. (2021). Revisiting the functional bootstrap in TFHE. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2021(2), 229-253. https://doi.org/10.46586/tches.v2021.i2.229-253

Guimaraes, A., Borin, E. & Aranha, D. F. (2022). MOSFHET: Optimized Software for FHE over the Torus. Abstract from 5th Homomorphic Encryption Standards Meeting, Geneva, Switzerland.

Guimaraes, A., Neumann, L., Andaló, F. A., Aranha, D. F. & Borin, E. (2022). Homomorphic evaluation of large look-up tables for inference on human genome data in the cloud. In Proceedings - 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing Workshops, SBAC-PADW 2022 (pp. 33-38). IEEE. https://doi.org/10.1109/SBAC-PADW56527.2022.00015

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

Grønkjær Jensen, M. V., Kjeldsen, H.-C., Skriver Nielsen, A., Olesen, N. B. & Aranha, D. F. (2024). Verifying ElectionGuard: a theoretical and empirical analysis. In E-Vote-ID 2024 - Ninth International Joint Conference on Electronic Voting: Proceedings (pp. 17-33). Gesellschaft fur Informatik (GI). https://doi.org/10.18420/e-vote-id2024_01

Giacomelli, I., Madsen, J. & Orlandi, C. (2016). ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In Proceedings of the 25th USENIX Security Symposium: (USENIX Security 16) (pp. 1069-1083). USENIX - The Advanced Computing Systems Association. https://www.usenix.org/system/files/conference/usenixsecurity16/sec16_paper_giacomelli.pdf

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

Ghosh, S. & Simkin, M. (2019). The Communication Complexity of Threshold Private Set Intersection. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Vol. II, pp. 3-29). Springer. https://doi.org/10.1007/978-3-030-26951-7_1

Gentry, C., Halevi, S., Krawczyk, H., Magri, B., Nielsen, J. B., Rabin, T. & Yakoubov, S. (2021). YOSO: You Only Speak Once: Secure MPC with Stateless Ephemeral Roles. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: Annual International Cryptology Conference (pp. 64-93). Springer. https://doi.org/10.1007/978-3-030-84245-1_3

Gentry, C., Halevi, S., Magri, B., Nielsen, J. B. & Yakoubov, S. (2021). Random-Index PIR and Applications. In K. Nissim & B. Waters (Eds.), Theory of Cryptography : 19th International Conference, TCC 2021, Proceedings (pp. 32-61). Springer. https://doi.org/10.1007/978-3-030-90456-2_2

Ganesh, C., Orlandi, C. & Tschudi, D. (2019). Proof-of-Stake Protocols for Privacy-Aware Blockchains. In Y. Ishai & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 690-719). Springer. https://doi.org/10.1007/978-3-030-17653-2_23

Ganesh, C., Orlandi, C., Pancholi, M. R., Takahashi, A. & Tschudi, D. (2022). Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 (pp. 397-426). Springer. https://doi.org/10.1007/978-3-031-07085-3_14

Ganesh, C., Orlandi, C., Tschudi, D. & Zohar, A. (2022). Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. In J. Garcia-Alfaro, J. L. Muñoz-Tapia, G. Navarro-Arribas & M. Soriano (Eds.), Data Privacy Management, Cryptocurrencies and Blockchain Technology : ESORICS 2021 International Workshops, DPM 2021 and CBT 2021 (pp. 173-191). Springer. https://doi.org/10.1007/978-3-030-93944-1_12

Ganesh, C., Khoshakhlagh, H., Kohlweiss, M., Nitulescu, A. & Zając, M. (2022). What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation Extractable? In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks (pp. 735-760). Springer. https://doi.org/10.1007/978-3-031-14791-3_32

Ganesh, C., Khoshakhlagh, H. & Parisella, R. (2022). NIWI and New Notions of Extraction for Algebraic Languages. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 687-710). Springer. https://doi.org/10.1007/978-3-031-14791-3_30

Ganesh, C., Kondi, Y. M., Orlandi, C., Pancholi, M. R., Takahashi, A. & Tschudi, D. (2023). Witness-Succinct Universally-Composable SNARKs. 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. 315–346). Springer. https://doi.org/10.1007/978-3-031-30617-4_11

Ganesh, C., Orlandi, C., Pancholi, M. R., Takahashi, A. & Tschudi, D. (2025). Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model). Journal of Cryptology, 38(1), Article 11. https://doi.org/10.1007/s00145-024-09525-2

Displaying results 151 to 200 out of 651

4

Revised 04.08.2026

-

Marianne Dammand Iversen