Abstract
Signcryption has been a rapidly emerging efficient approach to achieve authenticity and confidentiality within a logic single step. However, it is still a difficult problem to realize public verifiability of signcryption in an efficient and secure way. Here, we present a generic solution to realize public verifiability based on quadratic residue.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Zheng Y. Digital Signcryption or How to Achieve Cost (Signature & Encryption) Cost (Signature) + Cost (Encryption) [C]//Advances in Cryptology—Crypto'97: 17th Annual International Cryptology Conference. Santa Barbara, California: Springer Press, 1997:165–179.
Bao F, Deng R H. A Signcryption Scheme with Signature Directly Verifiable by Public Key [C]//1st International Workshop on Practice and Theory in Public Key Cryptography (PKC1998) Pacifico Yokohama: Springer Press, 1998:55–59.
Malone L J, Mao W. Two Birds one Stone: Signcryption Using RSA [C]//Topics in Cryptology-CT-RSA 2003,The Cryptographers' Track at the RSA Conference 2003. San Francisco, CA: Springer Press, 2003:211–225.
Shin J B, Lee K, Shim K. New DSA-Verifiable Signcryption Schemes [C]//5th International Conference on Information Security and Cryptology (ICISC 2002). Seoul: Springer Press, 2003:35–47.
Steinfeld R, Zheng Y. A Signcryption Scheme Based on Integer Factorization [C]//3rd International Workshop on Information Security (ISW 2000). Wollongong: Springer Press, 2000:308–322.
Libert B, Quisquater J J. Efficient Signcryption with Key Privacy from Gap-Diffie-Hellman Groups [C]//7th International Workshop on Theory and Practice in Public Key Cryptography (PKC 2004). Singapore: Springer Press, 2004:187–200.
Menezes A J, Van Oorschot P, Vanstone S A.Handbook of Applied Cryptography [M]. Boca Raton: CRC Press, 1997.
Ostrovsky R, Yung M. How to Withstand Mobile Virus Attacks [C]//10th Annual ACM Symposium on Princiles of Distributed Computing (PODC1991). Montreal: ACM Press, 1991:51–59.
Bellare M, Rogaway P. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols [C]//Proc of the 1st ACM Conference on Computer and Communications Security. Fairfax, Virginia: ACM Press, 1993:62–73.
Baek J, Ron S, Zheng Y. Formal Proofs for the Security Signcryption [C]//5th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2002). Paris: Springer Press, 2002:80–98.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60273049, 60303026, 90104005)
Biography: LEI felyu (1978-), male, Ph. D. candidate, research direction: network security and cryptography
Rights and permissions
About this article
Cite this article
Feiyu, L., Wen, C. & Kefei, C. A generic solution to realize public verifiability of signcryption. Wuhan Univ. J. Nat. Sci. 11, 1589–1592 (2006). https://doi.org/10.1007/BF02831827
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02831827