Skip To Main Content
Martijn Stam on Muck Rack

Martijn Stam

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile
Back to Martijn Stam’s profile

Articles by Martijn Stam

Dynamic Security Aspects of Onion Routing

|
By Martijn Stam, Øyvind Ytrehus, Simula UiB, Alessandro Melloni
| eprint.iacr.org
Paper 2023/1439 , Simula UiB , Simula UiB , Simula UiB An anonymous communication network (ACN) is designed to protect the identities of two parties communicating through it, even if an adversary controls or observes parts of the network. Among the ACNs, Tor represents a practical trade-off between offering a reasonable level of anonymity and, simultaneously, an acceptable transmission delay.
Open in Who Shared Issue with article?

SoK: Public Key Encryption with Openings

|
By Carlo Brunetta, Hans Heum, Martijn Stam, Simula UiB
| eprint.iacr.org
Paper 2023/1337 , Simula UiB , NTNU - Norwegian University of Science and Technology , Simula UiB When modelling how public key encryption can enable secure communication, we should acknowledge that secret information, such as private keys or the randomness used for encryption, could become compromised. Intuitively, one would expect unrelated communication to remain secure, yet formalizing this intuition has proven challenging.
Open in Who Shared Issue with article?

Multi-Instance Secure Public-Key Encryption

|
By Hans Heum, Martijn Stam, Simula UiB, Carlo Brunetta
| eprint.iacr.org
Paper 2022/909 Multi-Instance Secure Public-Key Encryption , Simula UiB , Simula UiB , Simula UiB Abstract Mass surveillance targets many users at the same time with the goal of learning as much as possible. Intuitively, breaking many users’ cryptography simultaneously should be at least as hard as that of only breaking a single one, but ideally security degradation is gradual: an adversary ought to work harder to break more.
Open in Who Shared Issue with article?

Tightness Subtleties for Multi-user PKE Notions

|
By Hans Heum, Martijn Stam, Simula UiB
| eprint.iacr.org
Paper 2022/855 Tightness Subtleties for Multi-user PKE Notions , Simula UiB , Simula UiB Abstract Public key encryption schemes are increasingly being studied concretely, with an emphasis on tight bounds even in a multi-user setting. Here, two types of formalization have emerged, one with a single challenge bit and one with multiple challenge bits. Another modelling choice is whether to allow key corruptions or not.
Open in Who Shared Issue with article?
Show More