Movatterモバイル変換


[0]ホーム

URL:


Skip to main content

Advertisement

Springer Nature Link
Log in

Society and Group Oriented Cryptography: a New Concept

  • Conference paper
  • First Online:

Part of the book series:Lecture Notes in Computer Science ((LNCS,volume 293))

Abstract

Messages are frequently addressed to a group of people,e.g., board of directors. Conventional and public key systems (in the sense of Diffie and Hellman [4]) are not adapted when messages areintended for a group instead of for an individual. To deeply understand the lack of usefulness of the above cryptmystems in the case that messages are intended for (or are originating from) a group of people, let u s now nevertheless attempt to use these systems. When conventional and public key systems are used to protect privacy, the legitimate receiver(s) has (have) to know the secret key to decrypt. This means that, a first solution could be, to send the message to dl members of the group,e.g., using their public keys. A second is that the secret key is known to all membexs and that the message is sent only once. All other solutions using a conventional or public key system, are combinations of the above two solutions. We now explain briefly why these two obvious solutions are not adapted to security needs specific to the protection of information intended for groups.

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.

References

  1. M. Blum. How to exhange (secret) keys.ACM Trans. on Computer Systems, 1(2):175–193, May 1983.

    Article  Google Scholar 

  2. G. Davida and B. Matt. Arbitration in tamper proof systems. Presented at the same conference (Crypto’87).

    Google Scholar 

  3. Y. Desmedt and J.-J. Quisquater. Public key systems based on the difficulty of tampering (Is there a difference between DES and RSA?). Presented at CRYPTO’86, Santa Barbara, California, U. S. A., August 11–15, 1986, extended abstract will appear in Advances in Cryptology, Proc. of Crypto’86. Lecture Notes in Computer Science, Springer-Verlag, 1987.

    Google Scholar 

  4. W. Diffie and M. E. Hellman. New directions in cryptography.IEEE Trans. Inform. Theory, IT-22(6):644–654, November 1976.

    Article MathSciNet  Google Scholar 

  5. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. InProceedings of the Nineteenth ACM Symp. Theory of Computing, STOC, pages 218–229, May 25–27, 1987.

    Google Scholar 

  6. G. M. Schneider and S. C. Bruell.Advanced programming and problem solving with Pascal. Wiley, N.Y., second edition, 1987.

    Google Scholar 

  7. A. C. Yao. How to generate and exchange secrets. InThe Computer Society of IEEE, 27th Annual Symp. on Foundations of Computer Science (FOCS), pages 162–167, IEEE Computer Society Press, 1986. Toronto, Ontario, Canada, October 27–29, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dépt. I.R.O., Université de Montréal, Montréal, Québec, H3C 3J7, Canada

    Yvo Desmedt

Authors
  1. Yvo Desmedt

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, The University of Georgia, Athens, Georgia, 30602, USA

    Carl Pomerance

Rights and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Desmedt, Y. (1988). Society and Group Oriented Cryptography: a New Concept. In: Pomerance, C. (eds) Advances in Cryptology — CRYPTO ’87. CRYPTO 1987. Lecture Notes in Computer Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48184-2_8

Download citation

Publish with us


[8]ページ先頭

©2009-2025 Movatter.jp