Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

History-Independent Concurrent Objects (2403.14445v1)

Published 21 Mar 2024 in cs.DC

Abstract: A data structure is called history independent if its internal memory representation does not reveal the history of operations applied to it, only its current state. In this paper we study history independence for concurrent data structures, and establish foundational possibility and impossibility results. We show that a large class of concurrent objects cannot be implemented from smaller base objects in a manner that is both wait-free and history independent; but if we settle for either lock-freedom instead of wait-freedom or for a weak notion of history independence, then at least one object in the class, multi-valued single-reader single-writer registers, can be implemented from smaller base objects, binary registers. On the other hand, using large base objects, we give a strong possibility result in the form of a universal construction: an object with $s$ possible states can be implemented in a wait-free, history-independent manner from compare-and-swap base objects that each have $O(s + 2n)$ possible memory states, where $n$ is the number of processes in the system.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. Dynamizing static algorithms, with applications to dynamic trees and history independence. In Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 531–540, 2004.
  2. O. Amble and D. E. Knuth. Ordered hash tables. The Computer Journal, 17(2):135–142, 1974.
  3. A. Andersson and T. Ottmann. Faster uniquely represented dictionaries. In Proc. of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 642–649, 1991.
  4. A. Andersson and T. Ottmann. New tight bounds on uniquely represented dictionaries. SIAM Journal on Computing, 24(5):1091–1103, 1995.
  5. Randomized search trees. In Proc. of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 540–545, 1989.
  6. Max registers, counters, and monotone circuits. In Proceedings of the 28th ACM symposium on Principles of distributed computing, pages 36–45, 2009.
  7. H. Attiya and J. L. Welch. Distributed computing - fundamentals, simulations, and advanced topics (2. ed.). Wiley series on parallel and distributed computing. Wiley, 2004.
  8. The foundations of history independence. arXiv preprint arXiv:1501.06508, 2015.
  9. Practical foundations of history independence. IEEE Trans. Inf. Forensics Secur., 11(2):303–312, 2016.
  10. S. Bajaj and R. Sion. Ficklebase: Looking into the future to erase the past. In Proc. of the 29th IEEE International Conference on Data Engineering (ICDE), pages 86–97, 2013.
  11. S. Bajaj and R. Sion. HIFS: History independence for file systems. In Proc. of the ACM SIGSAC Conference on Computer & Communications Security (CCS), pages 1285–1296, 2013.
  12. Anti-persistence on persistent storage: History-independent sparse tables and dictionaries. In Proc. 35th ACM Symposium on Principles of Database Systems (PODS), pages 289–302, June 2016.
  13. Online list labeling: Breaking the log2⁡nsuperscript2𝑛\log^{2}nroman_log start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT italic_n barrier. In Proc. 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS), November 2022.
  14. Cryptographic methods for storing ballots on a voting machine. In Proc. of the 14th Network and Distributed System Security Symposium (NDSS), 2007.
  15. G. E. Blelloch and D. Golovin. Strongly history-independent hashing with applications. In Proc. of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 272–282, 2007.
  16. N. Buchbinder and E. Petrank. Lower and upper bounds on obtaining history independence. In Advances in Cryptology, pages 445–462, 2003.
  17. Robin Hood hashing (preliminary report). In 26th Annual Symposium on Foundations of Computer Science (FOCS’85), pages 281–288, Portland, Oregon, USA, 21–23 Oct. 1985.
  18. B. Chen and R. Sion. Hiflash: A history independent flash device. CoRR, abs/1511.05180, 2015.
  19. P. Fatourou and N. D. Kallimanis. A highly-efficient wait-free universal construction. In Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’11, page 325–334, New York, NY, USA, 2011. Association for Computing Machinery.
  20. D. Golovin. Uniquely Represented Data Structures with Applications to Privacy. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 2008, 2008.
  21. D. Golovin. B-treaps: A uniquely represented alternative to B-trees. In Proc. of the 36th Annual International Colloquium on Automata, Languages, and Programming (ICALP), pages 487–499. Springer Berlin Heidelberg, 2009.
  22. D. Golovin. The B-skip-list: A simpler uniquely represented alternative to B-trees. arXiv preprint arXiv:1005.0662, 2010.
  23. Auditable data structures. In Proc. IEEE European Symposium on Security and Privacy (EuroS&P), pages 285–300, April 2017.
  24. Characterizing history independent data structures. In Proceedings of the Algorithms and Computation, 13th International Symposium (ISAAC), pages 229–240, November 2002.
  25. Characterizing history independent data structures. Algorithmica, 42(1):57–74, 2005.
  26. M. Herlihy. A methodology for implementing highly concurrent data structures. SIGPLAN Not., 25(3):197–206, feb 1990.
  27. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124–149, jan 1991.
  28. M. Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems, 15(5):745–770, nov 1993.
  29. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463–492, jul 1990.
  30. A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC ’94, page 151–160, New York, NY, USA, 1994. Association for Computing Machinery.
  31. Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. In R. Oshman, editor, 37th International Symposium on Distributed Computing (DISC 2023), volume 281 of Leibniz International Proceedings in Informatics (LIPIcs), pages 25:1–25:20, Dagstuhl, Germany, 2023. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
  32. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
  33. D. Micciancio. Oblivious data structures: applications to cryptography. In Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC), pages 456–464, 1997.
  34. Deterministic history-independent strategies for storing information on write-once memories. In Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP), 2007.
  35. History-independent cuckoo hashing. In Proc. of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pages 631–642. Springer, 2008.
  36. M. Naor and V. Teague. Anti-persistence: history independent data structures. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 492–501, 2001.
  37. Arx: A strongly encrypted database system. IACR Cryptol. ePrint Arch., page 591, 2016.
  38. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668–676, 1990.
  39. W. Pugh and T. Teitelbaum. Incremental computation via function caching. In Proc. of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 315–328, 1989.
  40. Oblivious secure deletion with bounded history independence. arXiv preprint arXiv:1505.07391, 2015.
  41. A practical oblivious map data structure with secure deletion and history independence. In IEEE Symposium on Security and Privacy (SP), pages 178–197. IEEE Computer Society, 2016.
  42. J. Shun and G. E. Blelloch. Phase-concurrent hash tables for determinism. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’14, page 96–107, New York, NY, USA, 2014. Association for Computing Machinery.
  43. L. Snyder. On uniquely represented data structures. In Proc. of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 142–146, 1977.
  44. R. Sundar and R. E. Tarjan. Unique binary search tree representations and equality-testing of sets and sequences. In Proc. of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 18–25, 1990.
  45. T. Tzouramanis. History-independence: a fresh look at the case of R-trees. In Proc. 27th Annual ACM Symposium on Applied Computing (SAC), pages 7–12, 2012.
  46. K. Vidyasankar. Converting Lamport’s regular register to atomic register. Information Processing Letters, 28(6):287–290, 1988.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets