Paper 2009/057

Anonymity in Shared Symmetric Key Primitives

Gregory M. Zaverucha and Douglas R. Stinson

Abstract

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.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
threshold cryptography
Contact author(s)
gzaveruc @ cs uwaterloo ca
History
2009-02-06: received
Short URL
https://ia.cr/2009/057
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/057,
      author = {Gregory M.  Zaverucha and Douglas R.  Stinson},
      title = {Anonymity in Shared Symmetric Key Primitives},
      howpublished = {Cryptology ePrint Archive, Paper 2009/057},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/057}},
      url = {https://eprint.iacr.org/2009/057}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.