# Multiuser cryptographic techniques

@inproceedings{Diffie1976MultiuserCT, title={Multiuser cryptographic techniques}, author={Whitfield Diffie and Martin E. Hellman}, booktitle={AFIPS '76}, year={1976} }

This paper deals with new problems which arise in the application of cryptography to computer communication systems with large numbers of users. Foremost among these is the key distribution problem. We suggest two techniques for dealing with this problem. The first employs current technology and requires subversion of several separate key distribution nodes to compromise the system's security. Its disadvantage is a high overhead for single message connections. The second technique is still in…

## 258 Citations

The Internet public key infrastructure

- Computer Science, MathematicsIBM Syst. J.
- 2001

The details of the Internet public key infrastructure, which provides the secure digital certification required to establish a network of trust for public commerce, are explored.

Survey on Symmetric and Asymmetric Key Cryptosystems

- Computer Science, Mathematics
- 2014

The two most important categories of techniques symmetric and asymmetric cryptosystems are discussed, which are widely in use today in a varieties of applications.

The History of Non-Secret Encryption

- Computer ScienceCryptologia
- 1999

Two of the most important techniques in public-key cryptography are the Diffie-Hellman key exchange protocol and the RSA encryption system. These were discovered in the academic community in 1976 and…

Oti the Security of Public Key Protocols

- Computer Science
- 1998

Several models in which the security of protocols can be discussed precisely are formulated, in which algorithms and characterizations that can be used to determine protocol security in these models will be given.

On the security of public key protocols

- Computer Science22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
- 1981

Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.

STUDY OF CRYPTOLOGY AND ITS FORMS IN TODAY’S SECURE WORLD

- Computer Science, Mathematics
- 2017

The study of different encryption schemes and its usage along with different key management techniques and the application of digital signature with its complete operational principle that is used in daily life as a part of secure communication are reviewed.

Encryption and Secure Computer Networks

- Computer ScienceCSUR
- 1979

Key management, network encryption protocols, digital signatures, and the utility of conventional or public-key encryptlon methods are each discussed.

Enhanced Authenticated Encryption Scheme

- Computer Science
- 2015

A new scheme for encryption and authentication of the encrypted message, where a random number is generated in each encryption process, which proves its strength against cryptanalysis.

Use of Various Algorithms For Cryptosystem

- Computer Science, Mathematics
- 2013

The idea of information security lead to the evolution of Cryptography, which involves encryption and decryption of messages and provides Authentication, Integrity and Non-repudiation.

New directions in cryptography

- Computer Science, MathematicsIEEE Trans. Inf. Theory
- 1976

This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.

## References

SHOWING 1-5 OF 5 REFERENCES

New directions in cryptography

- Computer Science, MathematicsIEEE Trans. Inf. Theory
- 1976

This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.

A high security log-in procedure

- Computer ScienceCACM
- 1974

It is suggested that for the protection of time sharing systems from unauthorized users polynomials over a prime modulus are superior to one-way ciphers derived from Shannon codes.

A user authentication scheme not requiring secrecy in the computer

- Computer ScienceCACM
- 1974

A password scheme is presented which does not require secrecy in the computer and is based on using a function H which the would-be intruder is unable to invert.

ON DISTRIBUTED COMMUNICATIONS: IX. SECURITY, SECRECY, AND TAMPER-FREE CONSIDERATIONS,

- Computer Science
- 1964

The premise that the existence of ''spies'' within the supposedly secure system must be anticipated is evaluated, and the safeguards to be built into the network are described.