Efficient Generic Constructions of Signcryption with Insider Security in the Multi-user Setting
Efficient Generic Constructions of Signcryption with Insider Security in the Multi-user Setting
复制标题
DOI：
10.1007/978-3-642-21554-4_13
复制
发表时间：
2011-06
期刊：
影响因子：
--
通讯作者：
Daiki Chiba;Takahiro Matsuda;Jacob C. N. Schuldt;Kanta Matsuura
中科院分区：
文献类型：
--
作者：
Daiki Chiba;Takahiro Matsuda;Jacob C. N. Schuldt;Kanta Matsuura
签密是一种原语，它提供加密和数字签名的组合安全特性，即机密性和不可伪造性。许多签密方案已经在文献中提出，但到目前为止，没有方案，同时实现了目前最强的内部机密性和强内部不可伪造性的多用户设置的概念，已经提出，而不依赖于随机预言机或密钥注册。在本文中，我们提出了两个新的通用结构的签密方案的标准原语和简单的扩展。从我们的建设，我们举例说明了一些具体的和有效的签密方案，满足最强的内部安全的概念，在多用户设置，同时仍然是可证明安全的标准模型。
Signcryption is a primitive which provides the combined security properties of encryption and digital signatures i.e. confidentiality and unforgeability. A number of signcryption schemes have been presented in the literature, but up until now, no scheme which simultaneously achieves the currently strongest notions of insider confidentiality and strong insider unforgeability in the multi-user setting, has been proposed, without relying on random oracles or key registration. In this paper, we propose two new generic constructions of signcryption schemes from the combination of standard primitives and simple extensions of these. From our constructions, we instantiate a number of concrete and efficient signcryption schemes which satisfy the strongest notions of insider security in the multi-user setting while still being provably secure in the standard model.