Oblivious data structures: applications to cryptography
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Explicit Unique-Neighbor Expanders
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Lower and upper bounds on obtaining history independence
Information and Computation
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
IEEE Transactions on Information Theory
Towards tamper-evident storage on patterned media
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
IEEE Transactions on Information Theory
Superselectors: efficient constructions and applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
HIFS: history independence for file systems
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.06 |
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 Θ(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: 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.