The Computer Journal · 2017 · 26 citations · 15 references
ComputingComputer ScienceCybersecurityAuthenticationCryptographySecurity ProtocolsAuthenticated EncryptionCryptographic AlgorithmsCryptographic ProtocolsMutual AuthenticationPublic-key CryptographyCertificateless CryptographyCertificateless SignaturesChosen-ciphertext AttacksChosen-ciphertext SecurityChosen-message AttacksComputational EfficiencyEncryptionRandom Oracle Model
Certificateless signcryption (CLSC) can simultaneously fulfill certificateless encryption and certificateless signature; however, most CLSC schemes need costly computational overhead due to the usage of pairing operations. How to improve its computational efficiency is a very significant research problem. In this paper, we propose a pairing-free and secure CLSC scheme. In the random oracle model, the proposed scheme is indistinguishability against adaptive chosen-ciphertext attacks secure in confidentiality and unforgeability against adaptive chosen-message attacks secure in unforgeability. In the new scheme, only a designated receiver can recover the message, and a third party can verify the validity of a signcrypted text without knowing the receiver's secret value. In addition, this cryptographic algorithm is very appropriate to applications in online auction, email system and private contractual signature.
15
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval, Jacques Stern · Journal of Cryptology · 2000 · 2.2K citations · Full text
The random oracle methodology, revisited
Ran Canetti, Oded Goldreich, Shai Halevi · Journal of the ACM · 2004 · 978 citations · Full text