Abstract:
Abstract. Signcryption is a new paradigm in public key cryptography that simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step, and with a cost significantly lower than that required by the traditional "signature followed by encryption " approach. This paper summarizes currently known construction methods for signcryption, carries out a comprehensive comparison between signcryption and "signature followed by encryption", and suggests a number of applications of signcryption in the search of efficient security solutions based on public key cryptography.
Citations
|
1752
|
New directions in cryptography
– Diffie, Hellman
- 1976
|
|
1496
|
Handbook of Applied Cryptography
– Menezes, Oorschot, et al.
- 1996
|
|
897
|
Random oracles are practical: A paradigm for designing efficient protocols
– Bellare, Rogaway
- 1993
|
|
788
|
A public key cryptosystem and a signature scheme based on discrete logarithms
– Elgamal
- 1985
|
|
386
|
Elliptic curve cryptosystems
– Koblitz
- 1987
|
|
356
|
Undeniable signatures
– Chaum, Antwerpen
|
|
315
|
Keying hash functions for message authentication
– Bellare, Canetti, et al.
- 1996
|
|
210
|
Efficient identification and signatures for smart cards
– Schnorr
|
|
202
|
Authentication and authenticated key exchanges
– Diffie, Oorschot, et al.
- 1992
|
|
150
|
Privacy enhancement for Internet electronic mail: Part I | message encipherment and authentication procedures," Network Working Group Request for Comments RFC 1113
– Linn
- 1989
|
|
76
|
Message recovery for signature schemes based on the discrete logarithm problem
– Nyberg, Rueppel
|
|
72
|
Finding a small root of a univariate modular equation
– Coppersmith
- 1996
|
|
63
|
Low-exponent RSA with related messages
– Coppersmith, Franklin, et al.
- 1996
|
|
34
|
M.: Meta-ElGamal signature schemes
– Horster, Petersen, et al.
- 1994
|
|
32
|
Round-optimal zero-knowledge arguments based on any one-way function
– Bellare, Jakobsson, et al.
- 1997
|
|
31
|
On the Key Predistribution System: A Practical Solution to the Key Distribution
– Matsumoto, Imai
- 1987
|
|
21
|
An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions
– Kilian, Petrank
- 1998
|
|
18
|
Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields, Information Security andPrivacy
– Lenstra
|
|
8
|
Protocol failures related to order of encryption and signature: Computation of discrete logarithms in rsa groups
– Chen, Hughes
- 1997
|
|
7
|
Interactive identification and digital signatures
– Brickell, McCurley
- 1991
|
|
2
|
H.: A proposal for authenticated key recovery system
– Nishioka, Matsuura, et al.
- 1997
|
|
1
|
Y.: Secure high speed networking with ABT and signcryption
– Gamage, Zheng
|
|
1
|
D.: The resolution of ISAKMP with Oakley February
– Harkins, Carrel
- 1997
|
|
1
|
H.: Analysis of and improvements on CBT multicast key-distribution
– Matsuura, Zheng, et al.
- 1997
|
|
