Secret shares of a standard basis vector are extremely useful in cryptography, with applications like Private Information Retrieval, Private Writing, and Distributed Oblivious Random Access Memory. While such secret shares are beneficial, naively secret sharing a standard basis vector incurs O(n) communication. Distributed Point Functions (DPFs) are cryptographic primitives that enable us to succinctly secret-share a standard-basis vector among two or more parties. In this talk, we will first describe the construction of DPFs and discuss their applications to anonymous communication systems. We will discuss several models of anonymous communication systems and the role DPFs play in enhancing their efficiency.