STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
SKEME: a versatile secure key exchange mechanism for Internet
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
The cramer-shoup encryption scheme is plaintext aware in the standard model
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity
Information Sciences: an International Journal
Timed encryption with application to deniable key exchange
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Deniability and forward secrecy of one-round authenticated key exchange
The Journal of Supercomputing
| Hi-index | 0.00 |
A deniable key exchange allows two parties to jointly share a secret key while neither of two nor an outsider can prove to a third party that the communication between the two happened. This is an important mechanism for realizing a deniably secure channel. In this paper, we propose an efficient key exchange protocol and prove its deniable security. We compare our construction with the best known protocol with the same property and show the advantages of the new construction.