Let's say we have multiple parties $P_1, \dots P_n$ that gather personal data, and a party $C$ that is interested in aggregate statistics on these data, i.e. the average value.
An ideal functionality $\mathcal{F}$ would allow $C$ to register a subset of parties $\mathbf{P}$ linked to some kind of abstract data identifier $id$. $\mathcal{F}$ would collect data from all parties of $\mathbf{P}$ corresponding to $id$, calculate the average and return it to $C$.
I specifically mention the average as the protocol should not necessarily provide the option to do any sophisticated computation on the data. It would completely suffice do "easy math" on the data and maybe therefore having a higher efficiency of the protocol.
Are there any efficient universally composable protocols for aggregate statistics of this kind (ideally in the CRS-model) ?
I somehow fail to find any protocols specific to this obvious scenario. Generally I would assume that a combination of a universal composable secret sharing protocol and a homomorphic encryption scheme could do the job.