A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the ciphertext of a message. It is constructed using bi-linear pairings. Its security is based on the intractability of the computational bilinear Diffie-Hellman problem. The scheme possesses chosen-plaintext security in the random oracle model.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。