How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Proxy signatures for delegating signing operation
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st 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
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
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
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
Secret interest groups (SIGs) in social networks with an implementation on Facebook
Proceedings of the 2010 ACM Symposium on Applied Computing
Identity-based broadcast encryption with constant size ciphertexts and private keys
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
A new signature scheme without random oracles from bilinear pairings
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
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
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
Abstract: Secret handshake, which was introduced by Balfanz et al., is proposed for mutually anonymous authentication among untrusted parties. In this paper, a new secret handshake scheme is designed for supporting delegations. The definitions and security requirements are first formalized for delegatable secret handshakes. Based on a variant of message recoverable signature without public verification, a delegatable secret handshake scheme is presented. By assuming the intractability of the Discrete Logarithm Representation Problem and the q-Strong Diffie-Hellman Problem, our new scheme is proven secure under the random oracle model.