A Provable Security Scheme of ID-Based Threshold Decryption

Wang Xue-Guang; Chai Zhen-Chuan

Forensics in Telecommunications, Information and Multimedia. Second International Conference, e-Forensics 2009, Adelaide, Australia, January 19-21, 2009, Revised Selected Papers

Research Article

A Provable Security Scheme of ID-Based Threshold Decryption

Download

567 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-02312-5_14,
    author={Wang Xue-Guang and Chai Zhen-Chuan},
    title={A Provable Security Scheme of ID-Based Threshold Decryption},
    proceedings={Forensics in Telecommunications, Information and Multimedia. Second International Conference, e-Forensics 2009, Adelaide, Australia, January 19-21, 2009, Revised Selected Papers},
    proceedings_a={E-FORENSICS},
    year={2012},
    month={5},
    keywords={provable security ID based cryptography Threshold decryption},
    doi={10.1007/978-3-642-02312-5_14}
}

Wang Xue-Guang
Chai Zhen-Chuan
Year: 2012
A Provable Security Scheme of ID-Based Threshold Decryption
E-FORENSICS
Springer
DOI: 10.1007/978-3-642-02312-5_14

Wang Xue-Guang¹^,*, Chai Zhen-Chuan¹

1: East China University of, Political Science and Law, Samsung electronics R&D center

*Contact email: wangxueguang@ecupl.edu.cn

Abstract

This paper presents an ID-based threshold decryption scheme and proves that it is selective chosen ciphertext secure without random oracles based on solving decisional (,,) − − problem assumption.

Keywords: provable security ID based cryptography Threshold decryption

Published: 2012-05-11

: http://dx.doi.org/10.1007/978-3-642-02312-5_14