We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem with n parties, that provides information theoretic security, when t < n 3 parties are corrupted by an active adversary having unbounded computing power. In [16], the authors claimed that their protocol takes six roun...