Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Efficient Proofs of Secure Erasure
verfasst von : Nikolaos P. Karvelas, Aggelos Kiayias
Erschienen in: Security and Cryptography for Networks
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A proof of secure erasure (PoSE) enables a space restricted prover to convince a verifier that he has erased his memory of size
S
. So far the only known PoSEs have linear communication complexity in
S
or quadratic computation complexity in
S
, hence their applicability is limited, since Θ(
S
) communication or Θ(
S
2
) computation can be quite impractical (e.g., for devices with
S
memory words when
S
is in the order of GB’s). In this work we put forth two new PoSEs that for the first time achieve
sublinear
communication and
quasilinear
computation complexity hence they are more efficient than what was previously known. Efficiency comes at the price of slightly more relaxed security guarantees that we describe and motivate.