Article

Free access

Breaking and repairing a convertible undeniable signature scheme

Authors:

Markus Michels,

Holger Petersen,

Patrick HorsterAuthors Info & Claims

CCS '96: Proceedings of the 3rd ACM conference on Computer and communications security

Pages 148 - 152

https://doi.org/10.1145/238168.238207

Published: 01 January 1996 Publication History

PDF eReader

References

[1]

J.Boyar, D.Chaum, I.Damgard, T.Pedersen, "Convertible undeniable signatures", Lecture Notes in Computer Science 537, Advances in Cryptology: Proc. Crypto '90, Springer Verlag, (1991), pp. 189-205.

Digital Library

Google Scholar

[2]

D.Chaum, "Zero-knowledge undeniable signatures", Lecture Notes in Computer Science 473, Advances in Cryptology: Proc. Eurocrypt '90, Springer Verlag, (1991), pp. 458-464.

Digital Library

Google Scholar

[3]

D.Chaum, "Some weakness of "Weaknesses of Undeniable Signatures"", Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt '91, Springer Verlag, (1992), pp. 554-556.

Google Scholar

[4]

D.Chaum, H. van Antwerpen, "Undeniable Signatures", Lecture Notes in Computer Science 435, Advances in Cryptology: Proc. Crypto '89, Springer Verlag, (1990), pp. 212-216.

Digital Library

Google Scholar

[5]

Y.Desmedt, M.Yung, "Weaknesses of undeniable signature schemes", Lecture Notes in Computer Science 847, Advances m Uryptology: Froc. ~urocrypt ~91, Springer Verlag, (1992), pp. 205-220.

Google Scholar

[6]

W.Diffie, M.Hellmann, "New directions in cryptography", IEEE Transactions on Information Theory, Vol. IT-22, No. 6, November, (1976), pp. 644-654.

Google Scholar

[7]

T.E1Gamal, "A public key cryptosystem and a signature scheme based on discrete logarithms", IEEE Transactions on Information Theory, Vol. IT-30, No. 4, July, (1985), .pp. 469- 472.

Google Scholar

[8]

A.Fujioka, T.Okamoto, K.Ohta, "Interactive Bi- Proof Systems and undeniable signature schemes", Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt '91, Springer Verlag, (1992), pp. 243-256.

Google Scholar

[9]

S.Goldwasser, S.Micali, R.Rivest, "A digital signature scheme secure against adaptive chosen message attacks", SIAM Journal on Computing, Vol. 17, No. 2, (1988), pp. 281 - 308.

Digital Library

Google Scholar

[10]

P.Horster, M.Michels, H.Petersen, "Meta-EIGamal signature schemes", Proc. of the 2nd ACM Conference on Computer and Communication Security, Fairfax, (1994), pp. 96-107.

Digital Library

Google Scholar

[11]

M.Jakobsson, "Blackmailing using undeniable signatures", Lecture Notes in Computer Science 950, Advances in Cryptology: Proc. Eurocrypt'94, Springer Verlag, (1995), pp. 425-427.

Crossref

Google Scholar

[12]

M.Jakobsson, "Designated verifier proofs or making proofs of knowledge non-transferable", manuscript, (1995), available at: http ://www-cse. ucsd.edu/users/markus

Google Scholar

[13]

National Institute of Standards and Technology, Fed- FIPS Pub 186, Digital Signature Standard (DSS), May 19, (1994), 20 pages.

Google Scholar

[14]

T.P.Pedersen, "Distributed provers with applications to undeniable signatures, Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt '91, Springer Verlag, (1992), pp. 221-242.

Google Scholar

[15]

C.P.Schnorr, "Efficient signature generation for smart cards", Journal of Cryptology, Vol. 4, (1991), pp. 161-174.

Digital Library

Google Scholar

Cited By

View all

Kale PHazarika PChandavarkar B(2020)Undeniable Signature Scheme: A Survey2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT)10.1109/ICCCNT49239.2020.9225482(1-7)Online publication date: Jul-2020
https://doi.org/10.1109/ICCCNT49239.2020.9225482
Huang QWong D(2013)Short and efficient convertible undeniable signature schemes without random oraclesTheoretical Computer Science10.1016/j.tcs.2013.01.010476(67-83)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.tcs.2013.01.010
Seurin Y(2013)New Constructions and Applications of Trapdoor DDH GroupsPublic-Key Cryptography – PKC 201310.1007/978-3-642-36362-7_27(443-460)Online publication date: 2013
https://doi.org/10.1007/978-3-642-36362-7_27
Show More Cited By

Index Terms

