Anonymity in shared symmetric key primitives

We provide a stronger definition of anonymity in the context of shared symmetric key primitives, and show that existing schemes do not provide this level of anonymity. A new scheme is presented to share symmetric key operations amongst a set of participants according to a (t, n)-threshold access structure. We quantify the amount of information the output of the shared operation provides about the group of participants which collaborated to produce it.

• Type: Journal
• Year: 2010
• Where: DCC
• Authors: Gregory M. Zaverucha, Douglas R. Stinson
• Keywords: Computer Graphics, DCC 2010, Symmetric Key, Symmetric Key Operations, Symmetric Key Primitives