Thomas Attema

Full Name

T. Attema

Email

Thomas.Attema@cwi.nl

Phone

+31 20 592 4384

Room

M265

Department(s)

Cryptology

Function(s)

Researcher - TNO

Thomas Attema

Attema, T., Fehr, S., & Resch, N. (2023). Generalized special-sound interactive proofs and their knowledge soundness. In Theory of Cryptography Conference (TCC) (pp. 424–454). doi:10.1007/978-3-031-48621-0_15
Attema, T., Fehr, S., & Klooss, M. (2023). Fiat–Shamir transformation of multi-round interactive proofs (extended version). Journal of Cryptology, 36(4), 36:1–36:45. doi:10.1007/s00145-023-09478-y
Attema, T. (2023, June). Compressed Σ-protocol theory. Retrieved from http://hdl.handle.net/1887/3619596
Attema, T., Capitao, P., & Kohl, L. (2023). On Homomorphic Secret Sharing from polynomial-modulus LWE. In Public-Key Cryptography (pp. 3–32). doi:10.1007/978-3-031-31371-4_1
Attema, T., Fehr, S., & Klooss, M. (2022). Fiat-Shamir transformation of multi-round interactive proofs. In International Conference on Theory of Cryptography (pp. 113–142). doi:10.1007/978-3-031-22318-1_5
Attema, T., Cascudo, I., Cramer, R., Damgård, I., & Escudero, D. (2022). Vector commitments over rings and compressed Σ-protocols. In Proceedings of the Theory of Cryptography Conference (pp. 173–202). doi:10.1007/978-3-031-22318-1_7
Spini, G., Mancini, E., Attema, T., Abspoel, M., de Gier, J., Fehr, S., … Sloot, P. (2022). New approach to privacy-preserving clinical decision support systems for HIV treatment. Journal of Medical Systems, 46(12), 84:1–84:11. doi:10.1007/s10916-022-01851-x
Attema, T., & Fehr, S. (2022). Parallel repetition of (k_1, ..,k_\mu)-special-sound multi-round interactive proofs. In Advances in Cryptology - CRYPTO 2022 (pp. 415–443). doi:10.1007/978-3-031-15802-5_15
Attema, T., Dunning, V., Everts, M., & Langenkamp, P. (2022). Efficient compiler to covert security with public verifiability for honest majority MPC. In Proceedings of ACNS 2022 (pp. 663–683). doi:10.1007/978-3-031-09234-3_33
Attema, T., Cramer, R., & Rambaud, M. (2021). Compressed Σ -Protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures. In Advances in Cryptology - ASIACRYPT 2021 (pp. 526–556). doi:10.1007/978-3-030-92068-5_18