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
Group signatures with verifier-local revocation
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
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
Randomizable Proofs and Delegatable Anonymous Credentials
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A new signature scheme without random oracles from bilinear pairings
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Verifier-Local revocation group signature schemes with backward unlinkability from bilinear maps
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
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
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Secret handshakes from ID-based message recovery signatures: A new generic approach
Computers and Electrical Engineering
Secret handshake scheme with request-based-revealing
EuroPKI'11 Proceedings of the 8th European conference on Public Key Infrastructures, Services, and Applications
Secret handshake scheme with request-based-revealing
Computers & Mathematics with Applications
Private mutual authentications with fuzzy matching
International Journal of High Performance Systems Architecture
| Hi-index | 0.00 |
Secret handshake schemes allow the members of a certain organization can anonymously authenticate each other. In this paper, a new revocable secret handshake scheme with backward unlinkability is presented. Our new scheme achieves the impersonator resistance against Group Authority (GA), such that group members are protected from being impersonated and framed by a malicious GA. Also the revocation is obtained in the new scheme, as well as the unlinkability and the traceability. Moreover, the anonymity of revoked members is improved so that the past transcripts of revoked members remain private, i.e., backward unlinkability. Our new scheme is provably secure in the random oracle model by assuming the intractability of q+1 Square Roots Problem and Decisional Bilinear Diffie-Hellman Problem. We stress that the improved anonymity of revoked members answers the open problem of the backward unlinkability on secret handshakes, which is left by Jarecki and Liu at CRYPTO 2009.