Communication-efficient anonymous group identification
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Unlinkable Serial Transactions
FC '97 Proceedings of the First International Conference on Financial Cryptography
Anonymous Authentication of Membership in Dynamic Groups
FC '99 Proceedings of the Third International Conference on Financial Cryptography
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
On the Security of Homage Group Authentication Protocol
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Detecting and Preventing Machine-to-Machine Hijacking Attacks in Cellular Networks
Bell Labs Technical Journal
Authorization architectures for privacy-respecting surveillance
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
| Hi-index | 0.00 |
We present a system, named Homage, for verifying that a person is a member of some group without anyone, not even the issuing body, being able to determine their identity. Homage provides strong disincentive to people against their passing on their membership-proving information to others. The computation and data transfer required are unaffected by the number of members, and are low enough to be appropriate for smart card implementations. The anonymity of Homage is based on the assumption that the Diffie-Hellman decision problem is hard. This paper does not prove that forgery is impossible, although it does provide strong evidence that this is the case.