Efficient signcryption without random oracles

Authors

Qianhong Wu, University of WollongongFollow
Yi Mu, University of WollongongFollow
Willy Susilo, University of WollongongFollow
Fangguo Zhang, Sun Yat-sen University

RIS ID

15722

Publication Details

Wu, Q., Susilo, W., Mu, Y. & Zhang, F. (2006). Efficient signcryption without random oracles. In L. Yang, H. Jin, J. Ma & T. Ungerer (Eds.), International Conference on Autonomic and Trusted Computing (pp. 449-458). Germany: Springer-Verlag.

Abstract

Signcryption is an asymmetric cryptographic method that simultaneously provides confidentiality and authenticity at a lower computational and communication overhead. A number of signcryption schemes have been proposed in the literature, but they are only proven to be secure in the random oracle model. In this paper, under rational computational assumptions, we propose a signcryption scheme from pairings that is proven secure without random oracles. The scheme is also efficient and comparable to the state-of-the-art signcryption schemes from pairings that is secure in the random oracle model.