In this paper, we propose a new type of digital signatures which is specifically designed for graph-based big data system. The properties of the proposed signatures are twofold. On one side it possesses the features of transitive signatures: One can sign a graph in such a way that, given two signatures on adjacent edges ði; jÞ and ðj; kÞ, anyone with public information can compute a signature o...

Mambo et al [6-7] introduced a proxy signature scheme. Neuman [8] extended the scheme for delegation by warrant, which was further extended by Kim et al [4] to partial delegation with a warrant. In this paper we propose a new type of digital proxy signature scheme in which the warrant message can be recovered from the proxy signature. In this scheme the warrant message is conveyed within the pr...

Motivated by the need to have secure strong designate verifier signatures (SDVS) even in the presence of quantum computers, a post-quantum lattice-based SDVS scheme is proposed based on the hardness of the short integer solution problem (SIS) and the learning with errors problem (LWE). The proposed SDVS scheme utilizes the Bonsai trees and pre-image sample-able function primitives to generate t...

Key-homomorphic properties of cryptographic objects have proven to be useful, both from a theoretical as well as a practical perspective. Important cryptographic objects such as pseudorandom functions or (public key) encryption have been studied previously with respect to key-homomorphisms. Interestingly, however, signature schemes have not been explicitly investigated in this context so far. W...

The idea of a proxy signature scheme was first presented by Mambo et al. [1] in 1996. Their proxy signature scheme allows an original signer to delegate his signing right to a proxy signer to sign the message on behalf of an original signer. Later, the verifier, which knows the public keys of original signer and a proxy signer can check a validity of a proxy signature issued by a proxy signer. ...

Group signatures allow group members to sign an arbitrary number of messages on behalf of the group without revealing their identity. Under certain circumstances the group manager holding a tracing key can reveal the identity of the signer from the signature. Practical group signature schemes should support membership revocation where the revoked member loses the capability to sign a message on...

The identification protocol is a type of zero-knowledge proof. One party (the prover) needs to prove his identity another verifier) without revealing the secret key verifier. can apply Fiat–Shamir transformation convert an scheme into signature which be used for achieving security purposes and cryptographic purposes, especially authentication. In this paper, we recall protocol, namely RankID sc...