( en | de | ru )

 

Disambiguation of "Mularczyk, Marta"

Author of the publication

copydeleteadd this publication to your clipboard
Fork-Resilient Continuous Group Key Agreement.

, , and . CRYPTO (4), volume 14084 of Lecture Notes in Computer Science, page 396-429. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Fares Martak

Martarizal

Hans Martan

Thomas Martau

Kenneth Martay

 

Other publications of authors with the same name

Server-Aided Continuous Group Key Agreement., , , and . CCS, page 69-82. ACM, (2022)Post-Quantum Multi-Recipient Public Key Encryption., , , , and . CCS, page 1108-1122. ACM, (2023)Post-Quantum Multi-Recipient Public Key Encryption., , , , and . IACR Cryptol. ePrint Arch., (2022)A Unified and Composable Take on Ratcheting., , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 180-210. Springer, (2019)Topology-Hiding Computation Beyond Semi-Honest Adversaries., , , , , and . TCC (2), volume 11240 of Lecture Notes in Computer Science, page 3-35. Springer, (2018)Efficient MPC with a Mixed Adversary., and . ITC, volume 163 of LIPIcs, page 3:1-3:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Server-Aided Continuous Group Key Agreement., , , and . IACR Cryptol. ePrint Arch., (2021)Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging., , and . EUROCRYPT (1), volume 11476 of Lecture Notes in Computer Science, page 159-188. Springer, (2019)Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging., , and . IACR Cryptology ePrint Archive, (2018)Topology-Hiding Computation for Networks with Unknown Delays., , , , , and . Public Key Cryptography (2), volume 12111 of Lecture Notes in Computer Science, page 215-245. Springer, (2020)