Self-adjusting binary search trees
Journal of the ACM (JACM)
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
A skip list cookbook
Concurrent maintenance of skip lists
Concurrent maintenance of skip lists
Online computation and competitive analysis
Online computation and competitive analysis
A killer adversary for quicksort
Software—Practice & Experience
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Fast Content-Based Packet Handling for Intrusion Detection
Fast Content-Based Packet Handling for Intrusion Detection
Denial of service via algorithmic complexity attacks
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Remote timing attacks are practical
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web security
| Hi-index | 0.01 |
A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an adversary can predict the durations of operations that he will induce on the data structure. In this paper we introduce the problem of designing data structures that confound an adversary attempting to predict the timing of future operations he induces, even if he has adaptive and exclusive access to the data structure and the timings of past operations. We also design a data structure for implementing a set (supporting membership query, insertion, and deletion) that exhibits timing unpredictability and that retains its efficiency despite adversarial attacks. To demonstrate these advantages, we develop a framework by which an adversary tracks a probability distribution on the data structure's state based on the timings it emitted, and infers invocations to meet his attack goals.