A new universal designated verifier transitive signature scheme for big graph data

Chao Lin; Wei Wu; Xinyi Huang; Li Xu

doi:10.1016/j.jcss.2016.06.003

A new universal designated verifier transitive signature scheme for big graph data

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2016.06.003 ◽

2017 ◽

Vol 83 (1) ◽

pp. 73-83 ◽

Cited By ~ 5

Author(s):

Chao Lin ◽

Wei Wu ◽

Xinyi Huang ◽

Li Xu

Keyword(s):

Signature Scheme ◽

Graph Data ◽

Big Graph ◽

Designated Verifier

Download Full-text

Multi-Fuzzy-Objective Graph Pattern Matching with Big Graph Data

Journal of Database Management ◽

10.4018/jdm.2019100102 ◽

2019 ◽

Vol 30 (4) ◽

pp. 24-40

Author(s):

Lei Li ◽

Fang Zhang ◽

Guanfeng Liu

Keyword(s):

Pattern Matching ◽

Particle Swarm Optimization Algorithm ◽

Nsga Ii ◽

Specific Domain ◽

Graph Pattern Matching ◽

Graph Data ◽

Graph Pattern ◽

Big Graph ◽

Complex Relationships ◽

Pattern Graph

Big graph data is different from traditional data and they usually contain complex relationships and multiple attributes. With the help of graph pattern matching, a pattern graph can be designed, satisfying special personal requirements and locate the subgraphs which match the required pattern. Then, how to locate a graph pattern with better attribute values in the big graph effectively and efficiently becomes a key problem to analyze and deal with big graph data, especially for a specific domain. This article introduces fuzziness into graph pattern matching. Then, a genetic algorithm, specifically an NSGA-II algorithm, and a particle swarm optimization algorithm are adopted for multi-fuzzy-objective optimization. Experimental results show that the proposed approaches outperform the existing approaches effectively.

Download Full-text

Time-constrained strong multi-designated verifier signature suitable for Internet of things–based collaborative fog computing systems

International Journal of Distributed Sensor Networks ◽

10.1177/15501477211001760 ◽

2021 ◽

Vol 17 (3) ◽

pp. 155014772110017

Author(s):

Han-Yu Lin

Keyword(s):

Internet Of Things ◽

Fog Computing ◽

Discrete Logarithm ◽

Signature Scheme ◽

Computing Systems ◽

Extended Technique ◽

Diffie Hellman ◽

Designated Verifier ◽

Designated Verifier Signature ◽

Cloud Servers

Fog computing is viewed as an extended technique of cloud computing. In Internet of things–based collaborative fog computing systems, a fog node aggregating lots of data from Internet of things devices has to transmit the information to distributed cloud servers that will collaboratively verify it based on some predefined auditing policy. However, compromised fog nodes controlled by an adversary might inject bogus data to cheat or confuse remote servers. It also causes the waste of communication and computation resources. To further control the lifetime of signing capability for fog nodes, an appropriate mechanism is crucial. In this article, the author proposes a time-constrained strong multi-designated verifier signature scheme to meet the above requirement. In particular, a conventional non-delegatable strong multi-designated verifier signature scheme with low computation is first given. Based on its constructions, we show how to transform it into a time-constrained variant. The unforgeability of the proposed schemes is formally proved based on the famous elliptic curve discrete logarithm assumption. The security requirement of strong signer ambiguity for our substantial constructions is also analyzed by utilizing the intractable assumption of decisional Diffie–Hellman. Moreover, some comparisons in terms of the signature size and computational costs for involved entities among related mechanisms are made.

Download Full-text