Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness