ACM Home Page
Please provide us with feedback. Feedback
Breaking and repairing a convertible undeniable signature scheme
Full text PdfPdf (484 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 3rd ACM conference on Computer and communications security table of contents
New Delhi, India
Pages: 148 - 152  
Year of Publication: 1996
ISBN:0-89791-829-0
Authors
Markus Michels  Theoretical Computer Science and Information Security, University of Technology Chemnitz-Zwickau, Straβe der Nationen 62, D-09111 Chemnitz, Germany
Holger Petersen  Theoretical Computer Science and Information Security, University of Technology Chemnitz-Zwickau, Straβe der Nationen 62, D-09111 Chemnitz, Germany
Patrick Horster  Theoretical Computer Science and Information Security, University of Technology Chemnitz-Zwickau, Straβe der Nationen 62, D-09111 Chemnitz, Germany
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/238168.238207
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
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.
 
4
 
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.
 
6
W.Diffie, M.Hellmann, "New directions in cryptography", IEEE Transactions on Information Theory, Vol. IT-22, No. 6, November, (1976), pp. 644-654.
 
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.
 
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.
 
9
10
 
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.
 
12
M.Jakobsson, "Designated verifier proofs or making proofs of knowledge non-transferable", manuscript, (1995), available at: http ://www-cse. ucsd.edu/users/markus
 
13
National Institute of Standards and Technology, Fed- FIPS Pub 186, Digital Signature Standard (DSS), May 19, (1994), 20 pages.
 
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.
 
15
C.P.Schnorr, "Efficient signature generation for smart cards", Journal of Cryptology, Vol. 4, (1991), pp. 161-174.

Collaborative Colleagues:
Markus Michels: colleagues
Holger Petersen: colleagues
Patrick Horster: colleagues