PROVABLE SECURE IDENTITY BASED SIGNCRYPTION SCHEMES WITHOUT RANDOM ORACLES
PROVABLE SECURE IDENTITY BASED SIGNCRYPTION SCHEMES WITHOUT RANDOM ORACLES
复制标题
DOI：
10.5121/ijnsa.2012.4306
复制
发表时间：
2012-05
期刊：
影响因子：
--
通讯作者：
P. Kushwah;Sunder Lal
中科院分区：
文献类型：
--
作者：
P. Kushwah;Sunder Lal
签密是一种加密原语，它在一个逻辑步骤中执行加密和签名，成本低于先签名后加密的方法。最近，李等人[35]提出了第一个无需随机预言机的可证明安全的基于身份的签密方案。在他们的方案中，发送者对密文进行签名。然而，在[11]中，博伊恩表明，如果发送者对明文而非密文进行签名，则很容易实现不可否认性。在本文中，我们提出了一种无需随机预言机的基于身份的签密方案，该方案提供了关于明文的不可否认性。我们还在标准模型中提出了一种具有第三方验证的基于身份的公开可验证签密方案。
Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step with the cost lower than signature-then-encryption approach. Recently, Li et al. [35] proposed the first provable secure identity based signcryption without random oracles. In their scheme sender signs the ciphertext. However, in [11] Boyen showed that non-repudiation is easily achieved if the sender sign the plaintext rather than ciphertext. In this paper we proposed an identity based signcryption scheme without random oracles, which provides the non-repudiation with respect to plaintext. We also proposed an identity based public verifiable signcryption scheme with third party verification in the standard model.