Society-oriented Designated Confirmer Signatures ⋆ (2008)
Baodian Wei, Fangguo Zhang, Xiaofeng Chen
Abstract. The concept of society-oriented designated confirmer signatures (SDCS) is introduced in this paper. SDCS can be used under the circumstance where the capability of the signer and that of...
New Receipt-free Voting Scheme Using Double-trapdoor Commitment (2008)
Xiaofeng Chen, Qianhong Wu, Fangguo Zhang, Baodian Wei, Byoungcheon Lee, Hyunrok Lee, ...
Abstract. It is considered to be the most suitable solution for large scale elections to design an electronic voting scheme using blind signatures and anonymous channels. Based on this framework,...
Aggregate Proxy Signature and Verifiably Encrypted Proxy Signature (2008)
Jin Li, Kwangjo Kim, Fangguo Zhang, Xiaofeng Chen
Abstract. An aggregate signature is a single short string that convinces any verifier that, for all 1 ≤ i ≤ n, signer i signed message mi, where the n signers and n messages are distinct. The...
Fast Scalar Multiplication on the Jacobian of aFamily of Hyperelliptic Curves? (2008)
Fangguo Zhang, Futai Zhang, Yumin Wang
Abstract. Hyperelliptic curve cryptosystems (HCC for short) is a generalization of ECC. It has been drawing the attention of more and more researchers in recent years. The problem of how to decrease...
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Abstract. Chameleon hash function is a trapdoor one-way hash function. The IDbased chameleon hash function was first introduced by Ateniese and Medeiros [1]. As discussed by [1], the general...
Efficient Tate Pairing Computation Using Double-Base Chains (2008)
Abstract. Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In this paper...
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Abstract. Chameleon hash function is a trapdoor one-way hash function. The ID-based chameleon hash function was first introduced by Ateniese and Medeiros [1]. As discussed by [1], the general...
A New Signature Scheme without Random Oracles and Its Applications ⋆ (2008)
Fangguo Zhang, Xiaofeng Chen, Willy Susilo, Yi Mu
Abstract. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new...
ID-based restrictive partially blind signatures and applications (2008)
Xiaofeng Chen, Fangguo Zhang, Shengli Liu
Abstract. Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain rules....
ad-hoc anonymous identification scheme at (2008)
Cryptanalysis and improvement of an ID-based
Cryptanalysis of two new signature schemes. Cryptology ePrint Archive (2008)
Abstract. Group signature and blind signature are very important primitives in cryptography. A group signature scheme allows a group member to sign messages anonymously on behalf of the group and a...
Attack on A New Public Key Cryptosystem from ISC’02 (LNCS 2433) (2008)
Fangguo Zhang, Shengli Liu, Kwangjo Kim
In ISC 2002, J. Zheng [8] proposed a new public key cryptosystem whose security is based upon the algebraic problem of reducing a high degree matrix to its canonical form by similarity...
Cryptanalysis of Lee-Hwang-Li’s Key Authentication Scheme (2008)
Abstract. Key authentication is very important in secret communications and data security. Recently, Lee, Hwang and Li proposed a new public key authentication scheme for cryptosystems with a trusty...
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9 (2008)
Xibin Lin, Chang-an Zhao, Fangguo Zhang, Yanming Wang
Abstract. For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves with k =...
Attack on Okamoto et al.’s New Short Signature Schemes (2008)
Abstract. We present an attack on a new short signature scheme from bilinear pairing proposed by Okamoto et al. at ITCC’05. We show that any one can derive the secret key of the signer from any two...
A New Signature Scheme without Random Oracles and Its Applications? (2008)
Fangguo Zhang, Xiaofeng Chen, Willy Susilo, Yi Mu
Abstract. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new...
ID-based restrictive partially blind signatures and applications (2008)
Xiaofeng Chen, Fangguo Zhang, Shengli Liu
Abstract. Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain rules....
cash. On the Forgeability of Wang-Tang-Li’s ID-Based Restrictive Partially Blind Signature ∗ (2008)
Shengli Liu, Xiaofeng Chen, Fangguo Zhang
Restrictive partially blind signature (RPBS) plays an important role in designing secure electronic cash system. Very recently, Wang, Tang and Li proposed a new ID-based restrictive partially blind...
Speeding up the Bilinear Pairings Computation on Curves with Automorphisms (2008)
Chang-an Zhao, Fangguo Zhang, Jiwu Huang
Abstract. In this paper we present a new algorithm for computing the bilinear pairings on a family of non-supersingular elliptic curves with non-trivial automorphisms. We obtain a short iteration...
Computing the Ate Pairing on Elliptic Curves (2008)
Xibin Lin, Chang-an Zhao, Fangguo Zhang, Yanming Wang
with Embedding Degree k = 9
Cryptanalysis of Chang et al.’s Signature Scheme with Message Recovery (2008)
Abstract. Recently, Chang et al. [1] proposed a new digital signature scheme with message recovery and claimed that neither one-way hash functions nor message redundancy schemes were employed in...
All Pairings Are in a Group (2008)
ZHAO, Chang-An, ZHANG, Fangguo, HUANG, Jiwu
In this paper, we suggest that all pairings are in a group from an abstract angle. Based on the results, some new pairings with the short Miller loop are constructed for great efficiency. It is...
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9 (2008)
LIN, Xibin, ZHAO, Chang-An, ZHANG, Fangguo, WANG, Yanming
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves with k = 12. The...
Cryptanalysis of Lee-Hwang-Li's Key Authentication Scheme (2007)
Abstract. Key authentication is very important in secret communications and data security. Recently, Lee, Hwang and Li proposed a new public key authentication scheme for cryptosystems with a trusty...
Cryptanalysis of two new signature schemes. Cryptology ePrint Archive (2007)
Abstract. Group signature and blind signature are very important primitives in cryptography. A group signature scheme allows a group member to sign messages anonymously on behalf of the group and a...
Information and Communication Engineers A New Threshold Blind Signature Scheme from Pairings (2007)
Duc Liem Vo, Fangguo Zhang, Kwangjo Kim
Abstract — Threshold digital signature and blind signature are playing important roles in cryptography as well as in practical applications such as e-cash and e-voting systems, etc. In this paper,...
Information and Communication Engineers (2007)
Kyusuk Han, Fangguo Zhang, Jongseong Kim, Kwangjo Kim
Abstract — The testament is the message opened to the public after the message writer is gone. In this paper, after modeling the secure testament revealing protocol under three parties, the rich,...
Information and Communication Engineers Exploring Signature Schemes with Subliminal Channel (2007)
Fangguo Zhang, Byoungcheon Lee, Kwangjo Kim
Abstract — The subliminal channel in a cryptographic protocol such as an authentication system or a signature scheme provides an additional channel from the sender to an authorized receiver and...
Fangguo Zhang, Shengli Liu, Kwangjo Kim
Abstract. With various applications of Weil pairing (Tate pairing) to cryptography, ID-based encryption schemes, digital signature schemes, blind signature scheme, two-party authenticated key...
E#cient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings (2007)
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Abstract. Verifiably encrypted signatures are used when Alice wants to sign a message for Bob but does not want Bob to possess her signature on the message until a later date. Such signatures are...
A Note on the Ate Pairing (2007)
Chang-an Zhao, Fangguo Zhang, Jiwu Huang
Abstract. The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendly...
2 Dept.of Electronics and Communication Engineering, (2007)
A new public key cryptosystem, called REESSE1+, was proposed. REESSE1 consists of two primitive algorithms, a public key encryptio/decryption algorithm and a digital signature algorithm. We give some...
A New and Efficient Signature on Commitment Values Abstract (2006)
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo
We present a new short signature scheme based on a variant of the Boneh-Boyen’s short signatures schemes. Our short signature scheme is secure without requiring the random oracle model. We show how...
Efficient Tate Pairing Computation Using Double-Base Chains (2006)
Chang'an Zhao, Fangguo Zhang, Jiwu Huang
Pairing-based cryptosystems have been developing very fast in the last few years. The e#ciencies of the cryptosystems are determined by the computation of the Tate pairing. In this paper a new...
Online/Oine Signatures and Multisignatures for AODV and (2006)
Dsr Routing Security, Shidi Xu, Yi Mu, Willy Susilo, Xiaofeng Chen, Xinyi Huang, ...
E#cient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered as the best candidates...
Online/offline signatures and multisignatures for AODV and DSR routing security (2006)
Shidi Xu, Yi Mu, Willy Susilo, Xiaofeng Chen, Xinyi Huang, Fangguo Zhang
Abstract. Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered as the...
An ad-hoc anonymous identification scheme is a new multiuser cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in...
Yet Another Short Signatures without Random Oracles from Bilinear Pairings (2005)
In recent years, cryptographic protocols based on the bilinear pairings have attracted much attention. One of the most distinguished achievements in this area was the solution to design short...
Group Signature where Group Manager, Members and Open Authority are Identity-Based (2005)
Victor K. Wei, Tsz Hon Yuen, Fangguo Zhang
We present the first group signature scheme with provable security and signature size O(λ) bits where the group manager, the group members, and the Open Authority (OA) are all...
Identity-based Partial Message Recovery Signatures (or How to Shorten ID-based Signatures) (2005)
Fangguo Zhang, Willy Susilo, Yi Mu
We firstly proposed a new notion of short identity-based signature scheme. We argue that the identity-based environment is essential in some scenarios. The notion of short identity-based signature...
Attack on Okamoto et al.'s New Short Signature Schemes (2005)
Fangguo Zhang And, Fangguo Zhang, Xiaofeng Chen
We present an attack on a new short signature scheme from bilinear pairing proposed by Okamoto et al. at ITCC'05. We show that any one can derive the secret key of the signer from any two...
A new short signature scheme without random oracles from bilinear pairings (2005)
Fangguo Zhang, Xiaofeng Chen, Willy Susilo, Yi Mu
To date, there exist three short signature schemes from bilinear pairings. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without...
ID-based Restrictive Partially Blind Signatures (2005)
Xiaofeng Chen Fangguo, Xiaofeng Chen, Fangguo Zhang, Shengli Liu
Restrictive blind signatures allow a recipient to receive a blind signature on a message not know to the signer but the choice of message is restricted and must conform to certain rules. Partially...
Chameleon Hashing without Key Exposure (2004)
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
Chameleon signatures are based on well established hashand -sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon signatures simultaneously...
Chameleon hashing without key exposure (2004)
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon signatures...
An efficient signature scheme from bilinear pairings and its applications (2004)
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
a short signature scheme (BLS scheme) using bilinear pairing on certain elliptic and hyperelliptic curves. Subsequently numerous cryptographic schemes based on BLS signature scheme were proposed. BLS...
Limited verifier signature from bilinear pairings, manuscript (2004)
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
Abstract. Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a limited...
Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings (2003)
Abstract. Blind signature and proxy signature are very important technologies in secure e-commerce. Identity-based (simply ID-based) public key cryptosystem can be a good alternative for...
Xiaofeng Chen, Fangguo Zhang, Yumin Wang
Abstract: Blackmailing may be the most serious drawback of the known electronic cash systems offering unconditional anonymity. Recently, D.Kugler proposed an on-line payment system without trusted...
Chih-yin Lin, Tzong-chen Wu, Fangguo Zhang
In this paper, the authors propose a new structured multisignature scheme that considers the signing order among co-signers. The proposed scheme can resolve signing structures of serial, parallel,...
Fangguo Zhang, Reihaneh Safavi-naini, Chih-yin Lin
Abstract. Proxy signatures are very useful tools when one needs to delegate his/her signing capability to other party. After Mambo et al.'s first scheme was announced, many proxy signature...
A new ID-based group signature scheme from bilinear pairings (2003)
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
Abstract. We argue that traditional ID-based systems from pairings seem unsuitable for designing group signature schemes due to the problem of key escrow. In this paper we propose new ID-based public...
Abstract. Authenticated group key agreement problem is important in many modern collaborative and distributed applications. Recently, there are two ID-based authenticated group key agreement schemes...
ID-Based Chameleon Hashes from Bilinear Pairings (2003)
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Chameleon hash function is a trapdoor one-way hash function. The ID-based chameleon...
Fangguo Zhang, Reihaneh Safavi-naini, Chih-yin Lin
Abstract. Proxy signatures are very useful tools when one needs to delegate his/her signing capability to other party. After Mambo et al.’s first scheme was announced, many proxy signature schemes...
A new ID-based group signature scheme from bilinear pairings (2003)
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
Abstract. We argue that traditional ID-based systems from pairings seem unsuitable for designing group signature schemes due to the problem of key escrow. In this paper we propose new ID-based public...
Efficient verifiably encrypted signature and partially blind signature from bilinear pairings (2003)
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Abstract. Verifiably encrypted signatures are used when Alice wants to sign a message for Bob but does not want Bob to possess her signature on the message until a later date. Such signatures are...
Abstract. Authenticated group key agreement problem is important in many modern collaborative and distributed applications. Recently, there are two ID-based authenticated group key agreement schemes...
Efficient verifiably encrypted signature and partially blind signature from bilinear pairings (2003)
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Abstract. Verifiably encrypted signatures are used when Alice wants to sign a message for Bob but does not want Bob to possess her signature on the message until a later date. Such signatures are...
Efficient ID-Based Blind Signature and Proxy Signature (2003)
Abstract. Blind signature and proxy signature are very important technologies in secure e-commerce. Identity-based (simply ID-based) public key cryptosystem can be a good alternative for...
ID-Based Blind Signature and Ring Signature from Pairings (2002)
Abstract. 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...
ID-Based Blind Signature and Ring Signature from Pairings (2002)
Abstract. Recently the bilinear pairingsuch as Weil pairingor Tate pairingon elliptic curves and hyperelliptic curves have been found various applications in cryptography. Several identity-based...
Compact representation of domain parameters of hyperelliptic curve cryptosystems (2002)
Fangguo Zhang, Shengli Liu, Kwangjo Kim
Abstract. To achieve the same level of security, hyperelliptic curve cryptosystems (HCC) use a smaller field than elliptic curve cryptosystems (ECC). HCC has a more potential application to the...
ID-Based One Round Authenticated Tripartite Key Agreement Protocol with Pairings (2002)
Fangguo Zhang, Shengli Liu, Kwangjo Kim
With various applications of Weil pairing (Tate pairing) to cryptography, ID-based encryption schemes, digital signature schemes, blind signature scheme, two-party authenticated key agreement...
ID-Based Blind Signature and Ring Signature from Pairings (2002)
Abstract. 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...
Ulf M511er and Lance 0ottrell. Mixmaster Protocol -- Version 2. Unfinished draft (2000)
Victor K. Wei, Tsz Hon Yuen, Fangguo Zhang
Abstract. We present the first group signature scheme with provable security and signature size O(λ) bits where the group manager, the group members, and the Open Authority (OA) are all...
Ulf M511er and Lance 0ottrell. Mixmaster Protocol -- Version 2. Unfinished draft (2000)
Victor K. Wei, Tsz Hon Yuen, Fangguo Zhang
Abstract. We present the first group signature scheme with provable security and signature size O(λ) bits where the group manager, the group members, and the Open Authority (OA) are all...
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Abstract. At the fourth ACM conference on electronic commerce (EC'03), S. Han, K.Y. Yeung and J. Wang proposed an ID-based confirmer signature scheme using pairings (actually, this is an...
Fangguo Zhang, Reihaneh Safavi-naini, Willy Susilo
Abstract. At the fourth ACM conference on electronic commerce (EC’03), S. Han, K.Y. Yeung and J. Wang proposed an ID-based confirmer signature scheme using pairings (actually, this is an ID-based...