Signcryption with Non-interactive Non- repudiation without Random Oracles

• Published in: Transactions on Computational Science X Vol. 6340; pp. 202 - 230
• Main Authors: Fan, Jia, Zheng, Yuliang, Tang, Xiaohu
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 01.01.2010; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: bilinear map; non-interaction; non-repudiation; public key cryptography; random oracle; signcryption
• ISBN: 9783642174988; 3642174981
• ISSN: 0302-9743; 1866-4741
• DOI: 10.1007/978-3-642-17499-5_9

Non-repudiation is a very important requirement of signcryption. It ensures that a sender cannot deny the fact that he has signcrypted a message. Non-interactive non-repudiation enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we strengthen Malone-Lee’s security model for signcryption with non-interactive non-repudiation by introducing two additional, more subtle and useful security requirements, one about the unforgeability and the other about the confidentiality of non-repudiation evidence. A further contribution of this paper is to design a concrete signcryption scheme that admits provable security without random oracles in our strengthened security model for signcryption.