Encrypted key exchange: password-based protocols secure against dictionary attacks
04 May 1992-pp 72-84
TL;DR: 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.
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. >
Citations
More filters
Patent•
28 Mar 2014TL;DR: In this paper, a session key can be transmitted by inserting a predetermined number of bytes of the protected session key into each frame of a data stream, for example a telemetry (TM) data stream as defined in the Consultative Committee for Space Data Systems (CCSDS) TM protocol.
Abstract: A satellite system comprises first and second devices, one of the first and second devices being a satellite and the other one of the first and second devices being a device arranged to send signals to the satellite and/or receive signals from the satellite. A session key can be distributed in the satellite system by obtaining the session key at the first device, protecting the session key at the first device, based on a private key of the first device and a public key of the second device, and transmitting the protected session key from the first device to the second device. The second device can receive the protected session key from the first device and obtain the session key from the protected session key based on a public key of the first device and a private key of the second device. Replay detection information can be transmitted with the protected session key, for determining whether the session key has been transmitted previously. The protected session key can be transmitted by inserting a predetermined number of bytes of the protected session key into each frame of a data stream, for example a telemetry (TM) data stream as defined in the Consultative Committee for Space Data Systems (CCSDS) TM protocol. Validity information can be transmitted with the protected session key, defining a period in which the session key is valid. The protected session key can be transmitted bonded to a command message, for example a telecommand (TC) as defined in the CCSDS TC protocol.
4 citations
22 Jan 2010
TL;DR: In this paper, the authors presented a survey of all currently available password based authentication schemes and classified them in terms of several crucial criteria, which will help in developing different password-based authentication techniques, which are not vulnerable to different attack scenarios.
Abstract: Password is the most commonly used technique for user authentication due to its simplicity and convenience. The main advantage of passwords is that users can memorize them easily without needing any hardware to store them. Efficient password authentication schemes are required to authenticate the legitimacy of remote users over an insecure communication channel. In this paper, we presented the survey of all currently available password based authentication schemes and classified them in terms of several crucial criteria. This study will help in developing different password based authentication techniques, which are not vulnerable to different attack scenarios. Two and three party key exchange protocols require secure authentication mechanism for achieving the required goals and satisfying the security requirements of an ideal password based authentication scheme. Smart cards, which are used in financial transactions require highly secure authentication protocols.
4 citations
20 Apr 2018
TL;DR: A multilayer protocol using Password Authenticated Key Exchange by Juggling (J-PAKE) combined with Elliptic Curve Cryptography (ECC) is presented whichoretical analysis suggests is more secure than previous attempts and offers reduced communication and computation cost.
Abstract: Traditional utility network is gradually transforming into Smart Grid (SG) network to better address the challenges in energy supply and demand gap. SG offers bidirectional communication and bidirectional energy flow. Authenticated access of customers’ information is one of the research challenge in SG. Some attempts have been made by various research groups in the direction of password based authentication protocols to address the security challenges in SG. This paper presents a multilayer protocol using Password Authenticated Key Exchange by Juggling (J-PAKE) combined with Elliptic Curve Cryptography (ECC). Performance is compared with previous Password Authenticated Key Exchange based solutions. Theoretical analysis suggests that the proposed protocol is more secure than previous attempts and offers reduced communication and computation cost as compared to J-PAKE.
4 citations
4 citations
23 Mar 2017
TL;DR: This paper estimates the communication energy consumption for homogeneous wireless sensor security using DH-EKE public key agreement scheme in terms of variable key sizes and neighbor nodes to help the low power cryptographic system designers to be exposed for larger alterable schemes with variable techniques.
Abstract: The continuous demand of wireless sensor networks to operate critical and sensitive environmental, healthcare and industrial data raised the need for effective security mechanisms. However, the inherent energy constraints in the sensor nodes pose different challenges in the security of wireless sensor networks. Many researchers have studied the energy consumption required by these sensor nodes through applying different security schemes. In this paper, we estimate the communication energy consumption for homogeneous wireless sensor security using DH-EKE public key agreement scheme in terms of variable key sizes and neighbor nodes. The evaluation results demonstrated that the energy consumption of DH-EKE ranges from 4.8 μj for 8-bit key size and one neighbor node to 1538 μj (1.6 mj) for 256-bit key size and 10 neighbor nodes Hence, the proposed work will help the low power cryptographic system designers to be exposed for larger alterable schemes with variable techniques.
4 citations
Cites methods from "Encrypted key exchange: password-ba..."
...In related context, we will study the energy efficiency metric of WSN security based Encrypted Key Exchange (EKE) scheme [16]....
[...]
...The summary of DH-EKE algorithm [16, 17] is given below along with the illustrated in figure 2....
[...]
...Encrypted Key Exchange (EKE), also called password authenticated key exchange (PAKE) [16]; is a method to setup an authenticated communication in which two or more parties who agreed on pre-determined password are contributing to establish a shared cryptographic key using an message exchanges of by deriving one private symmetric shared key that is used....
[...]
References
More filters
TL;DR: 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.
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.
14,980 citations
"Encrypted key exchange: password-ba..." refers background or methods in this paper
...ElGamal’s algorithm is derived from the DiffieHellman exponential key exchange protocol[2]; accordingly, we will review the latter first....
[...]
...And even this risk is minimal if B performs certain checks to guard against easily-solvable choices: that β is indeed prime, that it is large enough (and hence not susceptible to precalculation of tables), that β − 1 have at least one large prime factor (to guard against Pohlig and Hellman’s algorithm[13]), and that α is a primitive root of GF (β)....
[...]
...The use given above for asymmetric encryption — simply using it to pass a key for a symmetric encryption system — is an example of what Diffie and Hellman[2] call a public key distribution system....
[...]
...It works especially well with exponential key exchange [2]....
[...]
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Abstract: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n.
14,659 citations
"Encrypted key exchange: password-ba..." refers methods in this paper
...Section 2 describes the asymmetric cryptosystem variant and implementations using RSA[ 3 ] and ElGamal[4]....
[...]
...We will use RSA[ 3 ] to illustrate the difficulties....
[...]
23 Aug 1985
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Abstract: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
7,514 citations
19 Aug 1984
TL;DR: In this article, a new signature scheme is proposed together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem and the security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
Abstract: A new signature scheme is proposed together with an implementation of the Diffie - Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
2,351 citations
Book•
01 Jan 1982TL;DR: The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks.
Abstract: From the Preface (See Front Matter for full Preface)
Electronic computers have evolved from exiguous experimental enterprises in the 1940s to prolific practical data processing systems in the 1980s. As we have come to rely on these systems to process and store data, we have also come to wonder about their ability to protect valuable data.
Data security is the science and study of methods of protecting data in computer and communication systems from unauthorized disclosure and modification. The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks. The book is for students and professionals seeking an introduction to these principles. There are many references for those who would like to study specific topics further.
Data security has evolved rapidly since 1975. We have seen exciting developments in cryptography: public-key encryption, digital signatures, the Data Encryption Standard (DES), key safeguarding schemes, and key distribution protocols. We have developed techniques for verifying that programs do not leak confidential data, or transmit classified data to users with lower security clearances. We have found new controls for protecting data in statistical databases--and new methods of attacking these databases. We have come to a better understanding of the theoretical and practical limitations to security.
1,937 citations
"Encrypted key exchange: password-ba..." refers background in this paper
...Can such a random odd number less than a known n be distinguished from a valid public key e? Assume that p and q are chosen to be of the form 2p′ + 1 and 2q′ + 1, where p′ and q′ are primes, a choice that is recommended for other reasons [9]....
[...]