Protocol constructions Proof of secure erasure




1 protocol constructions

1.1 naive approach
1.2 communication-efficient constructions
1.3 communication- , time-efficient constructions





protocol constructions
naive approach

in simplest implementation verifier sends random message large device s memory device, expected store it. after device has received complete message, required send back. security of approach obvious, includes transfer of huge amount of data (twice size of device s memory).


this can halved if device responds hash of message. prevent device computing on fly without storing message, hash function parametrized random value sent device after message.


communication-efficient constructions

avoiding huge data transfer requires suitable (as stated in overview) computational problem, description short. dziembowski et al. achieve constructing call (m − δ, ε)-uncomputable hash function, can computed in quadratic time using memory of size m, memory of size m − δ can computed @ negligible probability ε.


communication- , time-efficient constructions

karvelas , kiayias claim have designed first pose quasilinear time , sublinear communication complexity.








Comments

Popular posts from this blog

1940-1941 Pontiac Torpedo

1920–1923 List of 1920s jazz standards

Sovereign Building Zollinger-Harned Company Building