Key Exchange Research Papers - Academia.edu (original) (raw)

• Top Papers

• Most Cited Papers

• Most Downloaded Papers

• Newest Papers

• People

• • by
  • •
  • Digital Signature, Information Security and Assurance, Java Card, Public key cryptography
• • by John Hagopian
  • •
  • Game Theory, Quantum Cryptography, Quantum Communications, Long-baseline optical interferometry
• • by Jason Hong
  • •
  • Machine Learning, Linear Logic, DoS Attack, Intrusion Detection
• • by Refik Molva
  • •
  • Engineering, Computer Science, Technology, Network Security
• • by Enrico Del Re
  • •
  • Computer Science, Distributed Computing, A Priori Knowledge, Common Knowledge
• • by Ahmed Y. Mahmoud
  • •
  • Cryptography, Frequency, Throughput, Public key cryptography
• • by Xiaotie Deng
  • •
  • Distributed Computing, Security Requirements, Provable Security, Smart Card
• • by Pramode Verma
  • •
  • Distributed Computing, Cryptography, Quantum Cryptography, Future Internet
• • by Mercedes Rivolta and +1
  • •
  • Marketing, Public Administration, Privacy, Manufacturing
• • by Hadi Otrok
  • •
  • Computer Security, Cryptography, Wireless networks, Mobile Computing
• • by Bilal Khan
  • •
  • Group Theory, Non-commutative Geometry, Public key cryptography, Decision Problem
• • by Ian Chai and +1
  • •
  • Computer Applications, Key Exchange, Authentication Protocol
• • by Jayaprakash Kar
  • •
  • Secure Communication, Key Exchange, Authenticated Key Exchange, Discrete Logarithm
• • by Anupam Datta
  • •
  • Rule Based Fuzzy Inference, Key Exchange
• • by Herve Chabanne
  • •
  • Privacy, Elliptic curves, IT Security, Elliptic Curve Cryptography
• • by Benjamin Fine
  • •
  • Number Theory, Applied Mathematics, Group Theory, Diffie-Hellman-DSA

The paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise the... more

The paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise
the secrecy of session key. In this protocol, each group establishes connection by communicating through a trusted third party. The trusted party acts as a group controller generates a public key and broadcasts it among the groups. Each group generate their public keys and send to trusted party. After receiving all the keys the group controller shares it among all the parties to generate the session key. Similarly, each group manager of individual group communicates with the members of the corresponding group. The security of the proposed scheme is analysed rigorously and proved to be resistant against non-repudiation attack, replay attack, chosen cipher attack, man-in-the middle attack. The scheme has wider applications such as, sending encrypted e-mail in a military environment to multiple users, securing submitted bids information in online tender, contract signing by many organizations, etc.

• • by Susmita Mandal
  • •
  • Cryptography, J2ME, Electronic Payments, Smart Cards

We present the SIGMA family of key-exchange protocols and the “SIGn-and-MAc” approach to authenticated Diffie-Hellman underlying its design. The SIGMA protocols provide perfect forward secrecy via a Diffie-Hellman exchange authenticated... more

We present the SIGMA family of key-exchange protocols and the “SIGn-and-MAc” approach to authenticated Diffie-Hellman underlying its design. The SIGMA protocols provide perfect forward secrecy via a Diffie-Hellman exchange authenticated with digital signatures, and are specifically designed to ensure sound cryptographic key exchange while providing a variety of features and trade-offs required in practical scenarios (such as optional identity protection and reduced number of protocol rounds). As a consequence, the SIGMA protocols are very well suited for use in actual applications and for standardized key exchange. In particular, SIGMA serves as the cryptographic basis for the signature-based modes of the standardized Internet Key Exchange (IKE) protocol (versions 1 and 2). This paper describes the design rationale behind the SIGMA approach and protocols, and points out to many subtleties surrounding the design of secure key-exchange protocols in general, and identity-protecting protocols in particular. We motivate the design of SIGMA by comparing it to other protocols, most notable the STS protocol and its variants. In particular, it is shown how SIGMA solves some of the security shortcomings found in previous protocols.

• • by Phil Menezes
  • •
  • Digital Signature, Crypto, Design Rationale, perfect forward secrecy (PFS)
• • by Sebastian Gajek and +1
  • •
  • Provable Security, Security Analysis, Secure Communication, Channel model

We describe Just Fast Keying (JFK), a new key-exchange protocol, primarily designed for use in the IP security architecture. It is simple, efficient, and secure; we sketch a proof of the latter property. JFK also has a number of novel... more

We describe Just Fast Keying (JFK), a new key-exchange protocol, primarily designed for use in the IP security architecture. It is simple, efficient, and secure; we sketch a proof of the latter property. JFK also has a number of novel engineering parameters that permit a variety of tradeoffs, most notably the ability to balance the need for perfect forward secrecy against susceptibility to denial-of-service attacks.

• • by Ran Canetti
  • •
  • Information Systems, Computer Science, Distributed Denial of Service Attack, Cryptography
• • by Stefan Rass
  • •
  • Quantum Cryptography, Quantum Key Distribution, Public key cryptography, Cryptographic Protocols
• • by Zeng-Bing Chen
  • •
  • Quantum Optics, Telecommunications, Computer Aided Design, Quantum Theory
• • by Hazem Abbas
  • •
  • Neural Networks, Synchronization, Cryptography, Neural Network
• • by D. Catalano
  • •
  • Graphical Password Authentication, Group Key Exchange, Key Exchange, Group Key Agreement
• • by Peter Landrock
  • •
  • Pure Mathematics, Cryptology, Zero-Knowledge Proofs, Chip
• • by Michael John Jacobson, Jr.
  • •
  • Hyperelliptic Curve, Key Exchange
• • by Adam Smith
  • •
  • Modeling, Biometrics, User Interface, Cryptography

The IEEE 802.15.4 specification is a recent low data rate wireless personal area network standard. While basic security services are provided for, there is a lack of more advanced techniques which are indispensable in modern personal area... more

The IEEE 802.15.4 specification is a recent low data rate wireless personal area network standard. While basic security services are provided for, there is a lack of more advanced techniques which are indispensable in modern personal area network applications. In addition, performance implications of those services are not known. In this paper, we describe a secure data exchange protocol based

• • by Moazzam Khan
  • •
  • Data Exchange, Link Layer, Mobile Sensor Networks, Key Exchange
• • by Refik Molva
  • •
  • Engineering, Computer Science, Technology, Network Security
• • by Michael John Jacobson, Jr.
  • •
  • Public key cryptography, Integer Factorization, Key Exchange, Discrete Logarithm
• • by Dilip T Rathod
  • •
  • Neural Network, Numerical Simulation, Signal acquisition, Key Exchange

The article describes modular exponent calculations used widely in cryptographic key exchange protocols. The measures for hardware consumption and execution speed based on argument bit width and algorithm rank are created. The... more

The article describes modular exponent calculations used widely in cryptographic key exchange protocols. The measures for hardware consumption and execution speed based on argument bit width and algorithm rank are created. The partitioning of calculations is analyzed with respect to interconnect signal numbers and added delay. The partitioned blocks are used for implementation approximations of two different multiplier architectures. Examples are provided for 3 families of FPGAs: XC4000, XC6200 and FLEX10k

• • by Kalle Tammemae
  • •
  • Key Exchange
• • by Minghui Shi
  • •
  • Distributed Computing, Computational Complexity, Networking, Mobile Network
• • by Leandro Tortosa and +1
  • •
  • Mathematical Sciences, Non-Commutative Ring Theory, Prime Number, Key Exchange
• • by Xiaotie Deng
  • •
  • Distributed Computing, Privacy, Synchronization, Vulnerability

Control signaling messages in Mobile IPv6 are mainly used to inform the home agent (HA) and the correspondent node (CN) about the mobile node's (MN's) new address when its network at- tachment point is changed. In order to prevent... more

Control signaling messages in Mobile IPv6 are mainly used to inform the home agent (HA) and the correspondent node (CN) about the mobile node's (MN's) new address when its network at- tachment point is changed. In order to prevent various security attacks, these messages must be protected. In the current standard, the control sig naling messages between a HA and

• • by Timo Karvi
  • •
  • Network Security, Mobile Network, Elliptic Curve Cryptography, Identity based Encryption
• • by Sin-Ban Ho
  • •
  • Computer Science, Information Security, Network Security, Malware Analysis
• • by Gerhard Rosenberger
  • •
  • Number Theory, Applied Mathematics, Group Theory, Diffie-Hellman-DSA
• • by Jonathan Blackledge
  • •
  • Time Series, Encryption, Numerical Method, Pseudo-Random Number Generator

