scispace - formally typeset
Topic

Key exchange

About: Key exchange is a(n) research topic. Over the lifetime, 4693 publication(s) have been published within this topic receiving 105620 citation(s). The topic is also known as: key distribution & key negotiation.

...read more

Papers
  More

Journal ArticleDOI: 10.1109/TIT.1976.1055638
Whitfield Diffie1, Martin E. Hellman1Institutions (1)
Abstract: Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.

...read more

Topics: Financial cryptography (60%), Strong cryptography (59%), Key exchange (58%) ...read more

14,068 Citations


Open accessProceedings ArticleDOI: 10.1109/RISP.1992.213269
Steven M. Bellovin1, Michael Merritt1Institutions (1)
04 May 1992-
Abstract: Classic cryptographic protocols based on user-chosen keys allow an attacker to mount password-guessing attacks. A combination of asymmetric (public-key) and symmetric (secret-key) cryptography that allow two parties sharing a common password to exchange confidential and authenticated information over an insecure network is introduced. In particular, a protocol relying on the counter-intuitive motion of using a secret key to encrypt a public key is presented. Such protocols are secure against active attacks, and have the property that the password is protected against offline dictionary attacks. >

...read more

Topics: Salt (cryptography) (71%), Zero-knowledge password proof (69%), Password strength (68%) ...read more

1,523 Citations


Open accessBook ChapterDOI: 10.1007/3-540-44987-6_28
Ran Canetti1, Hugo Krawczyk2Institutions (2)
06 May 2001-
Abstract: We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys some important analytical benefits: (i) any key-exchange protocol that satisfies the security definition can be composed with symmetric encryption and authentication functions to provide provably secure communication channels (as defined here); and (ii) the definition allows for simple modular proofs of security: one can design and prove security of key-exchange protocols in an idealized model where the communication links are perfectly authenticated, and then translate them using general tools to obtain security in the realistic setting of adversary-controlled links. We exemplify the usability of our results by applying them to obtain the proof of two classes of key-exchange protocols, Diffie-Hellman and key-transport, authenticated via symmetric or asymmetric techniques.

...read more

Topics: Security association (62%), Authenticated Key Exchange (58%), Secure communication (56%) ...read more

1,386 Citations


Open accessBook ChapterDOI: 10.1007/BFB0054122
31 May 1998-
Abstract: First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]) We give a definition of protocol divertibility that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta's definition in the case of interactive zero-knowledge proofs Other important examples falling under the new definition are blind signature protocols We propose a sufficiency criterion for divertibility that is satisfied by many existing protocols and which, surprisingly, generalizes to cover several protocols not normally associated with divertibility (eg, Diffie-Hellman key exchange) Next, we introduce atomic proxy cryptography, in which an atomic proxy function, in conjunction with a public proxy key, converts ciphertexts (messages or signatures) for one key into ciphertexts for another Proxy keys, once generated, may be made public and proxy functions applied in untrusted environments We present atomic proxy functions for discrete-log-based encryption, identification, and signature schemes It is not clear whether atomic proxy functions exist in general for all public-key cryptosystems Finally, we discuss the relationship between divertibility and proxy cryptography

...read more

Topics: Proxy re-encryption (68%), Proxy (statistics) (59%), Blind signature (56%) ...read more

1,377 Citations


Patent
25 Mar 2002-
Abstract: A system and method for communicating information between a first party and a second party, comprising the steps of receiving, by an intermediary, an identifier of desired information and accounting information for a transaction involving the information from the first party, transmitting an identifier of the first party to the second party, and negotiating, by the intermediary, a comprehension function for obscuring at least a portion of the information communicated between the first party and the second party. The data transmission may be made secure with respect to the intermediary by providing an asymmetric key or direct key exchange for encryption of the communication between the first and second party. The data transmission may be made secure with respect to the second party by maintaining the information in encrypted format at the second party, with the decryption key held only by the intermediary, and transmitting a secure composite of the decryption key and a new encryption key to the second party for transcoding of the data record, and providing the new decryption key to the first party, so that the information transmitted to the first party can be comprehended by it.

...read more

Topics: Trusted third party (63%), Key (cryptography) (52%), Public-key cryptography (52%) ...read more

1,193 Citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
2021180
2020223
2019261
2018258
2017247

Top Attributes

Show by:

Topic's top 5 most impactful authors

Laszlo B. Kish

39 papers, 629 citations

David Pointcheval

31 papers, 1.7K citations

Colin Boyd

28 papers, 728 citations

Hugo Krawczyk

21 papers, 3.4K citations

Dongho Won

21 papers, 223 citations

Network Information
Related Topics (5)
Public-key cryptography

27.2K papers, 547.7K citations

94% related
Cryptography

37.3K papers, 854.5K citations

94% related
Block cipher

7.2K papers, 163.5K citations

93% related
Cryptographic primitive

6.4K papers, 170.1K citations

92% related
Cryptanalysis

4.4K papers, 85.8K citations

92% related