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

  • Tal Moran
  • Moni Naor
  • Gil Segev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4596)


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.


Bipartite Graph Hash Function Hostile Environment Storage Mechanism Threat Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N., Capalbo, M.R.: Explicit unique-neighbor expanders. In: 43rd FOCS, pp. 73–79 (2002)Google Scholar
  2. 2.
    Bethencourt, J., Boneh, D., Waters, B.: Cryptographic methods for storing ballots on a voting machine. In: 14th NDSS, pp. 209–222 (2007)Google Scholar
  3. 3.
    Buchbinder, N., Petrank, E.: Lower and upper bounds on obtaining history-independence. Information and Computation 204(2), 291–337 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Hartline, J.D., Hong, E.S., Mohr, A.E., Pentney, W.R., Rocke, E.: Characterizing history independent data structures. Algorithmica 42(1), 57–74 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Irani, S., Naor, M., Rubinfeld, R.: On the time and space complexity of computation using write-once memory -or- Is pen really much worse than pencil? Mathematical Systems Theory 25(2), 141–159 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Komlós, J., Greenberg, A.G.: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Transactions on Information Theory 31(2), 302–306 (1985)zbMATHCrossRefGoogle Scholar
  7. 7.
    Micciancio, D.: Oblivious data structures: Applications to cryptography. In: 29th STOC, pp. 456–464 (1997)Google Scholar
  8. 8.
    Molnar, D., Kohno, T., Sastry, N., Wagner, D.: Tamper-evident, history-independent, subliminal-free data structures on PROM storage -or- How to store ballots on a voting machine. In: IEEE S&P, pp. 365–370. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  9. 9.
    Naor, M., Teague, V.: Anti-persistence: History independent data structures. In: 33rd STOC, pp. 492–501 (2001)Google Scholar
  10. 10.
    Rivest, R.L., Shamir, A.: How to reuse a write-once memory. Information and Control 55(1-3), 1–19 (1982)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Tal Moran
    • 1
  • Moni Naor
    • 1
  • Gil Segev
    • 1
  1. 1.Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100Israel

Personalised recommendations