Sciweavers

87
Voted
IANDC
2006
77views more  IANDC 2006»
15 years 10 days ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank