Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Oliveira, L. B., Aranha, D. F., Morais, E., Daguano, F., Lopez, J. & Dahab, R. (2007). TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes. In Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)(NCA) (pp. 318-323). IEEE. https://doi.org/10.1109/NCA.2007.48

Oliveira, L. B., Aranha, D. F., Gouvea, C. P. L., Scott, M., Camara, D. F., Lopez, J. & Dahab, R. (2010). TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks. Computer Communications, 34(3), 485-493. https://doi.org/10.1016/j.comcom.2010.05.013

Döttling, N. M., Ghosh, S., Nielsen, J. B., Nilges, T. & Trifiletti, R. (2017). TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security: CCS '17 (pp. 2263-2276). Association for Computing Machinery. https://doi.org/10.1145/3133956.3134024

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

Melissaris Papanikolaou, N., Ravi, D. & Yakoubov, S. (2024). Threshold-Optimal MPC With Friends and Foes. In A. Chattopadhyay, S. Bhasin, S. Picek & C. Rebeiro (Eds.), Progress in Cryptology – INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II (Vol. 2, pp. 3-24). Springer. https://doi.org/10.1007/978-3-031-56235-8_1

Bendlin, R. & Damgård, I. B. (2010). Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. Lecture Notes in Computer Science, 5978, 201-218. https://doi.org/10.1007/978-3-642-11799-2_13

Damgård, I., Nielsen, J. B., Nielsen, M. & Ranellucci, S. (2017). The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited. In J. Katz & H. Shacham (Eds.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Vol. 10401, pp. 167-187). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_6

Damgård, I. B., Groth, J., Salomonsen, G. & Gritzalis, D. (Ed.) (2002). The Theory and Implementation of Electronic Voting Systems. In Secure Electronic Voting (Vol. 7, pp. 77-100). Kluwer Academic Publishers.

Aranha, D. F., Engelmann, F. T., Kolby, S. & Yakoubov, S. (2022). The State of the Union: Union-Only Signatures for Data Aggregation. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 387-410). Springer. https://doi.org/10.1007/978-3-031-14791-3_17

Troi, A., Jørgensen, B. N., Larsen, E. M., Blaabjerg, F., Mikkelsen, G. L., Slente, H. P., Madsen, H., Østergaard, J., Entwistle, J. M., Nordentoft, N. C., Meibom, P., Jacobsen, R. H., Thorvildsen, S. & Jørgensen, U. (2013). The smart grid research network: Road map for smart grid research, development and demonstration up to 2020. http://orbit.dtu.dk/fedora/objects/orbit:120708/datastreams/file_593c582c-5f51-4d45-adb4-290c796ad776/content

Chou, T. & Orlandi, C. (2015). The Simplest Protocol for Oblivious Transfer. http://eprint.iacr.org/2015/267

Chou, T. & Orlandi, C. (2015). The simplest protocol for oblivious transfer. In K. Lauter & F. Rodríguez-Henríquez (Eds.), Progress in Cryptology - LATINCRYPT 2015: 4th International Conference on Cryptology and Information Security in Latin America, Guadalajara, Mexico, August 23-26, 2015, Proceedings (Vol. 9230, pp. 40-58). Springer. https://doi.org/10.1007/978-3-319-22174-8_3

Aranha, D. F. & Pagnin, E. (2019). The simplest multi-key linearly homomorphic signature scheme. In P. Schwabe & N. Thériault (Eds.), Progress in Cryptology – LATINCRYPT 2019 (pp. 280-300). Springer. https://doi.org/10.1007/978-3-030-30530-7_14

Orlandi, C., Scholl, P. & Yakoubov, S. (2021). The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. In A. Canteaut & F.-X. Standaert (Eds.), Advances in Cryptology – EUROCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 678-708). Springer. https://doi.org/10.1007/978-3-030-77870-5_24

Nayara Ortiz, J., Ricardo de Araujo, R., Aranha, D. F., Rodrigues Costa, S. I. & Dahab, R. (2021). The Ring-LWE Problem in Lattice-based Cryptography: The Case of Twisted Embeddings. Entropy, 23(9), Article 1108. https://doi.org/10.3390/e23091108

Aranha, D. F., Barbosa, P. Y. S., Cardoso, T. N. C., Araújo, C. L. & Matias, P. (2019). The return of software vulnerabilities in the Brazilian voting machine. Computers & Security, 86, 335-349. https://doi.org/10.1016/j.cose.2019.06.009

Aranha, D. F., Barreto, P. S. L. M., Longa, P. & Ricardini, J. E. (2014). The Realm of the Pairings. In T. Lange, K. Lauter & P. Lisonek (Eds.), Selected Areas in Cryptography -- SAC 2013 (pp. 3-25). Springer. https://doi.org/10.1007/978-3-662-43414-7_1

Dodis, Y. & Nielsen, J. B. (Eds.) (2015). Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II. Springer VS. Lecture Notes in Computer Science Vol. 9015 https://doi.org/10.1007/978-3-662-46497-7

Dodis, Y. & Nielsen, J. B. (Eds.) (2015). Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. Springer VS. Lecture Notes in Computer Science Vol. 9014 https://doi.org/10.1007/978-3-662-46494-6

Damgård, I. B. (2006). Theory and Practice of Multiparty Computation. In R. De Prisco & M. Yung (Eds.), Security and Cryptography for Networks: 5th International Conference, SCN 2006, Maiori, Italy, September 6-8, 2006. Proceedings (pp. 360-364). Springer. https://doi.org/10.1007/11832072_25

Aranha, D. F. & van de Graaf, J. (2019). The Good, the Bad, and the Ugly: Two Decades of E-Voting in Brazil. IEEE Security & Privacy, 16(6), 22-30. Article 8636417. https://doi.org/10.1109/MSEC.2018.2875318

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.

Oliveira, L. B., Quintao Pereira, F. M., Misoczki, R., Aranha, D. F., Borges, F. & Liu, J. (2017). The Computer for the 21st Century: Security & Privacy Challenges After 25 Years. In 2017 26th International Conference on Computer Communications and Networks, ICCCN 2017 Article 8038394 IEEE. https://doi.org/10.1109/ICCCN.2017.8038394

Oliveira, L. B., Pereira, F. M. Q., Misoczki, R., Aranha, D. F., Borges, F., Nogueira, M., Wangham, M., Wu, M. & Liu, J. (2018). The computer for the 21st century: present security & privacy challenges. Journal of Internet Services and Applications, 9(24), Article 24. https://doi.org/10.1186/s13174-018-0095-2

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2015). The Chaining Lemma and its application. In A. Lehmann & S. Wolf (Eds.), Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (pp. 181-196). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_11

Damgård, I. B. & Knudsen, L. R. (1994). The breaking of the AR Hash Function. In T. Helleseth (Ed.), Advances in Cryptology - EUROCRYPT '93: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23-27, 1993 Proceedings Springer. https://doi.org/10.1007/3-540-48285-7_25

Baum, C., David, B., Dowsley, R., Nielsen, J. B. & Oechsner, S. (2021). TARDIS: A Foundation of Time-Lock Puzzles in UC. In Advances in Cryptology – EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 429-459|). Springer. https://doi.org/10.1007/978-3-030-77883-5_15

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2013). Tamper Resilient Cryptography Without Self-Destruct. IACR Cryptology ePrint Archive, (2013). http://eprint.iacr.org/2013/124

Nielsen, J. B. (2015). Tamper and leakage resilient von Neumann architectures from continuous non-malleable codes. In S. Wolf & A. Lehmann (Eds.), 8th International Conference on Information Theoretic Security, ICITS 2015 (Vol. 9063, pp. XI-XII). Springer.

Canetti, R., Kolby, S., Ravi, D., Soria Vazquez, E. & Yakoubov, S. (2023). Taming Adaptivity in YOSO Protocols: The Modular Way. In G. Rothblum & H. Wee (Eds.), Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II (Vol. 2, pp. 33-62). Springer. https://doi.org/10.1007/978-3-031-48618-0_2

Damgård, I. B., Funder, J. L., Nielsen, J. B. & Salvail, L. (2011). Superposition Attacks on Cryptographic Protocols. http://arxiv.org/abs/1108.6313v1

Damgård, I. B., Funder, J., Nielsen, J. B. & Salvail, L. (2014). Superposition attacks on cryptographic protocols. In C. Padró (Ed.), Information Theoretic Security: 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings (pp. 142-161). Springer. https://doi.org/10.1007/978-3-319-04268-8_9

Nielsen, J. B. (Ed.), Damgård, I. B., Salvail, L. & Cachin, C. (2006). Summary Report on Unconditionally Secure Protocols. (pp. 1- 25). ECRYPT - European Network of Excellence in Cryptology.

Nielsen, J. B. (Ed.), Alwen, J., Cachin, C., Pereira, O., Sadeghi, A.-R., Schoenmakers, B., Shelat, A. & Visconti, I. (2007). Summary Report on Rational Cryptographic Protocols. ECRYPT - European Network of Excellence in Cryptology.

Campanelli, M. & Khoshakhlagh, H. (2021). Succinct Publicly-Certifiable Proofs: Or, Can a Blockchain Verify a Designated-Verifier Proof? In A. Adhikari, R. Küsters & B. Preneel (Eds.), Progress in Cryptology – INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, 2021, Proceedings: 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings (pp. 607-631). Springer. https://doi.org/10.1007/978-3-030-92518-5_27

Abram, D., Roy, L. & Scholl, P. (2024). Succinct Homomorphic Secret Sharing. In M. Joye & G. Leander (Eds.), Advances in Cryptology -- EUROCRYPT 2024 (pp. 301-330). Springer Nature. https://doi.org/10.1007/978-3-031-58751-1_11

Campanelli, M., Francati, D. & Orlandi, C. (2023). Structure-Preserving Compilers from New Notions of Obfuscations. In A. Boldyreva & V. Kolesnikov (Eds.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part II (pp. 663-693). Springer. https://doi.org/10.1007/978-3-031-31371-4_23

Couteau, G., Bui, D. & Melissaris Papanikolaou, N. (2024). Structured-Seed Local Pseudorandom Generators and their Applications. https://eprint.iacr.org/2024/1027

Damgård, I., Haagh, H., Mercer, R., Nitulescu, A., Orlandi, C. & Yakoubov, S. (2020). Stronger Security and Constructions of Multi-designated Verifier Signatures. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings: Proceedings (Vol. II, pp. 229-260). Springer. https://doi.org/10.1007/978-3-030-64378-2_9

Munch-Hansen, A., Orlandi, C. & Yakoubov, S. (2021). Stronger Notions and a More Efficient Construction of Threshold Ring Signatures. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 363-381). Springer. https://doi.org/10.1007/978-3-030-88238-9_18

Aggarwal, D., Damgård, I., Nielsen, J. B., Obremski, M., Purwanto, E., Ribeiro, J. & Simkin, M. (2019). Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. 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. 510-539). Springer. https://doi.org/10.1007/978-3-030-26951-7_18

Damgård, I. B., Pedersen, T. P. & Pfitzmann, B. (1998). Statistical secrecy and multibit commitments. I E E E Transactions on Information Theory, 44(3), 1143-1151. https://doi.org/10.1109/18.669255

Orlandi, C., Ostrovsky, R., Rao, V., Sahai, A. & Visconti, I. (2014). Statistical Concurrent Non-malleable Zero Knowledge. In Y. Lindell (Ed.), Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, 2014. Proceedings (pp. 167-191). Springer Publishing Company. https://doi.org/10.1007/978-3-642-54242-8_8

Woodcock, J., Andersen, M. S., Aranha, D. F., Hallerstede, S., Hansen, S. T., Jakobsen, N. K., Kulik, T., Larsen, P. G., Macedo, H. D., Martin, C. I. I. & Norrild, V. A. M. (2023). State of the Art Report: Verified Computation. https://doi.org/10.48550/arXiv.2308.15191

Aardal, M. A., Adj, G., F. Aranha, D., Basso, A., Canales Martínez, I. A., Chávez-Saab, J., Corte-Real Santos, M., Dartois, P., De Feo, L., Duparc, M., Komada Eriksen, J., Fouotsa, T. B., Filho, D. L. G., Hess, B., Kohel, D., Leroux, A., Longa, P., Maino, L., Meyer, M. ... Wesolowski, B. (2025). SQIsign 2.0: Algorithm specifications and supporting documentation. https://sqisign.org/spec/sqisign-20250205.pdf

Brandt, J., Damgård, I. B. & Landrock, P. (1993). Speeding up prime number generation. In Advances in cryptology - ASIACRYPT '91 (pp. 440-449). Springer. https://doi.org/10.1007/3-540-57332-1

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. Journal of Cryptographic Engineering, 1, 187-199. https://doi.org/10.1007/s13389-011-0017-8

Cramer, R., Damgård, I., Escudero, D., Scholl, P. & Xing, C. (2018). SPDΖ₂k: Efficient MPC mod 2^k for Dishonest Majority. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology - CRYPTO 2018 (Vol. 10992, pp. 769-798). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_26

Rodriguez, B., Pereira, F. M. Q. & Aranha, D. F. (2016). Sparse representation of implicit flows with applications to side-channel detection. In Proceedings of CC 2016: The 25th International Conference on Compiler Construction (pp. 110-120). ACM. https://doi.org/10.1145/2892208.2892230

Displaying results 51 to 100 out of 571

2

Revised 07.03.2025

-

Marianne Dammand Iversen