.png){kind=icon}
.png){kind=icon}
Return
ID-based threshold decryption secure against adaptive chosen-ciphertext attack
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2006.11.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an identity-based threshold decryption scheme IB-ThDec and reduces its security to the Bilinear Diffie-Hellman problem. Compared with previous work, this conceals two pairing computations in the ciphertext validity verification procedure. The formal proof of security of this scheme is provided in the random oracle model. Additionally, we show that IB-ThDec can be applied to the threshold key escrow and the mediated cryptosystems. (C) 2007 Elsevier Ltd. All rights reserved.
Keywords:
identity-based cryptography
bilinear maps
threshold decryption
chosen-ciphertext attack
pairing-based cryptosystem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
No organization information available