Conference Paper

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

Conference: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings
Source: DBLP

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. 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 is ∞ipping bits from 0 to 1. Whereas previously known constructions were either ine-cient (required £(K2) 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: con∞ict reso- lution in multiple-access channels. By establishing a tight connection with the basic building block of our mechanism, we construct the flrst deterministic and non-adaptive con∞ict resolution algorithm whose running time is optimal up to poly-logarithmic factors.

0 Bookmarks
 · 
57 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Moran, Naor and Segev have asked what is the minimal r = r(n, k) for which there exists an (n,k)-monotone encoding of length r, i.e., a monotone injective function from subsets of size up to k of {1, 2, ..., n} to r bits. Monotone encodings are relevant to the study of tamper-proof data structures and arise also in the design of broadcast schemes in certain communication networks. To answer this question, we develop a relaxation of k-superimposed families, which we call α-fraction k-multi-user tracing ((k, α)-FUT families). We show that r(n, k) = Θ(k log(n/k)) by proving tight asymptotic lower and upper bounds on the size of (k, α)-FUT families and by constructing an (n,k)-monotone encoding of length O(k log(n/k)). We also present an explicit construction of an (n, 2)-monotone encoding of length 2logn + O(1), which is optimal up to an additive constant.
    06/2008: pages 258-270;
  • [Show abstract] [Hide abstract]
    ABSTRACT: A (d,ℓ)-list disjunct matrix is a non-adaptive group testing primitive which, given a set of items with at most d “defectives,” outputs a superset of the defectives containing less than ℓ non-defective items. The primitive has found many applications as stand alone objects and as building blocks in the construction of other combinatorial objects. This paper studies error-tolerant list disjunct matrices which can correct up to e 0 false positive and e 1 false negative tests in sub-linear time. We then use list-disjunct matrices to prove new results in three different applications. Our major contributions are as follows. (1) We prove several (almost)-matching lower and upper bounds for the optimal number of tests, including the fact that Θ(dlog(n/d) + e 0 + de 1) tests is necessary and sufficient when ℓ = Θ(d). Similar results are also derived for the disjunct matrix case (i.e. ℓ = 1). (2) We present two methods that convert error-tolerant list disjunct matrices in a black-box manner into error-tolerant list disjunct matrices that are also efficiently decodable. The methods help us derive a family of (strongly) explicit constructions of list-disjunct matrices which are either optimal or near optimal, and which are also efficiently decodable. (3) We show how to use error-correcting efficiently decodable list-disjunct matrices in three different applications: (i) explicit constructions of d-disjunct matrices with t = O(d 2logn + rd) tests which are decodable in poly(t) time, where r is the maximum number of test errors. This result is optimal for r = Ω(dlogn), and even for r = 0 this result improves upon known results; (ii) (explicit) constructions of (near)-optimal, error-correcting, and efficiently decodable monotone encodings; and (iii) (explicit) constructions of (near)-optimal, error-correcting, and efficiently decodable multiple user tracing families.
    01/2011;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a tamper-evident storage system based on probe storage with a patterned magnetic medium. This medium supports normal read/write operations by out-of-plane magnetisation of individual magnetic dots. We report on measurements showing that in principle the medium also supports a separate class of write-once operation that destroys the out-of-plane magnetisation property of the dots irreversibly by precise local heating. We discuss the main issues of designing a tamper-evident storage device and file system using the properties of the medium.
    6th USENIX Conference on File and Storage Technologies, FAST 2008, February 26-29, 2008, San Jose, CA, USA; 01/2008

Full-text

Download
0 Downloads
Available from