Publications

Anonymous authentication with subset queries

Authors: D. Boneh and M. Franklin

Abstract:
We develop new schemes for anonymous authentication that support identity escrow. Our protocols also allow a prover to demonstrate membership in an arbitrary subset of users; key revocation is an important special case of this feature. Using the Fiat-Shamir heuristic, our interactive authentication protocols yield new constructions for non-interactive group signature schemes. We use the higher-residuosity assumption, which leads to greater efficiency and more natural security proofs than previous constructions. It also leads to an increased vulnerability to collusion attacks, although countermeasures are available.

Reference:
In proceedings of the 6th ACM conference on Computer and Communications Security, pp. 113--119, 1999