In a recent paper, Chang and Le proposed an efficient smart card–based authenticated key exchange protocol (which is referred to as CL scheme) for heterogeneous ad hoc wireless sensor networks. How...

https://journals.sagepub.com/doi/pdf/10.1177/1550147718756311

On the security of a provably secure, efficient, and flexible authentication scheme for ad hoc wireless sensor networks:

We propose two security models for one-round group key exchange (ORGKE), which are called as g-eCKw and g-eCK-PFS. The g-eCK-PFS is a stronger variant of g- eCKw, which particularly formulates perfect forward se- crecy for ORGKE. A new tripartite ORGKE is proposed to provide g-eCKw security without random oracles under standard assumptions, that is also more e_cient than its predecessor by Li and Yang on CANS'13. We also show how to transform (compile) a g-eCKw secure protocol to achieve g-eCK-PFS security. In particular, our result enables us to prove the security of the first ORGKE protocol that achieves perfect forward secrecy without random oracles in a strong security model allowing adversary to compromise critical information of session participants such as long-term or ephemeral private key.

/pdf/towards-modelling-perfect-forward-secrecy-for-one-round-2rpy8qv2kq.pdf

Towards Modelling Perfect Forward Secrecy for One-round Group Key Exchange.

Security protocols are building blocks in secure communications. They deploy some security mechanisms to provide certain security services. Security protocols are considered abstract when analyzed, but they can have extra vulnerabilities when implemented. This manuscript provides a holistic study on security protocols. It reviews foundations of security protocols, taxonomy of attacks on security protocols and their implementations, and different methods and models for security analysis of protocols. Specifically, it clarifies differences between information-theoretic and computational security, and computational and symbolic models. Furthermore, a survey on computational security models for authenticated key exchange (AKE) and password-authenticated key exchange (PAKE) protocols, as the most important and well-studied type of security protocols, is provided.

Security protocols in a nutshell.

Simpler Generic Constructions for Strongly Secure One-round Key Exchange from Weaker Assumptions

We introduce a new lightweight generic compiler that is able to transform any passively forward secure twomessage key exchange (KE) protocols into authenticated key exchange (AKE) protocols with security in the presence of active adversaries who can reveal critical session specific information such as long-term or ephemeral secrets and can establish malicious parties. The compiler is built based on a new security notion regarding noninteractive key exchange with auxiliary input (NIKEA). The NIKEA is able to provide two security properties on the confidentiality and the unforgeability of shared key. Our new compiler is a very useful tool for the design of new AKE protocols in a modular and efficient way, that is suitable for resources constrained devices.

/pdf/a-lightweight-generic-compiler-for-authenticated-key-1d29jke2sr.pdf

A Lightweight Generic Compiler for Authenticated Key Exchange from Non-interactive Key Exchange with Auxiliary Input.

We examine the recently introduced CF and CF-perfect forward secrecy PFS models for two-message authenticated key exchange TMAKE by Cremers et al., where the difference between CF and CF-PFS model is that the CF formulates the weak PFS wPFS, whereas the CF-PFS formulates the PFS. The CF model is claimed by Cremers et al. to be strictly stronger the previous extended Canetti-Krawczyk eCK model. However, we notice that the implication relations among CF, CF-PFS, eCK and eCK-PFS model have not been completely studied. Based on TMAKE, we particularly show that CF model and eCK model imply each other under random oracle model. Moreover, we provide a new result on the generic security strengthening transformation compiler for building CF-PFS-secure TMAKE protocols. In contrast to a previous work, we show that it is possible to apply the transformation to all CF-secure AKE protocols including all eCK-secure TMAKE protocols in the random oracle model, without restricting to a small specific class of Diffie-Hellman key based protocols. Copyright © 2015 John Wiley & Sons, Ltd.

Towards modelling perfect forward secrecy in two-message authenticated key exchange under ephemeral-key revelation

Most recently, a variant of extended Canetti-Krawczyk model called as eCKw is introduced to provide stronger security than previous eCK models. Namely eCKw models formulate a stronger notion regarding weak perfect forward secrecy than other eCK models. In particular, any eCKw secure protocols can be generally transformed to achieve full provide perfect forward secrecy without requiring additional round. So far, there is no protocol which has been proven secure in the eCKw model without random oracles. In this paper, we study the open problem on constructing eCKw secure AKE protocol in the standard model. A new one-round AKE protocol is introduced relying on standard cryptographic primitives and a variant of bilinear decisional Diffie-Hellman assumption. The main advantage of our proposal is its high efficiency in key exchange in contrast to the previous eCK secure protocols without random oracles and under post-specified peer setting. Copyright © 2014 John Wiley & Sons, Ltd.

A practical strongly secure one-round authenticated key exchange protocol without random oracles

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Wu Yang

Author Tools

Chat about Author

Papers

Towards modelling perfect forward secrecy in two-message authenticated key exchange under ephemeral-key revelation

A practical strongly secure one-round authenticated key exchange protocol without random oracles