Breaking and repairing a convertible undeniable signature scheme
1. Security and privacy
  1. Systems security
    1. Operating systems security
2. Social and professional topics
  1. Computing / technology policy
    1. Computer crime

Recommendations

Improvement of a Convertible Undeniable Partially Blind Signature Scheme
AINA '06: Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01

Undeniable signatures are the digital signatures that should be verified with the help of the signer. A signer may disavow a genuine document, if the signature is only verifiable with the aid of the signer under the condition that the signer is not ...
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07: Proceedings of the First international conference on Pairing-Based Cryptography

Undeniable signatures, introduced by Chaum and van Antwerpen, is a useful cryptography primitive to limit the publicly verifiable property of ordinary digital signatures. In an undeniable signature scheme, the validity or invalidity of the signature can ...
New convertible undeniable signature schemes
EUROCRYPT'96: Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Undeniable signatures are like ordinary digital signatures, except that testing validity of a signature requires interaction with the signer. This gives the signer additional control over who will benefit from being convinced by a signature, and is ...

Comments

Information & Contributors

Information

Published In

CCS '96: Proceedings of the 3rd ACM conference on Computer and communications security

January 1996

179 pages

ISBN:0897918290

DOI:10.1145/238168

Chairmen:
Li Gong
SRI International
,
Jacques Stearn
ENS-DMI

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

3CCS96

Sponsor:

SIGSAC

3CCS96: 3rd ACM Conference on Computer & Communications Security

March 14 - 15, 1996

New Delhi, India

Acceptance Rates

CCS '96 Paper Acceptance Rate 19 of 59 submissions, 32%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '24

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 14 - 18, 2024

Salt Lake City , UT , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
537
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)6

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kale PHazarika PChandavarkar B(2020)Undeniable Signature Scheme: A Survey2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT)10.1109/ICCCNT49239.2020.9225482(1-7)Online publication date: Jul-2020
https://doi.org/10.1109/ICCCNT49239.2020.9225482
Huang QWong D(2013)Short and efficient convertible undeniable signature schemes without random oraclesTheoretical Computer Science10.1016/j.tcs.2013.01.010476(67-83)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.tcs.2013.01.010
Seurin Y(2013)New Constructions and Applications of Trapdoor DDH GroupsPublic-Key Cryptography – PKC 201310.1007/978-3-642-36362-7_27(443-460)Online publication date: 2013
https://doi.org/10.1007/978-3-642-36362-7_27
Huang QWong DSusilo WYang B(2011)An efficient construction of time-selective convertible undeniable signaturesProceedings of the 14th international conference on Information security10.5555/2051002.2051035(355-371)Online publication date: 26-Oct-2011
https://dl.acm.org/doi/10.5555/2051002.2051035
Huang QWong D(2011)Short convertible undeniable signature in the standard modelProceedings of the 7th international conference on Information security practice and experience10.5555/2009103.2009129(257-272)Online publication date: 30-May-2011
https://dl.acm.org/doi/10.5555/2009103.2009129
SCHULDT JMATSUURA K(2011)Efficient Convertible Undeniable Signatures with Delegatable VerificationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E94.A.71E94-A:1(71-83)Online publication date: 2011
https://doi.org/10.1587/transfun.E94.A.71
Monnerat JVaudenay S(2011)Short Undeniable Signatures Based on Group HomomorphismsJournal of Cryptology10.1007/s00145-010-9070-124:3(545-587)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1007/s00145-010-9070-1
Huang QWong DSusilo WYang B(2011)An Efficient Construction of Time-Selective Convertible Undeniable SignaturesInformation Security10.1007/978-3-642-24861-0_24(355-371)Online publication date: 2011
https://doi.org/10.1007/978-3-642-24861-0_24
Huang QWong D(2011)Short Convertible Undeniable Signature in the Standard ModelInformation Security Practice and Experience10.1007/978-3-642-21031-0_20(257-272)Online publication date: 2011
https://doi.org/10.1007/978-3-642-21031-0_20
Kikuchi RPhong LOgata W(2010)A framework for constructing convertible undeniable signaturesProceedings of the 4th international conference on Provable security10.5555/1927915.1927923(70-86)Online publication date: 13-Oct-2010
https://dl.acm.org/doi/10.5555/1927915.1927923
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Improvement of a Convertible Undeniable Partially Blind Signature Scheme

Provably secure pairing-based convertible undeniable signature with short signature length

New convertible undeniable signature schemes

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Improvement of a Convertible Undeniable Partially Blind Signature Scheme

Provably secure pairing-based convertible undeniable signature with short signature length

New convertible undeniable signature schemes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations