Abstract
Two special digital signature schemes, oblivious signatures, are proposed. In the first, the recipient can choose one and only one of n keys to get a message signed without revealing to the signer with which key the message is signed. In the second, the recipient can choose one and only one of n messages to be signed without revealing to the signer on which message the signature is made.
Chapter PDF
Similar content being viewed by others
Key words
References
S. Brands. Untraceable Off-line Cash in Wallet with Observers. In Advances in Cryptology — Proceedings of CRYPTO 93. Lecture Notes in Computer Science #773, Springer-Verlag, 1994, pp. 302–318.
D. Chaum. Blind Signatures for Untraceable Payments. In Advances in Cryptology — Proceedings of Crypto '82, Plenum Press, 1983, pp. 199–203.
D. Chaum. Designated confirmer signatures. In Advances in Cryptology — proceedings of EUROCRYPT'94.
D. Chaum, E. van Heyst. Group Signatures. In Advances in Cryptology — proceedings of EUROCRYPT 91, Lecture Notes in Computer Science, pages 257–265. Springer-Verlag, 1991.
D. Chaum and T. P. Pedersen. Wallet Databases with observers. In Advances in Cryptology — proceedings of CRYPTO 92, Lecture Notes in Computer Science, pages 89–105. Springer-Verlag, 1993.
L. Chen, I. Damgaard and T. P. Pedersen. Parallel divertibility of proofs of knowledge. In Advances in Cryptology — proceedings of EUROCRYPT 94.
C. Crepeau Equivalence between two flavours of oblivious transfer. In Advances in Cryptology — proceedings of CRYPTO 87, Lecture Notes in Computer Science, pages 350–354. Springer-Verlag, 1988.
W. Diffie and M. E. Hellman New Directions in Cryptography. In IEEE Trans. Inform., IT-22(6):644–654, November, 1976.
A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology — proceedings of EUROCRYPT 86, Lecture Notes in Computer Science, pages 186–194. Springer-Verlag, 1987.
U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Protocols. In Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pages 416–426, 1990.
S. Goldwasser, S. Micali, and R. L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack. SIAM Journal on Computing, 17(2):281–308, April 1988.
M. Rabin. How to exchange secrets by oblivious transfer Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University,1981.
B. Schoenmakers. Efficient Proofs of Or. Manuscript, 1993.
G. J. Simmons. The Prisoner's Problem and the Subliminal Problems. In Advances in Cryptology — proceedings of CRYPTO 83, Plenum Press, pages 51–67. 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L. (1994). Oblivious signatures. In: Gollmann, D. (eds) Computer Security — ESORICS 94. ESORICS 1994. Lecture Notes in Computer Science, vol 875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58618-0_62
Download citation
DOI: https://doi.org/10.1007/3-540-58618-0_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58618-0
Online ISBN: 978-3-540-49034-0
eBook Packages: Springer Book Archive