SMS now becomes such a need for cellular phone users to communicate to other people. But the cellular phone users do not realize that the sent messages could be intercepted or changed by an unwanted party. Therefore it requires a security... more

SMS now becomes such a need for cellular phone users to communicate to other people. But the cellular phone users do not realize that the sent messages could be intercepted or changed by an unwanted party. Therefore it requires a security in sending an SMS message which is called cryptography. Given limited resources on cellular phone, then the implementation of symmetric cryptographic technique is suitable to meet the security needs of an SMS message. In symmetric cryptography, there is a symmetric key for encryption and decryption process. In order to secure exchange of symmetric keys in public channels is required of a protocol for key exchange. This research implements RC4 symmetric cryptography to encrypt and decrypt messages, while for key exchange is using Diffie-Hellman protocol. In this research, there are modifications to the Diffie-Hellman protocol that is the calculation of the public key and symmetric key to include cellular phone number as authentication. Whereas on a modified RC4 is the key where there is a combination with cellular phone number as authentication and key randomization, and then there are also modifications to the pseudorandom byte generator, encryption and decryption of the RC4 algorithm. The system is constructed using the Java programming language in the platform Micro Edition (J2ME) based MIDP 2.0 and CLDC 1.0. The research found that with the cellular phone number as authentication, key, encryption and decryption process automatically it is able to maintain confidentiality, data integrity, authentication and non-repudiation to the message.

• • by Decky Hendarsyah
  • •
  • Cryptography, Symmetric cryptography, RC4 algorithm, Key Exchange
• • by Zulfikar Ramzan
  • •
  • Cryptography, Authentication, Provable Security, Password
• • by Juan Garay
  • •
  • Distributed Computing, New Technology, Wireless Network, Wireless Technology
• • by Xiaoming Fu
  • •
  • Key Management, Performance Improvement, Performance Comparison, Performance Measure
• • by Randal Burns
  • •
  • Computer Hardware, Electrical And Electronic Engineering, Network Attached Storage, Key Exchange
• • by Jonathan Katz
  • •
  • Pure Mathematics, Cryptology, Standard Model, Random Oracle Model

In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages exchanged between them. U may also want to travel anonymously... more

In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages exchanged between them. U may also want to travel anonymously so that no one including V can find out its identity or trace its whereabouts except

• • by Xiaotie Deng
  • •
  • IT Security, Formal Model, Privacy Preservation, Key Establishment

Over the past few years, much research attention has been afforded to the application of remote patient monitoring using embedded mobile devices. However, relatively little research has been done to investigate the security aspects of... more

Over the past few years, much research attention has been afforded to the application of remote patient monitoring using embedded mobile devices. However, relatively little research has been done to investigate the security aspects of such scenarios. The present work describes the implementation of a cryptographic algorithm based on elliptic curves on an embedded mobile device useful for healthcare purposes. A personal digital assistant (PDA) has been chosen to be the hardware platform for the implementation as it is particularly suitable for remote patient monitoring applications. The motivation for this paper was to formulate a secure protocol which comprises of signature, encryption and authentication (SEA) as a combined ingredient of secure remote patient monitoring application using mobile devices. This needed to be easy to use and computationally efficient in order to be acceptable to both clinicians and patients and the results indicate a positive outcome.

• • by Stephen Gardner
  • •
  • Cryptography, Power Analysis, Software Implementation, Patient Monitoring
• • by Y. Mu
  • •
  • Computers Security, Key Exchange

C. Boyd and JM González Nieto (Eds.): ACISP 2005, LNCS 3574, pp. 481-493, 2005.  Springer-Verlag Berlin Heidelberg 2005 ... Analysis of the HIP Base Exchange Protocol ... Tuomas Aura1, Aarthi Nagarajan2, and Andrei Gurtov3 ... 1... more

C. Boyd and JM González Nieto (Eds.): ACISP 2005, LNCS 3574, pp. 481-493, 2005.  Springer-Verlag Berlin Heidelberg 2005 ... Analysis of the HIP Base Exchange Protocol ... Tuomas Aura1, Aarthi Nagarajan2, and Andrei Gurtov3 ... 1 Microsoft Research, Cambridge, ...

• • by Andrei Gurtov
  • •
  • Public Key Infrastructure, Internet Security, DoS Attack, Internet Routing Protocol
• • by Christian Gehrmann
  • •
  • Cryptography, Communication Networks, Authentication, Ad Hoc Networks