Skip to main content
SpringerLink
Log in

Coalition Public-Key Cryptosystems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A coalition is understood to be a group of participants (coalitionists) who can collaborate in order to achieve common objectives. The basic principle of a coalition is the absence of a threat to communication flows within the coalition from its participants. In this paper, two new RSA coalition protocols are considered. According to the first protocol, only one participant in a coalition (called its leader) generates an RSA scheme for the other participants. In this case, an ordinary participant should send only one arbitrary number to the leader over a secure channel. In the other version, the general parameters of the RSA scheme being used are transmitted from the leader to a participant over a secure channel. This makes it possible to use very small keys and to substantially increase the data rate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Coalition Networking, Signal AFCEA's International Journal, October, 86 (2000).

  2. A. Menezes,P.van Oorschot, andS. Vanstone, Handbook of Applied Cryptography, Chapter 12, CRC Press (1997).

  3. W. Diffie andM. E. Hellman, “New directions in cryptography,” IEEE Trans. Inf. Theory, IT-22, 644–654 (1976).

    Google Scholar 

  4. T. El-Gamal, “A public key cryptosystem and a signature scheme based on discrete logarithm,” IEEE Trans. Inf. Theory, IT-31, 469–472 (1985).

    Google Scholar 

  5. A. Shamir, “How to share a secret,” Comm. ACM, 22, 612–613 (1979).

    Google Scholar 

  6. R. Rivest,A. Shamir, andL. Adleman, “A method for obtaining digital signatures and public key cryptosystems,” Comm. ACM, 21, No. 2, 120–126 (1978).

    Google Scholar 

  7. M. Pollard, “Theorems on factorization and primality testing,” Cambridge Philos. Soc., 521–528 (1974).

  8. H. C. Williams, “A p +1 method of factoring,” Math. Comput., 225–234 (1982).

  9. J. Gordon, “Strong primes are easy to find,” in: Cryptology Proceedings of EUROCRYPT 84 (LNCS 209), 216–223 (1985).

  10. M. O. Rabin, Digital Signatures and Public-Key Functions as Intractable as Factorization, Technical Report MIT MIT/LCS, No. TR 212 (1978).

Download references

Author information

Authors and Affiliations

  1. Taras Shevchenko State University, Kiev, Ukraine

    A. V. Anisimov

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Coalition Public-Key Cryptosystems. Cybernetics and Systems Analysis 37, 1–12 (2001). https://doi.org/10.1023/A:1016610214445

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016610214445

Search

Navigation