Results 1 -
5 of
5
ID-Based Blind Signature and Ring Signature from Pairings
- Proc. of Asiacrpt2002, LNCS 2501
, 2002
"... Recently the bilinear pairing such as Weil pairing or Tate pairing on elliptic curves and hyperelliptic curves have been found various applications in cryptography. Several identity-based (simply ID-based) cryptosystems using bilinear pairings of elliptic curves or hyperelliptic curves were presente ..."
Abstract
-
Cited by 99 (13 self)
- Add to MetaCart
(Show Context)
Recently the bilinear pairing such as Weil pairing or Tate pairing on elliptic curves and hyperelliptic curves have been found various applications in cryptography. Several identity-based (simply ID-based) cryptosystems using bilinear pairings of elliptic curves or hyperelliptic curves were presented. Blind signature and ring signature are very useful to provide the user's anonymity and the signer's privacy. They are playing an important role in building e-commerce. In this paper, we firstly propose an ID-based blind signature scheme and an ID-based ring signature scheme, both of which are based on the bilinear pairings. Also we analyze their security and e#ciency.
Tripartite Authenticated Key Agreement Protocols from Pairings
, 2002
"... Joux's protocol [29] is a one round, tripartite key agreement protocol that is more bandwidth-efficient than any previous three-party key agreement protocol. But it is insecure, suffering from a simple man-in-the-middle attack. This paper shows how to make Joux's protocol secure, presenti ..."
Abstract
-
Cited by 42 (1 self)
- Add to MetaCart
(Show Context)
Joux's protocol [29] is a one round, tripartite key agreement protocol that is more bandwidth-efficient than any previous three-party key agreement protocol. But it is insecure, suffering from a simple man-in-the-middle attack. This paper shows how to make Joux's protocol secure, presenting several tripartite, authenticated key agreement protocols that still require only one round of communication and no signature computations. A pass-optimal authenticated and key confirmed tripartite protocol that generalises the station-to-station protocol is also presented. The security properties of the new protocols are studied using provable security methods and heuristic approaches. Applications for the protocols are also discussed.
A new efficient identification scheme based on the Strong Diffie-Hellman assumption
- in International Symposium on Future Software Technology
, 2004
"... In computer and communication security, identification is al-ways an active research area, and a wide range of literatures can be found nowadays suggesting improvement and gener-alization of existing protocols in various directions. In this paper, based on the Strong Diffie-Hellman assumption, we pr ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
In computer and communication security, identification is al-ways an active research area, and a wide range of literatures can be found nowadays suggesting improvement and gener-alization of existing protocols in various directions. In this paper, based on the Strong Diffie-Hellman assumption, we present a new efficient identification scheme ID-SDH. Due to ID-SDH’s simplicity, low-memory, and security, it is well suitable for using in smart cards.
Cryptography from Pairings: A Snapshot of Current Research
, 2002
"... Abstract Recently there has been an explosion of interest in the use of pairings on elliptic curvesin cryptography. We provide a self-contained snapshot of current research in this area. ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract Recently there has been an explosion of interest in the use of pairings on elliptic curvesin cryptography. We provide a self-contained snapshot of current research in this area.
PAIRING-BASED IDENTIFICATION SCHEMES
"... Abstract. We propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based identification scheme. ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. We propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based identification scheme.
