Deterministic History-Independent Strategies for Storing Information on Write-Once Memories

Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In such environments, the majority of existing techniques for information storage and for security are susceptible to powerful adversarial attacks. We propose a mechanism for storing a set of at most K elements from a large universe of size N on write-once memories in a manner that does not reveal the insertion order of the elements. We consider a standard model for write-once memories, in which the memory is initialized to the all 0’s state, and the only operation allowed

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Tal Moran, Moni Naor, Gil Segev
• Keywords: ICALP 2007, Information Storage, Storage Mechanisms, Theoretical Computer Science, Vote Storage Mechanisms