Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

DCC
2010
IEEE

favoriteEmaildiscussreport

133views Computer Graphics» more DCC 2010»

Anonymity in shared symmetric key primitives

13 years 11 months ago

Anonymity in shared symmetric key primitives

Download www.cacr.math.uwaterloo.ca

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.

Gregory M. Zaverucha, Douglas R. Stinson

Real-time Traffic

Computer Graphics | DCC 2010 | Symmetric Key | Symmetric Key Operations | Symmetric Key Primitives |

claim paper

Related Content

» Nonmalleable extractors and symmetric key cryptography from weak secrets

» Data Aggregation Integrity Based on Homomorphic Primitives in Sensor Networks

» Efficient security primitives derived from a secure aggregation algorithm

» Mixminion Design of a Type III Anonymous Remailer Protocol

» Provably Secure and Practical Onion Routing

» Verifying PrivacyType Properties in a Modular Way

» Toward securing untrusted storage without publickey operations

» Asymmetric Group Key Agreement

» PrivacyAware AttributeBased Encryption with User Accountability

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DCC
Authors	Gregory M. Zaverucha, Douglas R. Stinson

Comments (0)