CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Secret Handshakes from Pairing-Based Key Agreements
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
k-anonymous secret handshakes with reusable credentials
Proceedings of the 11th ACM conference on Computer and communications security
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
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
On the security of a novel and efficient unlinkable secret handshakes scheme
IEEE Communications Letters
Security analysis of an unlinkable secret handshakes scheme
IEEE Communications Letters
Secret handshakes from ID-based message recovery signatures: A new generic approach
Computers and Electrical Engineering
Private mutual authentications with fuzzy matching
International Journal of High Performance Systems Architecture
| Hi-index | 0.00 |
An unlinkable secret handshakes is a two-party authentication protocol which protects the privacy of parties' affiliation and identity to everyone except for the intended parties. However, we find that the latest solution proposed by Jarecki et al. is not very efficient. In particular, each party requires O(log n) exponentiations where n is the number of parties affiliated with a single organization. In this paper, we propose a novel unlinkable secret handshakes protocol. Compared with Jarecki et al's scheme, our proposal is simple intuitionally and requires only constant exponentiations.