Publications

List of publications

Sort by: Date | Author | Title

Ghosh, S. (2019). Secure Computation Based On Oblivious Linear Function Evaluation. Aarhus Universitet.

Damgård, I., Ravi, D., Tschudi, D. & Yakoubov, S. (2023). Secure Communication in Dynamic Incomplete Networks. In K-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 13:1--13:21). Article 13 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2023.13

Applebaum, B., Damgård, I., Ishai, Y., Nielsen, M. & Zichron, L. (2017). Secure Arithmetic Computation with Constant Computational Overhead. In H. Shacham & J. Katz (Eds.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Vol. 10401, pp. 223-254). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_8

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

Reistad, T. & Toft, T. (2009). Secret Sharing Comparison by Transformation and Rotation. Lecture Notes in Computer Science, 169-180. https://doi.org/10.1007/978-3-642-10230-1_14

Damgård, I. B., Kölker, J. & Miltersen, P. B. (2012). Secret Sharing and Secure Computing from Monotone Formulae. http://eprint.iacr.org/2012/536

Damgård, I. B. & Cramer, R. (2004). Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. In M. Naor (Ed.), Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004. Proceedings (pp. 223-237). Springer. https://doi.org/10.1007/978-3-540-24638-1_13

Chillotti, I., Orsini, E., Scholl, P., Smart, N. P. & Leeuwen, B. V. (2022). Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 540-563). Springer. https://doi.org/10.1007/978-3-031-14791-3_24

Damgård, I. B. & Ishai, Y. (2006). Scalable Secure Multiparty Computation. In C. Dwork (Ed.), Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings (pp. 501-520). Springer. https://doi.org/10.1007/11818175_30

Damgård, I. B., Krøigaard, M., Ishai, Y., Nielsen, J. B. & Smith, A. (2008). Scalable Multiparty Computation with Nearly Optimal Work and Resilience. Lecture Notes in Computer Science, 5157, 241-261. https://doi.org/10.1007/978-3-540-85174-5_14

Damgård, I. B. & Jurik, M. J. (2003). Scalable Key-Escrow. B R I C S Report Series, (RS-03-22).

Damgård, I. B. & Nielsen, J. B. (2007). Scalable and Unconditionally Secure Multiparty Computation. In A. Menezes (Ed.), Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (pp. 572-590). Springer. https://doi.org/10.1007/978-3-540-74143-5_32

Ciampi, M., Ravi, D., Siniscalchi, L. & Waldner, H. (2022). Round-Optimal Multi-party Computation with Identifiable Abort. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 335-364). Springer. https://doi.org/10.1007/978-3-031-06944-4_12

Blundo, C., Cimato, S. & Siniscalchi, L. (2022). Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints. Computer Journal, 65(6), 1386-1411. https://doi.org/10.1093/comjnl/bxaa186

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

Damgård, I. B. & Pedersen, M. Ø. (2008). RFID Security: Tradeoffs between Security and Efficiency. Lecture Notes in Computer Science, 318-332. https://doi.org/10.1007/978-3-540-79263-5

Chakraborty, S., Dziembowski, S. & Nielsen, J. B. (2020). Reverse firewalls for actively secure mpcs. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 732-762). Springer. https://doi.org/10.1007/978-3-030-56880-1_26

Chakraborty, S., Ganesh, C., Pancholi, M. R. & Sarkar, P. (2021). Reverse Firewalls for Adaptively Secure MPC without Setup. In M. Tibouchi & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part 2: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part II (pp. 335-364). Springer. https://doi.org/10.1007/978-3-030-92075-3_12

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

Cascudo, I., Damgård, I., Farràs, O. & Ranellucci, S. (2017). Resource-Efficient OT Combiners with Active Security. In Y. Kalai & L. Reyzin (Eds.), Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Vol. 10678, pp. 461-486). Springer VS. https://doi.org/10.1007/978-3-319-70503-3_15

Barcellos, M. & Aranha, D. F. (2018). Research in Security and Privacy in Brazil. IEEE Security & Privacy, 16(6), 14-21. Article 8636416. https://doi.org/10.1109/MSEC.2018.2874855

Canetti, R., Krawczyk, H. & Nielsen, J. B. (2003). Relaxing Chosen-Ciphertext Security. In D. Boneh (Ed.), Advances in Cryptology - CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings (pp. 565-582). Springer. https://doi.org/10.1007/978-3-540-45146-4_33

Kondi, Y., Magri, B., Orlandi, C. & Shlomovits, O. (2021). Refresh when you wake up: Proactive threshold wallets with offline devices. In 2021 IEEE Symposium on Security and Privacy (SP) (pp. 608-625). IEEE. https://doi.org/10.1109/SP40001.2021.00067

Deuber, D., Magri, B. & Thyagarajan, S. A. K. (2019). Redactable blockchain in the permissionless setting. In Proceedings - 2019 IEEE Symposium on Security and Privacy, SP 2019 (pp. 124-138). Article 8835372 IEEE. https://doi.org/10.1109/SP.2019.00039

Díaz Cardell, S., Aranha, D. F. & Fuster-Sabater, A. (2020). Recovering decimation-based cryptographic sequences by means of linear CAs. Logic Journal of the IGPL, 28(4), 430–448. https://doi.org/10.1093/jigpal/jzz051

