Abstract
We consider communication networks in which it is not possible to identify the source of a message which is broadcasted through the network. A natural question is whether it is possible for two users to identify each other concurrently, through a secure two-party protocol. We show that more than the existence of a secure Public Key Cryptosystem should be assumed in order to present a secure protocol for concurrent identification. We present two concurrent identification protocols: The first one relies on the existence of a center who has distributed “identification tags” to the users; while the second protocol relies on the distribution of “experimental sequences” by instances of a pre-protocol which have taken place between every two users.
This research was carried out at the Computer Science Department Technion - Israel Institute of Technology
Chapter PDF
Similar content being viewed by others
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.
6. References
Abramson, N., Information Theory and Coding, McGraw-Hill,1963, pp. 100–105.
Bennett, C.H., Brassard, G., Breidbart, S., and Wiesner, S., “Quantum Cryptography or Unforgeable Subway Tokens”, in Advances in Cryptology:Proceedings of Crypto82, (Chaum, D. et al. editors), Plenum Press, 1983, pp. 267–275.
Diffie, W., and Hellman, M.E., “New Directions in Cryptography”, IEEE Trans. on Inform. Theory, Vol. IT-22, No. 6, November 1976, pp. 644–654
Even, S., Goldreich, O., and Lempel, A., “A Randomized Protocol for Signing Contracts”, in Advances in Cryptology:Proceedings of Crypto82, (Chaum, D. et al. editors), Plenum Press, 1983, pp. 205–210
Even, S., Goldreich, O., and Lempel, A., “A Randomized Protocol for Signing Contracts”, TR No. 233, Computer Science Dept., Technion, Haifa, Israel, February 1982
Goldreich, O., “On Concurrent Identification Protocols”, MIT/LCS/TM-250, December 1983
Lubi, M., Micali, S., and Rackoff, C., “How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin”, proceedings of the 24th IEEE Symp. on Foundation Of Computer Science, 1983, pp. 11–21
National Bureau of Standards, Data Encryption Standard, Federal Information Processing Standards, Publ. 46, 1977
Rabin, M.O., “How to Exchange Secrets by Oblivious Transfer”, Technical memo TR-81, Harvard Center for Research in Computing, (1981).
Rivest, R.L., Shamir, A., and Adleman, L., “A Method for Obtaining Digital Signature and Public Key Cryptosystems”, Comm. of the ACM, Vol.21, February 1978, pp. 120–126
Shannon, C.E., “Communication Theory of Secrecy Systems”, Bell Syst. Jour. 28, October 1949, pp. 656–715
Tedrick, T., “How to Exchange Half a Bit”, to appear in the proceedings of Crypto83
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldreich, O. (1985). On Concurrent Identification Protocols (Extended Abstract). In: Beth, T., Cot, N., Ingemarsson, I. (eds) Advances in Cryptology. EUROCRYPT 1984. Lecture Notes in Computer Science, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39757-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16076-2
Online ISBN: 978-3-540-39757-1
eBook Packages: Springer Book Archive