Improving Anonymity in Shared Key Primitives Based on Perfect Hash Families

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We propose a new scheme for sharing symmetric key operations among a set of participants according to a (t,n) threshold access structure. We focus on anonymity properties of this scheme and show that this scheme provides improved values of anonymity measures than the existing ones. In particular, the scheme can provide optimal and equitable participant anonymity when it is based on balanced perfect hash families.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Improving Anonymity in Shared Key Primitives Based on Perfect Hash Families does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving Anonymity in Shared Key Primitives Based on Perfect Hash Families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving Anonymity in Shared Key Primitives Based on Perfect Hash Families will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-49589

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.