Perfectly Secure Password Protocols in the Bounded Retrieval Model

Abstract

We introduce a formal model, which we call the Bounded Retrieval Model, for the design and analysis of cryptographic protocols remaining secure against intruders that can retrieve a limited amount of parties’ private memory. The underlying model assumption on the intruders’ behavior is supported by real-life physical and logical considerations, such as the… (More)
DOI: 10.1007/11681878_12

Topics

1 Figure or Table

Statistics

01020'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

119 Citations

Semantic Scholar estimates that this publication has 119 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics