An Efficient Strong Designated Verifier Signature Scheme

Saeednia, Shahrokh; Kremer, Steve; Markowitch, Olivier

doi:10.1007/978-3-540-24691-6_4

Cited by 190 publications

(143 citation statements)

References 11 publications

Supporting

Mentioning

143

Contrasting

Order By: Relevance

“…A DVS scheme allows a signer Alice to convince a designated verifier Bob that Alice has endorsed the message while Bob cannot transfer this conviction to anyone else. As discussed in [15], if Alice create a ring signature on behalf of the ring with Alice and Bob and sends the ring signature to Bob, Bob will be convinced that the message has been endorsed by Alice. On the other hand, the signature will not be able to convince any outsider since Bob could have been the creater of the signature.…”

Section: Applicationsmentioning

confidence: 99%

Two-Party (Blind) Ring Signatures and Their Applications

Susilo

2014

Information Security Practice and Experience

View full text Add to dashboard Cite

Abstract. Ring signatures, introduced by Rivest, Shamir and Tauman, attest the fact that one member from a ring of signers has endorsed the message but no one can identify who from the ring is actually responsible for its generation. It was designed canonically for secret leaking. Since then, various applications have been discovered. For instance, it is a building block of optimistic fair exchange, destinated verifier signatures and ad-hoc key exchange. Interestingly, many of these applications require the signer to create a ring signature on behalf of two possible signers (a two-party ring signature) only. An efficient two-party ring signature scheme due to Bender, Katz, and Morselli, is known. Unfortunately, it cannot be used in many of the aforementioned applications since it is secure only in a weaker model. In this paper, we revisit their construction and proposed a scheme that is secure in the strongest sense. In addition, we extend the construction to a two-party blind ring signature. Our proposals are secure in the standard model under well-known number-theoretic assumptions. Finally, we discuss the applications of our construction, which include designated verifier signatures, optimistic fair exchange and fair outsourcing of computational task.

show abstract

Section: Applicationsmentioning

confidence: 99%

Two-Party (Blind) Ring Signatures and Their Applications

Susilo

2014

Information Security Practice and Experience

View full text Add to dashboard Cite

show abstract

“…Since the verifier knows that she was not the one who created the proof, she becomes convinced about the validity of the statement; however, she cannot convince any third party that the proof was produced by the prover and not by herself. Saeednia et al [17] improve the notion of designated verifier signatures, in which not only the verifier but anybody can simulate transcripts of valid proof conversations. They also propose an efficient designated verifier signature using the Fiat-Shamir heuristic.…”

Section: Related Workmentioning

confidence: 99%

Designated Attribute-Based Proofs for RFID Applications

Alpár

Batina

Lueks

2013

Radio Frequency Identification. Security and Privacy Issues

View full text Add to dashboard Cite

Abstract. Recent research has shown that using public-key cryptography in order to meet privacy requirements for RFID tags is not only necessary, but also now practically feasible. This has led to the development of new protocols like the Randomized Schnorr [6] identification protocol. This protocol ensures that the identity of a tag only becomes known to authorised readers. In this paper we generalize this protocol by introducing an attribute-based identification scheme. The proposed scheme preserves the designation of verification (i.e., only an authorised reader is able to learn the identity of a tag) while it allows tags to prove any subset of their attributes to authorised readers. The proposed scheme is proven to be secure and narrow-strong private.

show abstract

“…Nevertheless, some security flaws of Jakobsson et al's scheme were pointed out by both Wang [12] and Saeednia et al [13] in 2003, respectively. The latter also introduced the Strong Designated Verifier Signature (SDVS) scheme which prevents anyone except for the designated verifier from validating the signature, since it requires the designated verifier's private key for performing the verification procedure.…”

Section: Introductionmentioning

confidence: 99%

ID-Based Non-Interactive Universal Designated Verifier Signature for Privacy-Preserving Applications

Lin¹

2015

IJCTE

View full text Add to dashboard Cite

Abstract-A Universal Designated Verifier Signature (UDVS) scheme is an ideal mechanism for preventing any signature holder from arbitrarily disseminating the signature, so as to protect the privacy of original signer. Such schemes are suitable for applications like the certificate of medical records and income summary, etc. In this scheme, a signature holder (designator) can generate a designated verifier signature which can only be verified by an intended verifier. Additionally, the verifier cannot transfer his proof to any third party, since he is also capable of simulating a computationally indistinguishable transcript. In this paper, the author proposes a new ID-based non-interactive UDVS scheme based on the assumption of Bilinear Diffie-Hellman Problem (BDHP). To ensure the security of proposed scheme, the requirement of strong unforgeability is formally proved in the random oracle model. Compared with previous works, our mechanism also provides better functionalities.Index Terms-Universal designated verifier signature, bilinear pairings, privacy-preserving, random oracle, public key system.

show abstract

An Efficient Strong Designated Verifier Signature Scheme

Cited by 190 publications

References 11 publications

Two-Party (Blind) Ring Signatures and Their Applications

Two-Party (Blind) Ring Signatures and Their Applications

Designated Attribute-Based Proofs for RFID Applications

ID-Based Non-Interactive Universal Designated Verifier Signature for Privacy-Preserving Applications

Contact Info

Product

Resources

About