Nielsen, J. B. & Ranellucci, S. (2016). Reactive garbling: Foundation, instantiation, application. In J. H. Cheon & T. Takagi (Eds.), Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 10032, pp. 1022-1052). Springer VS. https://doi.org/10.1007/978-3-662-53890-6_34

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

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

Cascudo, I., Damgård, I., David, B. M., Döttling, N. & Nielsen, J. B. (2016). Rate-1, linear time and additively homomorphic UC commitments. In M. Robshaw & J. Katz (Eds.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings (Vol. 9816, pp. 179-207). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_7

Baena, J., Cabarcas, D., Escudero, D. E., Khathuria, K. & Verbel, J. (2018). Rank Analysis of Cubic Multivariate Cryptosystems. In T. Lange & R. Steinwandt (Eds.), Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings (Vol. 10786, pp. 355-374). Springer VS. https://doi.org/10.1007/978-3-319-79063-3_17

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

Fauzi, P. M., Meiklejohn, S., Mercer, R. H. & Orlandi, C. (2019). Quisquis: A New Design for Anonymous Cryptocurrencies. In Advances in Cryptology – ASIACRYPT 2019 (pp. 649-678) https://doi.org/10.1007/978-3-030-34578-5

Damgård, I. B. & Lunemann, C. (2009). Quantum-Secure Coin-Flipping and Applications. Lecture Notes in Computer Science, 52-69. https://doi.org/10.1007/978-3-642-10366-7_4

Damgård, I. B. (2011). Quantum Communication Attacks on Classical Cryptographic Protocols. Abstract from 5th International Conference on Information Theoretic Security, Amsterdam, Netherlands. https://doi.org/10.1007/978-3-642-20728-0_16

Davi Resende, A. C., Mochetti, K. & Aranha, D. F. (2015). PUF-Based Mutual Multifactor Entity and Transaction Authentication for Secure Banking. In T. Güneysu, G. Leander & A. Moradi (Eds.), Lightweight Cryptography for Security and Privacy (pp. 77-96). Springer. https://doi.org/10.1007/978-3-319-29078-2_5

Baum, C., David, B. & Dowsley, R. (2022). (Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. In C. Ge & F. Guo (Eds.), Provable and Practical Security - 16th International Conference, ProvSec 2022, Proceedings (pp. 249-272). Springer. https://doi.org/10.1007/978-3-031-20917-8_17

Scafuro, A., Siniscalchi, L. & Visconti, I. (2021). Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021: 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10–13, 2021, Proceedings, Part II (pp. 469-498). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-75248-4_17

Scafuro, A., Siniscalchi, L. & Visconti, I. (2019). Publicly Verifiable Proofs from Blockchains. In D. Lin & K. Sako (Eds.), Public-Key Cryptography – PKC 2019 (pp. 374-401). Springer. https://doi.org/10.1007/978-3-030-17253-4_13

Baum, C., Damgård, I. B. & Orlandi, C. (2014). Publicly Auditable Secure Multi-Party Computation. In M. Abdalla & R. D. Prisco (Eds.), Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 175-196 ). Springer VS. https://doi.org/10.1007/978-3-319-10879-7_11

Damgård, I. B., Hofheinz, D., Kiltz, E. & Thorbek, R. I. (2008). Public-Key Encryption with Non-interactive Opening. Lecture Notes in Computer Science, 239-255. https://doi.org/10.1007/978-3-540-79263-5_15

Zottarel, A. (2013). Public key cryptography from weaker assumptions. Institut for Datalogi, Aarhus Universitet.

Ateniese, G., Francati, D., Magri, B. & Venturi, D. (2019). Public immunization against complete subversion without random oracles. In R. H. Deng, V. Gauthier-Umanã, M. Ochoa & M. Yung (Eds.), Applied Cryptography and Network Security (pp. 465-485). Springer. https://doi.org/10.1007/978-3-030-21568-2_23

Floriano, E., Alchieri, E., Aranha, D. F. & Solis, P. (2017). Providing privacy on the tuple space model. Journal of Internet Services and Applications, 8(19), Article 19. https://doi.org/10.1186/s13174-017-0070-3

Damgård, I. B., Ganesh, C. & Orlandi, C. (2019). Proofs of Replicated Storage Without Timing Assumptions. In Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (pp. 355-380). Springer. https://doi.org/10.1007/978-3-030-26948-7_13

Cramer, R., Damgård, I. B. & Schoenmakers, B. (1994). Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Y. G. Desmedt (Ed.), Advances in Cryptology - CRYPTO '94: 14th Annual International Cryptology Conference Santa Barbara, California, USA August 21-25, 1994 Proceedings (pp. 174-187). Springer. https://doi.org/10.1007/3-540-48658-5_19

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

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

Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I. & Toft, T. (2009). Privacy-Preserving Face Recognition. Lecture Notes in Computer Science, 235-253. https://doi.org/10.1007/978-3-642-03168-7_14

Erkin, Z., Veugen, T., Toft, T. & Lagendijk, R. L. (2013). Privacy-preserving distributed clustering. Eurasip Journal on Information Security, 1, Article 4. https://doi.org/10.1186/1687-417X-2013-4

Displaying results 151 to 200 out of 617

Revised 02.06.2023

Marianne Dammand Iversen