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

Hubacek, P. & Park, S. (2014). Cryptographically Blinded Games: Leveraging Players' Limitations for Equilibria and Profit. In M. Babaioff (Ed.), 15th ACM Conference on Economics and Computation, EC '14 (pp. 207-208). Association for Computing Machinery. https://doi.org/10.1145/2600057.2602903

Hubacek, P. (2014). Rationality in the Cryptographic Model. Department of Computer Science, Aarhus University.

Hubacek, P. & Wichs, D. (2015). On the Communication Complexity of Secure Function Evaluation with Long Output. In T. Roughgarden (Ed.), Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS '15 (pp. 163-172 ). Association for Computing Machinery. https://doi.org/10.1145/2688073.2688105

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 3494. 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. & Toft, T. (2010). Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. Lecture Notes in Computer Science, 6477, 195-212. https://doi.org/10.1007/978-3-642-17373-8_12

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. & Toft, T. (2014). Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. Journal of Cryptology, 27(2), 358-395. https://doi.org/10.1007/s00145-013-9147-8

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. Advance online publication. 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, K. M., Larsen, S. B., Pagter, J. I., Pedersen, M. Ø. & Thomsen, J. (2004). An Evaluation of an OSGi-based Residential Pervasive Computing Platform. In N. Guimarães & P. Isaías (Eds.), Proceedings of the IADIS Applied Computing Conference (pp. 246-253). International Association for Development, IADIS. http://www.iadis.net/dl/Search_list_open.asp?code=602

Hansen, K. M., Antolin Rafael, P., Camara, J., Carro, S., Metha, G., Rosengren, P., Pagter, J. I. & Pedersen, M. Ø. (2005). eu-DOMAIN D3.1 + D4.1 Software Architecture Specification.

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. & Schwartzbach, N. I. (2021). Game Theory on the Blockchain: A Model for Games with Smart Contracts. In I. Caragiannis & K. A. Hansen (Eds.), Algorithmic Game Theory - 14th International Symposium, SAGT 2021, Proceedings: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021Proceedings (pp. 156-170). Springer. https://doi.org/10.1007/978-3-030-85947-3_11

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

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P-Y. (2018, Jun 19). Computer-aided proofs for multiparty computation with active security. arXiv.org. Computer Security Foundations https://arxiv.org/abs/1806.07197

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P. (2018). Computer-Aided Proofs for Multiparty Computation with Active Security. In Proceedings - IEEE 31st Computer Security Foundations Symposium, CSF 2018 (Vol. 2018, pp. 119-131). Article 8429300 IEEE. https://doi.org/10.1109/CSF.2018.00016

Guo, S., Hubacek, P., Rosen, A. & Vald, M. (2014). Rational Arguments: Single Round Delegation with Sublinear Verification. In M. Naor (Ed.), Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS '14 (pp. 523-540 ). Association for Computing Machinery. https://doi.org/10.1145/2554797.2554845

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

Gregersen, S. O., Thomsen, S. E. & Askarov, A. (2019). A Dependently Typed Library for Static Information-Flow Control in IDRIS. In F. Nielson & D. Sands (Eds.), Principles of Security and Trust: 8th International Conference, POST 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings (pp. 51-75). Springer. https://doi.org/10.1007/978-3-030-17138-4_3

Goel, A., Hall-Andersen, M., Hegde, A. & Jain, A. (2022). Secure Multiparty Computation with Free Branching. 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. 397-426). Springer. https://doi.org/10.1007/978-3-031-06944-4_14

Goel, A., Green, M., Hall-Andersen, M. & Kaptchuk, G. (2022). Stacking Sigmas: A Framework to Compose Σ -Protocols for Disjunctions. 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. 458-487). Springer. https://doi.org/10.1007/978-3-031-07085-3_16

Goel, A., Green, M., Hall-Andersen, M. N. & Kaptchuk, G. (2022). Efficient Set Membership Proofs using MPC-in-the-Head. Proceedings on Privacy Enhancing Technologies, 2022(2), 304-324. https://doi.org/10.2478/popets-2022-0047

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. (2019). Secure Computation Based On Oblivious Linear Function Evaluation. Aarhus Universitet.

Ghosh, S. & Nilges, T. (2019). An algebraic approach to maliciously secure private set intersection. 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. 154-185). Springer VS. https://doi.org/10.1007/978-3-030-17659-4_6

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., Magri, B. & Venturi, D. (2020). Cryptographic reverse firewalls for interactive proof systems. In A. Czumaj, A. Dawar & E. Merelli (Eds.), 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 (pp. 55:1-55:16). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2020.55

Ganesh, C., Magri, B. & Venturi, D. (2021). Cryptographic reverse firewalls for interactive proof systems. Theoretical Computer Science, 855, 104-132. https://doi.org/10.1016/j.tcs.2020.11.043

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

Displaying results 151 to 200 out of 617

4

Revised 02.06.2023

-

Marianne Dammand Iversen