Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Signcryption Scheme with Signature Directly Verifiable by Public Key
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Formal Proofs for the Security of Signcryption
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Signcryption with Non-interactive Non-repudiation
Designs, Codes and Cryptography
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Insider-secure Hybrid Signcryption SchemeWithout Random Oracles
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
Insider-secure Signcryption KEM/Tag-KEM Schemes without Random Oracles
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Efficient Signcryption Key Encapsulation without Random Oracles
Information Security and Cryptology
New DSA-verifiable signcryption schemes
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Public-key encryption with non-interactive opening
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Improved signcryption from q-Diffie-Hellman problems
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Public-key encryption with non-interactive opening: new constructions and stronger definitions
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A general construction for simultaneous signing and encrypting
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
| Hi-index | 0.00 |
Non-repudiation is a very important requirement of sign-cryption. It ensures that a sender cannot deny the fact that he has sign-crypted 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.