Secret Handshakes from Pairing-Based Key Agreements
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Concealing complex policies with hidden credentials
Proceedings of the 11th ACM conference on Computer and communications security
k-anonymous secret handshakes with reusable credentials
Proceedings of the 11th ACM conference on Computer and communications security
Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Private Mutual Authentication and Conditional Oblivious Transfer
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Beyond secret handshakes: affiliation-hiding authenticated key exchange
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Taming big brother ambitions: more privacy for secret handshakes
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Okamoto-Tanaka revisited: fully authenticated diffie-hellman with minimal overhead
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Affiliation-hiding key exchange with untrusted group authorities
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Privacy-preserving group discovery with linear complexity
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A flexible framework for secret handshakes
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Group secret handshakes or affiliation-hiding authenticated group key agreement
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Affiliation-hiding authentication with minimal bandwidth consumption
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
| Hi-index | 0.00 |
Among the plethora of privacy-friendly authentication techniques, affiliation-hiding (AH) protocols are valuable for their ability to hide not only identities of communicating users behind their affiliations (memberships to groups), but also these affiliations from non-members. These qualities become increasingly important in our highly computerized user-centric information society, where privacy is an elusive good. Only little work on practical aspects of AH schemes, pursuing optimized implementations and deployment, has been done so far, and the main question a practitioner might ask --- whether affiliation-hiding schemes are truly practical today --- remained widely unanswered. Improving upon recent advances in the area of AH protocols, in particular on pioneering results in the multi-affiliation setting, we can give an affirmative answer to this question. To this end, we propose numerous algorithmic optimizations to a recent AH scheme leading to a remarkable performance gain. Our results are demonstrated not only at theoretical level, but we also offer implementations, performance measurements, and comparisons. At the same time, our improvements advance the area of efficient polynomial interpolation in finite fields, which is one of our building blocks.