ID-based Threshold Decryption Research Articles

Identity-Based Threshold Decryption Scheme from Lattices under the Standard Model

Identity-Based Threshold Decryption Scheme from Lattices under the Standard Model

Efficient identity-based threshold decryption scheme from bilinear pairings

Using Shamir’s secret sharing scheme to indirectly share the identity-based private key in the form of a pairing group element, we propose an efficient identity-based threshold decryption scheme from pairings and prove its security in the random oracle model. This new paring-based scheme features a few improvements compared with other schemes in the literature. The two most noticeable features are its efficiency, by drastically reducing the number of pairing computations, and the ability it gives the user to share the identity-based private key without requiring any access to a private key generator. With the ability it gives the user to share the identity-based private key, our ID-based threshold decryption (IBTD) scheme, the second of its kind, is significantly more efficient than the first scheme, which was developed by Baek and Zheng, at the expense of a slightly increased ciphertext length. In fact, our IBTD scheme tries to use as few bilinear pairings as possible, especially without depending on the suite of Baek–Zheng secret sharing tools based on pairings.

Comparing General Paradigms on Data Secrecy Protection for Outsourced Files in Mobile Cloud Computing

The data secrecy of outsourced files in cloud server should be protected even though cloud servers are untrustworthy. In this paper, we extensively analyze the techniques on data privacy protection for secure cloud storage. We propose and compare several general paradigms on data secrecy protection including ID-based scheme, CLPKCbased scheme, key-escrow-based scheme, ID-based threshold decryption scheme, and trusted third party based scheme. After the analysis and comparison, ID-based threshold decryption scheme has the most advantages with respect to no constraints such as certificate and key escrow.

User-oriented key management scheme for content protection in OPMD environment

In this paper, we propose a key management scheme for content protection in the OPMD (One Person Multi Device) environment where one user owns multiple devices. IBTD (ID-Based Threshold Decryption) was applied for the proposed scheme, and this uses the user IDs and the device IDs as their public key. It is the key management scheme that can decrypt the encrypted content only when more than t secret sharing values are combined among the n secret sharing values generated by the contents server. Our scheme enables the users to use their own contents anytime and anywhere on any device that they own. For the contents server, it enables an effective key management which is user-oriented, not device-oriented.

Identity-based threshold decryption on access structure

For the applied limitation of the existing threshold decryption schemes based on the (t, n) structure, an identity-based threshold decryption scheme which can be applied on the access structure is proposed through designing a special distribution algorithm of the private key shares. The generation and distribution of private key shares, the encryption, the decryption and the combination are introduced in detail. The validity and security of the scheme are proved and analyzed. Comparisons with the existing schemes show that the proposed scheme is more flexible.

New constructions of identity-based threshold decryption

In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based (ID-based) threshold decryption scheme (IDTDS) is proposed, which is provably secure against adaptive chosen ciphertext attack under the computational bilinear Diffie-Hellman (CBDH) problem assumption in the random oracle. The pubic checkability of ciphertext in the IDTDS is given by simply creating a signed ElGamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously.

ID-based threshold decryption secure against adaptive chosen-ciphertext attack

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.