Title: Efficient Construction of CCA-Secure Threshold PKE Based on Hashed Diffie-Hellman Assumption
Abstract: Journal Article Efficient Construction of CCA-Secure Threshold PKE Based on Hashed Diffie–Hellman Assumption Get access Yuanju Gan, Yuanju Gan * 1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China *Corresponding author: [email protected] Search for other works by this author on: Oxford Academic Google Scholar Lihua Wang, Lihua Wang 2Network Security Research Institute, National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-Kitamachi, Koganei, Tokyo 184-8795, Japan Search for other works by this author on: Oxford Academic Google Scholar Licheng Wang, Licheng Wang 1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China Search for other works by this author on: Oxford Academic Google Scholar Ping Pan, Ping Pan 1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China Search for other works by this author on: Oxford Academic Google Scholar Yixian Yang Yixian Yang 1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China Search for other works by this author on: Oxford Academic Google Scholar The Computer Journal, Volume 56, Issue 10, October 2013, Pages 1249–1257, https://doi.org/10.1093/comjnl/bxs167 Published: 04 January 2013 Article history Received: 16 August 2012 Revision received: 13 November 2012 Published: 04 January 2013
Publication Year: 2013
Publication Date: 2013-01-04
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot