This protocol demonstrates efficient multiplicative aggregation in the presence of user dropout, suggesting improved secure data sharing methods.
Key Points
To develop a secure multiplicative aggregation protocol that ensures efficiency and resilience against user dropout.
Introduced a protocol for secure multiplicative aggregation utilizing pairwise masks and threshold secret sharing.
Evaluated the protocol's performance by varying user counts from 50 to 300 and input sizes from 10-250 KB.
Examined the implications of reusing private keys in secure aggregation across multiple interactions.
User computation scales monotonically with the number of users and is largely unaffected by dropouts.
Server computation is highly sensitive to user dropouts, exhibiting a steeper growth with user counts.
Key reuse in protocols reduces cumulative user computation time by roughly 2.5 times and server computation by about 1.2 times when repeated over 10 interactions.