Deterministic history-independent strategies for storing information on write-once memories

Tal Moran*, Moni Naor, Gil Segev

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Motivated by the challenging task of designing "secure" vote storage mechanisms, we deal with 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. In this setting, 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. Whereas previously known constructions were either inefficient (required ⊖(K 2) memory), randomized, or employed cryptographic techniques which are unlikely to be available in hostile environments, we eliminate each of these undesirable properties. The total amount of memory used by the mechanism is linear in the number of stored elements and poly-logarithmic in the size of the universe of elements. In addition, we consider one of the classical distributed computing problems: Conflict resolution in multiple-access channels. By establishing a tight connection with the basic building block of our mechanism, we construct the first deterministic and non-adaptive conflict resolution algorithm whose running time is optimal up to poly-logarithmic factors.

Original languageAmerican English
Title of host publicationAutomata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
PublisherSpringer Verlag
Pages303-315
Number of pages13
ISBN (Print)3540734198, 9783540734192
DOIs
StatePublished - 2007
Externally publishedYes
Event34th International Colloquium on Automata, Languages and Programming, ICALP 2007 - Wroclaw, Poland
Duration: 9 Jul 200713 Jul 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4596 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference34th International Colloquium on Automata, Languages and Programming, ICALP 2007
Country/TerritoryPoland
CityWroclaw
Period9/07/0713/07/07

Fingerprint

Dive into the research topics of 'Deterministic history-independent strategies for storing information on write-once memories'. Together they form a unique fingerprint.

Cite this