Skip to main content

Data structures with unpredictable timing

Publication ,  Conference
Bethea, D; Reiter, MK
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
November 11, 2009

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. © 2009 Springer Berlin Heidelberg.

Duke Scholars

Altmetric Attention Stats
Dimensions Citation Stats

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

November 11, 2009

Volume

5789 LNCS

Start / End Page

456 / 471

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Bethea, D., & Reiter, M. K. (2009). Data structures with unpredictable timing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5789 LNCS, pp. 456–471). https://doi.org/10.1007/978-3-642-04444-1_28
Bethea, D., and M. K. Reiter. “Data structures with unpredictable timing.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5789 LNCS:456–71, 2009. https://doi.org/10.1007/978-3-642-04444-1_28.
Bethea D, Reiter MK. Data structures with unpredictable timing. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009. p. 456–71.
Bethea, D., and M. K. Reiter. “Data structures with unpredictable timing.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5789 LNCS, 2009, pp. 456–71. Scopus, doi:10.1007/978-3-642-04444-1_28.
Bethea D, Reiter MK. Data structures with unpredictable timing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009. p. 456–471.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

November 11, 2009

Volume

5789 LNCS

Start / End Page

456 / 471

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences