An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: 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
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Secret Handshake: Strong Anonymity Definition and Construction
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Private Mutual Authentication and Conditional Oblivious Transfer
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
A novel and efficient unlinkable secret handshakes scheme
IEEE Communications Letters
On the security of a novel and efficient unlinkable secret handshakes scheme
IEEE Communications Letters
Full-domain subgroup hiding and constant-size group signatures
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
New construction of group secret handshakes based on pairings
ICICS'07 Proceedings of the 9th international conference on Information 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
Secret handshakes with revocation support
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Federated secret handshakes with support for revocation
ICICS'10 Proceedings of the 12th international conference on Information and communications security
A new revocable secret handshake scheme with backward unlinkability
EuroPKI'10 Proceedings of the 7th European conference on Public key infrastructures, services and applications
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Three-round secret handshakes based on elgamal and DSA
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Secret handshakes from ID-based message recovery signatures: A new generic approach
Computers and Electrical Engineering
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Fuzzy identity-based encryption
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
A flexible framework for secret handshakes
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Authentication for paranoids: multi-party secret handshakes
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
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
| Hi-index | 0.00 |
A private mutual authentication, or unlinkable secret handshake, originally allows two members from the same organisations to anonymously authenticate each other. In this paper, a new privacy-preserving mutual authentication protocol is constructed to achieve fuzzy private matching. The proposed protocol supports more flexible threshold-based appropriate matching under the multiple-groups environment, which is not limited to authenticate between members from the same groups. Our new protocol is constructed from the fuzzy identity-based encryption scheme and constant-size group signature. Without using the random oracle, the new protocol is proved secure by assuming the intractability of the decisional bilinear Diffie-Hellman problems. Compared with previous works, our proposed protocol can adapt to many different applications.