Abstract
A cryptographic concept, blind decoding is discussed: a client has a message encrypted with a server's public key and the client asks the server to decode the message without revealing what is the decoded plaintext nor learning the server's secret key. Blind decoding is a useful tool for protecting user's privacy in on-line shopping over the Internet. The RSA-based blind decoding is easily converted from the similar protocol as the Chaum's blind signature scheme, and a blind decoding protocol for the ElGamal encryption scheme is newly proposed. Moreover, the practical gap between the known RSA-based blind decoding and our ElGamal-based scheme is discussed in the application to protecting copyright matter of electronic documents.
In blind decoding scheme, undetectability of the decrypted message has both negative and positive aspects: a negative aspect is considered as the problem of spotting the oracle and a positive aspect is applicable to making undeniable signatures blind against the signer.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.Abadi, J.Feigenbaum, and J.Kilian, ”On hiding information from an oracle,” JCSS 39, pp.21–50 (1989).
R.Anderson and R.Needham, ”Robustness principles for public key protocols,” Advances in Cryptology-CRYPTO '95, LNCS 963, pp.236–247 (1995).
D. Chaum, J Boyar, I.Damgaard, and T.Pedersen, ”Undeniable signatures: applications and theory,” Technical Report (1991).
D. Chaum, ”Blind Signatures for untraceable payments,” Advances in Cryptology Proceedings of Crypto '82, pp. 199–203 (1983).
D. Chaum and T. Pedersen, ”Wallet Databeses with Observers,” Advances in Cryptology, CRYPTO'92, pp. 89–105 (1993).
D. Chaum, H. van Antwerpen, ”Undeniable Signatures,” Advances in Cryptology-CRYPTO '89, pp.212–216 (1990)
J. L. Carmenisch, J.-M. Piveteau, M. A. Stadler, ”Blind signature schemes based on the discrete logarithm problem”, Proc. of Eurocrypt '94, pp.428–432 (1995).
Diffie, W. and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Inform. Theory, IT-22, No.6, pp.644–654, (Nov. 1976).
T.ElGamal, ”A public key cryptsystem and a signature scheme based on discrete logarithms” IEEE Trans. on IT, 31, pp.469–472 (1985).
Neal Koblitz, “Elliptic curve cryptosystems,” Math. Comp., vol. 48, No.177, pp.203–209 (1987).
Neal Koblitz, “A Course in Number Theory and Cryptography,” GTM114, Springer-Verlag, New York (1987).
Victor S. Miller, “Use of elliptic curves in cryptography,” CRYPTO'85, pp.417–426.
Silvio Micali, ”Fair public key cryptosystems,” Proc. Crypto '92, pp.113-138 (1993).
Rivest, R. L., “Cryptography,” Chapter 13 of Handbook of Theoretical Computer Science, Vol.A, Algorithms and Complexity, edited by Jan van Leeuwen, The MIT, pp.717–755 (1990).
R.L.Rivest, A.Shamir, and L.Adleman, “A method for obtaining digital signatures and public key cryptosystems,” Comm. ACM, 21, pp.120–126 (1978).
A.Shamir, L.Rivest, and L.Adleman, ”Mental Poker,” MIT/LCS, TM-125 (1979)
S. von Solms and D. Naccache, ”On blind signatures and perfect crimes,” Computers and Security. Vol.11, No.6.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakurai, K., Yamane, Y. (1996). Blind decoding, blind undeniable signatures, and their applications to privacy protection. In: Anderson, R. (eds) Information Hiding. IH 1996. Lecture Notes in Computer Science, vol 1174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61996-8_45
Download citation
DOI: https://doi.org/10.1007/3-540-61996-8_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61996-3
Online ISBN: 978-3-540-49589-5
eBook Packages: Springer Book Archive