Abstract
The linearity of “check vectors” — a technique of secure distributed computation — gives an efficient solution to the problem of blind weak signatures (where a weak signature requires the on-line participation of a third party [17]). We refine aspects of the notion of “blinding a signature,” and apply our weak schemes to on-line digital cash and other problems. The protocols we present are distinctly short, simple, and of low complexity.
This work was partially supported by an AT&T Bell Laboratories Scholarship
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Beaver, “Distributed computations tolerating a faulty minority, and multiparty zero-knowledge proof systems,” J. Cryptology 4, 2 (1991).
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant secure distributed computation,” ACM STOC 1988.
J. Carter and M. Wegman, “Universal classes of hash function,” JCSS 18 (1979), 143–154.
D. Chaum, “Security without identification: transaction systems to make big brother obsolete,” CACM 28, 10 (October 1985).
D. Chaum, C. Crépeau, and I. Damgård, “Multiparty unconditionally secure protocols,” ACM STOC 1988.
D. Chaum, A. Fiat, and M. Naor, “Untraceable electronic cash,” Crypto 1988, 319–327.
D. Chaum and S. Roijakkers, “Unconditionally secure digital signatures,” Crypto 1990, 206–214.
B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, “Verifiable secret sharing” IEEE FOCS 1985, 383–395.
J. Feigenbaum and M. Merritt, “Open questions, talk abstracts, and summary of discussions,” in Distributed Computing and Cryptography, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 2, 1991, 1–45.
E. Gilbert, F. MacWilliams, and N. Sloane, “Codes which detect deception,” Bell Systems Technical Journal 53 (1974), 405–424.
O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” ACM STOC 1987, 218–229.
A. Herzberg, P. Janson, S. Kutten, R. Molva, G. Tsudik and M. Yung, “KryptoKnight: light-weight authentication and key distribution protocols,” Manuscript.
R. Impagliazzo and M. Luby, “One-way functions are essential for complexity based cryptography,” IEEE FOCS 1989, 230–235.
J. Kohl, “The use of encryption in Kerberos for network authentication,” Crypto 1989, 35–43.
S. Micali, “Fair public-key cryptosystems,” Crypto 1992.
T. Rabin, “Robust sharing of secrets when the dealer is honest or cheating,” M.Sc. Thesis, Hebrew University, 1988.
T. Rabin and M. Ben-Or, “Verifiable secret sharing and multiparty protocols with honest majority,” ACM STOC 1989, 73–85.
R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” CACM 21 (1978), 120–126.
G. Simmons, “Authentication theory / Coding theory,” Crypto 1984, 411–432.
A. Yao, “How to generate and exchange secrets,” IEEE FOCS 1986, 162–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franklin, M., Yung, M. (1995). The blinding of weak signatures. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053425
Download citation
DOI: https://doi.org/10.1007/BFb0053425
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive