Rotem Oshman

Fully-non-leaking wait-free implementations are possible for some concurrent objects, but not all—revealing critical limitations in information security for concurrent systems.

A lock-free hash table design achieves wait-free lookups without sacrificing space efficiency, challenging the limitations of existing concurrent hash table implementations.

Even with adaptive adversaries and write contention, practical concurrent primitives can achieve logarithmic latency using only constant hardware resources.