Analysis and enhancement of three identity-based inception protocols

Wei Yuan; Liang Hu; Hongtu Li; Jianfeng Chu; Yuyu Sun
April 2012
Journal of Computers;Apr2012, Vol. 7 Issue 4, p1006
Academic Journal
In 2006, Fagen LI et al. proposed an efficient identity-based signcryption scheme and declared that this scheme had the attributes of privacy, unforgeability, public verifiability, and many other important attributes. However, we find that scheme does not meet the attributes which the author's declared. Actually, an active attacker with the capacity of controlling the communication channel can replace the public key of the sender to forge a cipher text which can pass the unsigncrypt phase without need to steal the private key of the sender. Then we analyze the reason lead to the attacks and suggest a possible way to overcome it. In 2009, Xiao LI et al. also found a method to forge a cipher text on the scheme of Fagen LI et al. and proposed an improved scheme. However we find a forged cipher text still can be constructed using the public key replacement attack. Next, we point out the flaws in their scheme which our attack based on and propose the corresponding enhanced schemes. In addition, we show that another identity-based multisigncryption scheme is insecure against the key replacement attack as well. In their scheme, an active attacker can replace the signcrypter's public key and forge a valid cipher text to pass the examination of the receiver without the knowledge of the signcrypter's private key. We discuss the flaws which lead to our attack succeeding to forge the valid cipher text and add the corresponding solution at last.


Related Articles

  • A Computer Proven Application of the Discrete Logarithm Problem. Kusch, Sebastian; Kaiser, Markus // International Journal of Computer Science;2007, Vol. 2 Issue 2, p137 

    In this paper we analyze the application of a formal proof system to the discrete logarithm problem used in public-key cryptography. That means, we explore a computer verification of the ElGamal encryption scheme with the formal proof system Isabelle/HOL. More precisely, the functional...

  • Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. Katz, Jonathan; Sahai, Amit; Waters, Brent // Journal of Cryptology;Spring2013, Vol. 26 Issue 2, p191 

    Predicate encryption is a new paradigm for public-key encryption that generalizes identity-based encryption and more. In predicate encryption, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SK corresponding to a predicate f can be used to...

  • Proxy Re-encryption Scheme based on New Multivariate Quadratic Assumptions. Shuaishuai Zhu; Xiaoyuan Yang // Journal of Computers;Dec2013, Vol. 8 Issue 12, p3238 

    In PKC 2012, a public key encryption based on new multivariate quadratic assumptions is proposed. The compactness and security of the algorithm illumined us in applying it in proxy re-encryption scheme. In this paper, a novel unidirectional PRE scheme (NMQ-PRE) is constructed based on new...

  • E2E KEEP: End to End Key Exchange and Encryption Protocol for Accelerated Satellite Networks. Fereidooni, Hossein; Taheri, Hassan; Mahramian, Mehran // International Journal of Communications, Network & System Scienc;Apr2012, Vol. 5 Issue 4, p228 

    Accelerating methods are used to enhance TCP performance over satellite links by employing Performance Enhancement Proxies (PEPs). However, providing a secure connection through the PEPs seems to be impossible. In this paper an appropriate method is proposed in order to provide an accelerated...

  • DATA ENCRYPTION. Harvey, Fiona // New Media Age;3/24/2005 Supplement, p6 

    This paper discusses the use of encryption technology in transmitting sensitive data over the web. With the rise of commerce, encryption has assumed greater importance than ever. Encryption of data is the only way to ensure that sensitive information, such as credit card details, is secure when...

  • An Efficient Key-Policy Attribute-Based Encryption Scheme with Constant Ciphertext Length. Changji Wang; Jianfa Luo // Mathematical Problems in Engineering;2013, p1 

    There is an acceleration of adoption of cloud computing among enterprises. However, moving the infrastructure and sensitive data fromtrusted domain of the data owner to public cloudwill pose severe security and privacy risks. Attribute-based encryption (ABE) is a newcryptographic primitivewhich...

  • ASC -- A Stream Cipher with Built--In MAC Functionality. Wirt, Kai-Thorstein // Proceedings of World Academy of Science: Engineering & Technolog;2007, Vol. 23, p178 

    In this paper we present the design of a new encryption scheme. The scheme we propose is a very flexible encryption and authentication primitive. We build this scheme on two relatively new design principles: t-functions and fast pseudo hadamard transforms. We recapitulate the theory behind these...

  • An Authenticated Key Agreement Scheme using Vector Decomposition. Praveen, I.; Rajeev, K.; Sethumadhavan, M. // Defence Science Journal;Nov2016, Vol. 66 Issue 6, p594 

    Encryption using vector decomposition problem (VDP) on higher dimensional vector spaces is a novel method in cryptography. Yoshida has shown that the VDP on a two-dimensional vector space is at least as hard as the computational Diffie-Hellman problem on a one-dimensional subspace under certain...

  • Formal Analysis of a Public-Key Algorithm. Kaiser, Markus; Buchmann, Johannes // International Journal of Computer Science;2007, Vol. 2 Issue 2, p93 

    In this article, a formal specification and verification of the Rabin public-key scheme in a formal proof system is presented. The idea is to use the two views of cryptographic verification: the computational approach relying on the vocabulary of probability theory and complexity theory and the...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics