Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Khoshakhlagh, H. (2022). (Commit-and-Prove) Predictable Arguments with Privacy. In G. Ateniese & D. Venturi (Eds.), Applied Cryptography and Network Security: 20th International Conference, ACNS 2022, Proceedings (pp. 542-561). Springer. https://doi.org/10.1007/978-3-031-09234-3_27

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

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

Kamp, S. H., Magri, B., Matt, C., Nielsen, J. B., Thomsen, S. E. & Tschudi, D. (2021). Weight-Based Nakamoto-Style Blockchains. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021: 7th International Conference on Cryptology and Information Security in Latin America Bogotá, Colombia, October 6–8, 2021, Proceedings (pp. 299-319). Springer International Publishing. https://doi.org/10.1007/978-3-030-88238-9_15

Kamp, S. H., Nielsen, J. B., Thomsen, S. E. & Tschudi, D. (2022). Enig: Player Replaceable Finality Layers with Optimal Validity. Cryptology ePrint Archive. https://eprint.iacr.org/2022/201

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

Junio da Cruz, R., Guimaraes, A. & Aranha, D. F. (2020). Efficient and secure software implementations of Fantomas. Journal of Cryptographic Engineering, 10(3), 211–228. https://doi.org/10.1007/s13389-019-00218-2

Jensen, C. (Ed.), Lind Olsen, E. (Ed.), Mikkelsen, G. L., Syberg , L., Nielsen, L. L., Hansen, M. A. E., Hjortlund, M., Madsen, O. L., Høngaard Andersen, P. & Duvold, T. (2018). The future market for cybersecurity in Denmark.

Jawurek, M., Kerschbaum, F. & Orlandi, C. (2013). Zero-knowledge using garbled circuits: Or how to prove non-algebraic statements efficiently. In A.-R. Sadeghi , V. Gligor & M. Yung (Eds.), Proceedings of the ACM Conference on Computer and Communications Security, CCS '13 (pp. 955-966). Association for Computing Machinery. https://doi.org/10.1145/2508859.2516662

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2014). Framework for Outsourcing of Secure Computation. In G.-J. Ahn , A. Oprea & R. Safavi-Naini (Eds.), Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW '14 (pp. 81-92 ). Association for Computing Machinery. https://doi.org/10.1145/2664168.2664170

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://arxiv.org/pdf/1502.05273v1

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://eprint.iacr.org/2015/130

Jakobsen, J. & Orlandi, C. (2015). On the CCA (in)security of MTProto. http://eprint.iacr.org/2015/1177

Jakobsen, J. & Orlandi, C. (2016). On the CCA (in)security of MTProto. In Proceedings of the 6th Workshop on Security and Privacy in Smartphones and Mobile Devices: SPSM '16 (pp. 113-116). Association for Computing Machinery. https://doi.org/10.1145/2994459.2994468

Jakobsen, S. K. & Orlandi, C. (2016). How To Bootstrap Anonymous Communication. In ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (pp. 333-344). Association for Computing Machinery. https://doi.org/10.1145/2840728.2840743

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2016). A Framework for Outsourcing of Secure Computation. http://eprint.iacr.org/2016/037

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

Ishai, Y., Kumarasubramanian, A., Orlandi, C. & Sahai, A. (2011). On Invertible Sampling and Adaptive Security. Lecture Notes in Computer Science, 6477, 466-482. https://doi.org/10.1007/978-3-642-17373-8_27

Ishai, Y., Kushilevitz, E., Meldgaard, S. T., Orlandi, C. & Paskin-Cherniavsky, A. (2013). On the Power of Correlated Randomness in Secure Computation. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 600-620 ). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_34

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from The Coq Workshop 2020. https://coq-workshop.gitlab.io/2020/abstracts/Coq2020_04-02-primes.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from 2nd Workshop on Formal Methods for Blockchains. https://fmbc.gitlab.io/2020/files/FMBC2020.pdf

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

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

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

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

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

Displaying results 101 to 150 out of 567

3

Revised 07.03.2025

-

Marianne Dammand Iversen