Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Scheme (3)
- Secure (3)
- Digital signature (2)
- Key (2)
- Networks (2)
-
- Provably (2)
- Signatures (2)
- Wireless (2)
- Announcement (1)
- Anonymous (1)
- Authenticated (1)
- Certificateless (1)
- Certified (1)
- Chains (1)
- Confirmer (1)
- Data security (1)
- Designated (1)
- Digital signature (1)
- Distributed (1)
- Distribution (1)
- E (1)
- E-commerce (1)
- Efficient (1)
- Enabled (1)
- Encryption (1)
- Environments (1)
- Establishment (1)
- Exchange (1)
- Fair (1)
- Free (1)
Articles 1 - 11 of 11
Full-Text Articles in Physical Sciences and Mathematics
Threshold Anonymous Announcement In Vanets, Guilin Wang, L Chen, S. L. Ng
Threshold Anonymous Announcement In Vanets, Guilin Wang, L Chen, S. L. Ng
Dr Guilin Wang
Vehicular ad hoc networks (VANETs) allow wireless communications between vehicles without the aid of a central server. Reliable exchanges of information about road and traffic conditions allow a safer and more comfortable travelling environment. However, such profusion of information may allow unscrupulous parties to violate user privacy. On the other hand, a degree of auditability is desired for law enforcement and maintenance purposes. In this paper we propose a Threshold Anonymous Announcement service using direct anonymous attestation and one-time anonymous authentication to simultaneously achieve the seemingly contradictory goals of reliability, privacy and auditability.
An Efficient Certified E-Mail Scheme Suitable For Wireless Mobile Environments, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
An Efficient Certified E-Mail Scheme Suitable For Wireless Mobile Environments, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Dr Guilin Wang
As security enhanced systems for standard e-mail, certified e-mail schemes guarantee the fair exchange of a digital message with the corresponding receipt between two mistrusted parties. That is, the intended receiver gets the e-mail content if and only if the e-mail sender obtains an irrefutable receipt issued by the receiver, which could be used to prove that the message has been delivered to the receiver. A number of such protocols have been proposed in recent years. However, most of them are not suitable for mobile networks, since many intricate cryptographic primitives are involved so that considerable overheads are introduced. In …
Security Analysis Of Two Signcryption Schemes, Guilin Wang, Robert H. Deng, Dongjin Kwak, Sangjae Moon
Security Analysis Of Two Signcryption Schemes, Guilin Wang, Robert H. Deng, Dongjin Kwak, Sangjae Moon
Dr Guilin Wang
Signcryption is a new cryptographic primitive that performs signing and encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In this paper, we present a security analysis of two such schemes: the Huang-Chang convertible signcryption scheme, and the Kwak-Moon group signcryption scheme. Our results show that both schemes are insecure. Specifically, the Huang-Chang scheme fails to provide confidentiality, while the Kwak-Moon scheme does not satisfy the properties of unforgeability, coalition-resistance, and traceability.
Comments On "A Practical (T, N) Threshold Proxy Signature Scheme Based On The Rsa Cryptosystem", Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Comments On "A Practical (T, N) Threshold Proxy Signature Scheme Based On The Rsa Cryptosystem", Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Dr Guilin Wang
In a (t, n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t-1 or fewer of them can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers. In this article, we discuss the implementation and comparison of some threshold proxy signature schemes that are based on the RSA cryptosystem. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al., Wen et …
Proxy Signature Scheme With Multiple Original Signers For Wireless E-Commerce Applications, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Proxy Signature Scheme With Multiple Original Signers For Wireless E-Commerce Applications, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Dr Guilin Wang
In a proxy signature scheme, a user delegates his/her signing capability to another user in such a way that the latter can sign messages on behalf of the former. We propose an efficient and secure proxy signature scheme with multiple original signers. Our scheme is suitable for wireless electronic commerce applications, since the overheads of computation and communication are low. As an example, we present an electronic air ticket booking scheme for wireless customers.
Improved Certificateless Signature Scheme Provably Secure In The Standard Model, Yong Yu, Yi Mu, Guilin Wang, Q Xia, B Yang
Improved Certificateless Signature Scheme Provably Secure In The Standard Model, Yong Yu, Yi Mu, Guilin Wang, Q Xia, B Yang
Dr Guilin Wang
Certificateless cryptography shares many features of identity-based cryptography and partially solves the problem of key escrow. Three certificateless signature schemes without random oracles were found in the literature. However, all the schemes suffer from some common drawbacks. First, by obtaining a signature on a message and replacing the public key of a signer, an adversary can forge valid signatures on the same message under the replaced public key. Secondly, all the schemes require a relatively large size of public parameters. The authors propose a new certificateless signature scheme, which exhibits an improvement on the existing schemes. Compared with the previous …
Provably Secure Single Sign-On Scheme In Distributed Systems And Networks, Jiangshan Yu, Guilin Wang, Yi Mu
Provably Secure Single Sign-On Scheme In Distributed Systems And Networks, Jiangshan Yu, Guilin Wang, Yi Mu
Dr Guilin Wang
Distributed systems and networks have been adopted by telecommunications, remote educations, businesses, armies and governments. A widely applied technique for distributed systems and networks is the single sign-on (SSO) which enables a user to use a unitary secure credential (or token) to access multiple computers and systems where he/she has access permissions. However, most existing SSO schemes have not been formally proved to satisfy credential privacy and soundness of credential based authentication. To overcome this drawback, we formalise the security model of single sign-on scheme with authenticated key exchange. Specially, we point out the difference between soundness and credential privacy, …
Optimistic Fair Exchange Of Ring Signatures, Lie Qu, Guilin Wang, Yi Mu
Optimistic Fair Exchange Of Ring Signatures, Lie Qu, Guilin Wang, Yi Mu
Dr Guilin Wang
An optimistic fair exchange (OFE) protocol is an effective tool helping two parties exchange their digital items in an equitable way with assistance of a trusted third party, called arbitrator, who is only required if needed. In previous studies, fair exchange is usually carried out between individual parties. When fair exchange is carried our between two members from distinct groups, anonymity of the signer in a group could be necessary for achieving better privacy. In this paper, we consider optimistic fair exchange of ring signatures (OFERS), i.e. two members from two different groups can exchange their ring signatures in a …
On The Invisibility Of Designated Confirmer Signatures, Fubiao Xia, Guilin Wang, Rui Xue
On The Invisibility Of Designated Confirmer Signatures, Fubiao Xia, Guilin Wang, Rui Xue
Dr Guilin Wang
As an important cryptographic primitive, designated con- rmer signatures are introduced to control the public veria- bility of signatures. That is, only the signer or a semi-trusted party, called designated conrmer, can interactively assist a verier to check the validity of a designated conrmer sig- nature. The central security property of a designated con- rmer signature scheme is called invisibility, which requires that even an adaptive adversary cannot determine the valid- ity of an alleged signature without direct cooperation from either the signer or the designated conrmer. However, in the literature researchers have proposed two other related properties, called impersonation …
Secure And Practical Key Distribution For Rfid-Enabled Supply Chains, Tieyan Li, Yingjiu Li, Guilin Wang
Secure And Practical Key Distribution For Rfid-Enabled Supply Chains, Tieyan Li, Yingjiu Li, Guilin Wang
Dr Guilin Wang
In this paper, we present a fine-grained view of an RFIDenabled supply chain and tackle the secure key distribution problem on a peer-to-peer base, In our model, we focus on any pair of consecutive parties along a supply chain, who agreed on a transaction and based on which, certain RFID-tagged goods are to be transferred by a third party from one party to the other as in common supply chain practice. Under a strong adversary model, we identify and define the security requirements with those parties during the delivery process. To meet the security goal, we first propose a resilient …
A Pairing-Free Id-Based One-Pass Authenticated Key Establishment Protocol For Wireless Sensor Networks, Rehana Yasmin, Eike Ritter, Guilin Wang
A Pairing-Free Id-Based One-Pass Authenticated Key Establishment Protocol For Wireless Sensor Networks, Rehana Yasmin, Eike Ritter, Guilin Wang
Dr Guilin Wang
Due to resource constraints and unique features of wireless sensor networks (WSNs), designing a key establishment protocol is much harder for WSNs than for traditional wired and wireless counterparts. In this paper, we propose a new efficient and secure ID-based one-pass authenticated key establishment protocol between an outside user and a sensor node. The proposed protocol does not require sensor nodes to compute any expensive pairing function. Moreover, it imposes very light computational and communication overheads and also provides scalability. We analyze security and efficiency of the proposed protocol by comparing firstly the session key establishment protocols for WSNs and …