Abstract
Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower computational and communication overhead cost than the conventional ‘sign-then-encrypt’ approach. We propose a new signcryption scheme which gives a partial solution to an open problem posed by Zheng, namely to find a signcryption scheme based on the integer factorization problem. In particular, we prove that our scheme is existentially unforgeable, in the random oracle model, subject to the assumption that factoring an RSA modulus N = pq (with p and q prime) is hard even when given the additional pair (g; S), where g ∈ ℤ* N is an asymmetric basis of large order less than a bound S/2 ≪ √N.
Original language | English |
---|---|
Title of host publication | Information Security |
Subtitle of host publication | Third International Workshop, ISW 2000 Wollongong, Australia, December 20-21, 2000 Proceedings |
Editors | Josef Pieprzyk, Eiji Okamoto, Jennifer Seberry |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 308-322 |
Number of pages | 15 |
ISBN (Print) | 3540414169 |
DOIs | |
Publication status | Published - 2000 |
Event | Information Security Workshop 2000 - Wollongong, Australia Duration: 20 Dec 2000 → 21 Dec 2000 Conference number: 3rd https://link.springer.com/book/10.1007%2F3-540-44456-4 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 1975 |
ISSN (Print) | 0302-9743 |
Conference
Conference | Information Security Workshop 2000 |
---|---|
Abbreviated title | ISW 2000 |
Country/Territory | Australia |
City | Wollongong |
Period | 20/12/00 → 21/12/00 |
Internet address |
|