Branding/Logomark minus Citation Combined Shape Icon/Bookmark-empty Icon/Copy Icon/Collection Icon/Close Copy 7 no author result Created with Sketch. Icon/Back Created with Sketch. Match!

Identity-Based Secret Signature Scheme

Published on Nov 1, 2009
· DOI :10.1109/ICCIT.2009.182
Byoungcheon Lee18
Estimated H-index: 18
Jin Li10
Estimated H-index: 10
(IIT: Illinois Institute of Technology),
Kwangjo Kim31
Estimated H-index: 31
Secret signature, proposed by Lee et al. [11], is a new signature scheme which provides signature privacy and public provability together. Using the secret signature scheme a signer can send his signature secretly to a specific receiver such that only the designated receiver can verify the signature. If any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. Thus it can be used as an important cryptographic primitive to implement private business transactions. In this paper we present an identity-based implementation of secret signature scheme which can enjoy the advantage of reducing key management load compared with the traditional certificate-based cryptography. We modify Cha-Cheon’s IDbased signature scheme [3] and ID-based key agreement scheme [14] to provide public provability, and then combine them to implement ID-based secret signature (IBSS) scheme.
  • References (16)
  • Citations (2)
Published on Aug 27, 2007
Byoungcheon Lee18
Estimated H-index: 18
Kim-Kwang Raymond Choo41
Estimated H-index: 41
(Australian Institute of Criminology)
+ 1 AuthorsSeung-Jae Yoo3
Estimated H-index: 3
Digital signatures provide authentication and nonrepudiation in a public way in the sense that anyone can verify the validity of a digital signature using the corresponding public key. In this paper, we consider the issues of (1) signature privacy and (2) the corresponding public provability of signature. We propose a new digital signature variant, secret signature, which provides authentication and nonrepudiation to the designated receiver only. If required, the correctness of the secret signat...
Published on Jun 8, 2004
Xiaofeng Chen43
Estimated H-index: 43
(ICU: Information and Communications University),
Estimated H-index: 24
(SYSU: Sun Yat-sen University),
Kwangjo Kim31
Estimated H-index: 31
(ICU: Information and Communications University)
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a limited verifier, who will try to preserve the privacy of the signer if the signer follows some specified rules. Also, the limited verifier can provide a proof to convince a judge that the signer has indeed generated the signature if he violated the predetermined rule. However, the judge cannot transfer this proof to ...
Published on Apr 13, 2003
Steven D. Galbraith26
Estimated H-index: 26
(RHUL: Royal Holloway, University of London),
Wenbo Mao15
Estimated H-index: 15
(HP: Hewlett-Packard)
A proxy signature enables the original signer to delegate her signing capability to a proxy entity, who signs a message on behalf of the original signer. In this paper, we discuss the necessity of a secure channel in proxy signatures. Though establishing a secure channel has much influence on the efficiency of the scheme, to the best of our knowledge, this topic has not been discussed before. All known proxy signatures used a secure channel to deliver a signed warrant except one which used a 3-p...
Published on Jan 1, 2002in Electronics Letters 1.34
Nigel P. Smart51
Estimated H-index: 51
(UoB: University of Bristol)
An ID-based authenticated two pass key agreement protocol which makes use of the Weil pairing is presented. The protocol is described and its properties are discussed, including the ability to add key confirmation.
Published on May 12, 1996
Markus Jakobsson6
Estimated H-index: 6
(UCSD: University of California, San Diego),
Kazue Sako17
Estimated H-index: 17
Russell Impagliazzo50
Estimated H-index: 50
(UCSD: University of California, San Diego)
For many proofs of knowledge it is important that only the verifier designated by the confirmer can obtain any conviction of the correctness of the proof. A good example of such a situation is for undeniable signatures, where the confirmer of a signature wants to make sure that only the intended verifier(s) in fact can be convinced about the validity or invalidity of the signature. Generally, authentication of messages and off-the-record messages are in conflict with each other. We show how, usi...
Published on Apr 1, 1988in SIAM Journal on Computing 1.56
Shafi Goldwasser64
Estimated H-index: 64
(MIT: Massachusetts Institute of Technology),
Silvio Micali68
Estimated H-index: 68
(MIT: Massachusetts Institute of Technology),
Ronald L. Rivest75
Estimated H-index: 75
(MIT: Massachusetts Institute of Technology)
We present a digital signature scheme based on the computational difficulty of integer factorization.The scheme possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a way that depends on the signatures of previously chosen messages) cannot later forge the signature of even a single additional message. This may be somewhat surprising, since in the folklore the pr...
Published on Aug 23, 1985 in CRYPTO (International Cryptology Conference)
A. Shamm71
Estimated H-index: 71
(Weizmann Institute of Science)
In this paper we introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other’s signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party. The scheme assumes the existence of trusted key generation centers, whose sole purpose is to give each user a personalized smart card when he first joins the network. The information embedded in this card enables the...
Cited By2
Published on Jan 1, 2014
Abhishek Roy4
Estimated H-index: 4
(B. U.: University of Burdwan),
Sunil Karforma6
Estimated H-index: 6
(B. U.: University of Burdwan)
Published on Dec 1, 2013
Byoungcheon Lee18
Estimated H-index: 18
Secret signatures, proposed by Lee \textit{et al.} \cite{LCYY07,LLK09}, provide signature privacy and public provability at the same time. Using these schemes a signer can send his signature secretly to a designated receiver such that only the designated receiver can verify the signature. Moreover, if any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. But in these schemes one of the drawback is that the signer has t...