Guohua Cui

dblp:13/4750 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4Databases, data management, data science and information retrieval · 3Computer networks · 2Security and privacy · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
identity-based encryption
0.112010
A more efficient accountable authority IBE scheme under the DL assumption · Sci. China Inf. Sci. 2010
Cryptographic primitives and cryptanalysis › cryptographic assumptions
discrete logarithm assumption
0.012010
A more efficient accountable authority IBE scheme under the DL assumption · Sci. China Inf. Sci. 2010
YearPublicationVenuePosition
2014 On mitigating hotspots to maximize network lifetime in multi-hop wireless sensor network with guaranteed transport delay and reliability
Anfeng Liu, Guohua Cui, Zhigang Chen 0001
Peer-to-Peer Netw. Appl.4
2013 Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network
Anfeng Liu, Guohua Cui, Zhigang Chen 0001
Inf. Sci.3
2012 Efficient Fair Secure Two-Party Computation
abstract
Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called "garbled circuit". Later, many protocols based on garbled circuit approach have been presented, most of which discussed malicious adversaries and efficiency about 2PC. However, there only have a few protocols dealing with the fundamental property of fairness for Yao's garbled circuit approach, in which one involved a trusted third party and the others are very expensive. In the paper, we propose' an efficient Yao's garbled circuit protocol for fair secure 2PC based on ElGamal encryption, Pedersen commitment, Cachin et al.'s verifiable oblivious transfer and Ou-Ruan et al.'s gradual release homomorphic timed commitment. The protocol achieves two advantages: it doesn't need the third party and it is more efficient than other fair secure Yao's protocols.
Ou Ruan, Minghui Zheng, Guohua Cui
APSCC4
2011 A novel linear multi-secret sharing scheme for group communication in wireless mesh networks
Ching-Fang Hsu 0001, Guohua Cui, Qi Cheng 0008
J. Netw. Comput. Appl.2
2010 A Risk-Aware Resource Service Decision Strategy for Global Computing
Wei Du 0001, Guohua Cui, Wei Liu 0011
ATC2
2010 A more efficient accountable authority IBE scheme under the DL assumption
Peng Xu 0003, Guohua Cui, Cai Fu, Xueming Tang
Sci. China Inf. Sci.2
2010 One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity
Peng Xu 0003, Guohua Cui, Feng-Yu Lei, Jing-Fang Xu
Inf. Sci.2
2010 An Uncertainty Enhanced Trust Evolution Strategy for e-Science
Wei Du 0001, Guohua Cui, Wei Liu 0011
J. Comput. Sci. Technol.2
2007 Scalable Group Key Management Protocol Based on Key Material Transmitting Tree
Minghui Zheng, Guohua Cui, Muxiang Yang
ISPEC2
2005 A proxy blind signature schemes based DLP and applying in e-voting
abstract
In a proxy blind signature scheme, the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting, e-payment and mobile agent environments. This paper analyzed the security shortcoming of a proxy blind signature scheme which is proposed by Tan et al. Comparing with the weakness of the previous schemes, a new proxy blind signature scheme based DLP is presented to overcome the insecurity. It is proved that this scheme is more secure and efficient than the previous schemes. As an instance, the applying of the schemes in electronic voting is describing.
Shaobin Wang, Guohua Cui
ICEC3
2005 A fair e-cash payment scheme based on credit
abstract
A new fair e-cash payment scheme based on credit is present in this paper. In the scheme, an overdraft credit certificate is issued to user by bank. Using the overdraft credit certificate, user can produce e-cash himself to pay in exchanges. Merchant can verify the e-cash received from user. Bank can make a fair dispute resolution when there is a dissension between user and merchant. It can avoid the problem of partition e-cash for changes, prevent from reusing e-cash and faking e-cash. It fits justice, anonymity, non-deny and impartiality.
Shaobin Wang, Fan Hong, Guohua Cui
ICEC3