Improving Anonymity in Shared Key Primitives Based on Perfect Hash Families

TL;DR

This paper introduces a scheme for shared symmetric key operations that enhances participant anonymity using balanced perfect hash families, achieving optimal and equitable anonymity in threshold access structures.

Contribution

It presents a novel scheme leveraging balanced perfect hash families to improve anonymity in shared key primitives, surpassing existing methods.

Findings

Scheme provides improved anonymity measures.

Achieves optimal participant anonymity.

Based on balanced perfect hash families.

Abstract

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.