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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 303-315

  Moran, Tal ^a   Naor, Moni ^a   Segev, Gil ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SYSTEMS; NUMBER THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

DISTRIBUTED COMPUTING PROBLEMS; INFORMATION STORAGE MECHANISMS;

DATA STORAGE EQUIPMENT;

EID: 38149114029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_28     Document Type: Conference Paper

References (10)

1. Alon, N., Capalbo, M.R.: Explicit unique-neighbor expanders. In: 43rd FOCS, pp. 73-79 (2002)
2. Bethencourt, J., Boneh, D., Waters, B.: Cryptographic methods for storing ballots on a voting machine. In: 14th NDSS, pp. 209-222 (2007)
3. Buchbinder, N., Petrank, E.: Lower and upper bounds on obtaining history-independence. Information and Computation 204(2), 291-337 (2006)
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)
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)
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)
7. Micciancio, D.: Oblivious data structures: Applications to cryptography. In: 29th STOC, pp. 456-464 (1997)
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)
9. Naor, M., Teague, V.: Anti-persistence: History independent data structures. In: 33rd STOC, pp. 492-501 (2001)
10. Rivest, R.L., Shamir, A.: How to reuse a write-once memory. Information and Control 55(1-3), 1-19 (1982)