Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 20 papers for “Lightweight Extensible Authentication Protocol”
T. Charles Clancy, Hannes Tschofenig · 2009
This Internet Draft defines an Extensible Authentication Protocol method called EAP Generalized Pre-Shared Key (EAP-GPSK). This method is a lightweight shared-key authentication protocol supporting mutual authentication and key derivation.
Cited by 23
Dhiraj M. Londe, Prof Nitin Chopde · 2015
standard is facing more complicated problem related security thread, which expose legitimated users to increased risk. Therefore, the security in WLAN network is very challenge in authentication. Extensible Authentication Protocol (EAP) is an authentication framework that is frequently used in wireless networks and Point to Point connections. For authentication purpose EAP used different methods to performed authentication. In this paper, we will explain each existing EAP authentication method, show the flow of every one and restriction. That way we will propose new method of authentication: Lightweight Extensible Authentication Protocol-Public Key “EAP-PK”. This method of authentication combines between the simplicity of deployment and management of password method and robustness of certificated ones. We will check the EAP-PA security properties (like security and authentication) by using the specialized model checker AVISPA, which provides formal proofs of the security protocol.
Cited by 0
Ahmed M. El-Nagar, Ahmed Abd Elhafez, Adel Elhnawy · 2011
Wireless Local Area Networks WLAN based on wireless technology, i.e., no physically connection exists. Therefore, security is always a major concern for WLAN development and one of the major problems in WLAN security issue is authentication. EAP (Extensible Authentication Protocol) is a framework of authentication that uses several methods of authentication such as TLS, TTLS, PEAP and LEAP. EAP-LEAP (EAP-Lightweight Extensible Authentication Protocol) is widely used in WLAN (Wi- Fi /802.11 and Wi-MAX/802.16) as solution of authentication problem. This paper presents an assessment to the security of EAP-LEAP in details and explores many weakness points. As a solution to the presented flaws, we present a new proposal EAP- MEAP in details to overcome these shortage points. Finally we present an security assessment to our proposed protocol compared with EAP-LEAP.
Cited by 4
Group T. Clancy · 2006
This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The IETF Trust (2006). Copyright Notice Copyright (C) The Internet Society (2006). This document defines an Extensible Authentication Protocol (EAP) method called EAP-PAX (Password Authenticated eXchange). This method is a lightweight shared-key authentication protocol with optional support for key provisioning, key management, identity protection, and authenticated data exchange.
Cited by 0
V Padmavathi, R Kanimozhi · Research Square · 2023
Abstract The increasing use of mobile devices and wireless networks has led to the development of global mobility networks, which enable users to access services and data from anywhere in the world. However, ensuring the security of these networks is a major challenge, as they are vulnerable to various attacks such as eavesdropping, impersonation, and data tampering. To address this challenge, this paper proposes a secure and lightweight authentication protocol for global mobility networks, based on two established cryptographic techniques: the Extensible Authentication Protocol - Transport Layer Security (EAP-TLS) and the Elliptic Curve Digital Signature Algorithm (ECDSA). The proposed authentication protocol consists of several key steps, including user registration, certificate distribution, mutual authentication, and session key generation. The protocol uses EAP-TLS to establish a secure channel between the client and the server, and ECDSA to provide secure digital signatures and key generation. The use of ECDSA ensures that the protocol is resistant to various attacks, such as replay attacks and man-in-the-middle attacks. Additionally, the use of EAP-TLS provides mutual authentication between the client and the server, preventing impersonation attacks. The proposed authentication protocol is designed to be lightweight and efficient, making it practical for use in resource-constrained environments such as mobile devices and wireless networks. The protocol has been evaluated through simulations, and the results demonstrate that it provides strong security guarantees while also being efficient in terms of computational resources and communication overhead. Overall, the proposed authentication protocol provides a practical solution for ensuring the security of global mobility networks, while also being lightweight and efficient enough to be used in resource-constrained environments.
Cited by 0Open access
Awaneesh Kumar Yadav, Manoj Misra, Pradumn Kumar Pandey et al. · IEEE Transactions on Industrial Informatics · 2022
Several symmetric and asymmetric encryption based authentication protocols have been developed for the wireless local area networks (WLANs). However, recent findings reveal that these protocols are either vulnerable to numerous attacks or computationally expensive. Considering the demerits of these protocols and the necessity to provide enhanced security, a lightweight extensible authentication protocol based authentication protocol for WLAN-connected Internet of Things devices is presented. We conduct an informal and formal security analysis to ensure robustness against the attacks. Furthermore, the empirical performance analysis and comparison show that the proposed protocol outperforms its counterparts, reducing computational, communication, storage costs, and energy consumption by up to 99%, 80%, 91.8%, and 98%, respectively. Simulation results of the protocol using the NS3 and its overhead under unknown attacks demonstrate that the proposed protocol performs better in all scenarios. A prototype implementation of the protocol has also been tested to evaluate its feasibility in real-time applications.
Cited by 55Open access
2016
This chapter discusses the 802.1X authorization framework and the Extensible Authentication Protocol (EAP) that is used for enterprise WLAN security. 802.1X/EAP uses an authentication server to validate the credentials of a WLAN client and then to authorize access for the WLAN to network resources. Lightweight Directory Access Protocol (LDAP) is an application protocol for providing directory services over an IP network. The current version, LDAPv3, is defi ned in IETF RFC 4511. A directory service is an infrastructure used to share information about network resources such as fi les, folders, computers, users, groups, and so on. The authentication server maintains a user database or may proxy with an external user database to authenticate user or device credentials. A RADIUS server reportedly functions as the authentication server in almost all cases. The RADIUS server may hold a master native user database but usually will instead query to a preexisting external database. Remote Authentication Dial-in User Service (RADIUS) is a networking protocol that provides authentication, authorization, and accounting (AAA) capabilities for computers to connect to and use network services. RADIUS authentication and authorization is defined in IETF RFC 2865. Accounting is defined in IETF RFC 2866. RADIUS servers are sometimes referred to as AAA servers. RADIUS was developed back in 1991 as a client or server authentication and accounting protocol.
Cited by 0
Pritam S. Salankar, Vinay Avasthi, Ashutosh Pasricha · International Journal of Information and Computer Security · 2023
The medical data generated from the patients that are communicated and stored on servers are highly sensitive, and also the IoMT network creates open spaces for an adversary. The proposed work designs a lightweight authentication scheme to support the extensible authentication protocol (EAP) called lightweight EAP (L-EAP). The proposed L-EAP modifies the EAP model and dynamically changes the security service as per healthcare application requirements. The L-EAP selectively applies the data encryption and integrity without frequent re-handshaking with the server using one-bit epoch field in the EAP message header. The L-EAP performs such a key generation process as a part of the authentication phase and enlarges the lifetime of the IoMT network. The advanced encryption standard (AES) is improved for providing data confidentiality in L-EAP. The L-EAP improves the confusion property of cipher text in AES and applies shift row and XOR operations to all the words.
Cited by 4
Awaneesh Kumar Yadav, Manoj Misra, Pradumn Kumar Pandey et al. · IEEE Transactions on Dependable and Secure Computing · 2024
The plethora of Internet of Things (IoT) devices and their diversified requirements have opted to design security mechanisms that cover all major security requirements. Wireless Local Area Networks (WLANs) is the most common network domains where IoT devices are launched, particularly because of its easy availability. Security, in other words authentication however, remains to be a major constriction for IoT-WLAN deployments. Though there are IoT based authentication protocols prevailing, such protocols are either prone to threats such as perfect forward secrecy violations, insider with database access attack, traceability attack, stolen device attack, ephemeral secret leakage, or they consume excessive computational and communication resources that result in an unprecedented burden for the IoT system. This paper presents an Extensible Authentication Protocol (EAP) based mechanism for IoT devices deployed in a WLAN that addresses the above security issues and achieves cost-effectiveness. Validation follows an informal and formal approaches (using GNY and BAN logic, and Scyther verification tool) for the proposed protocol, demonstrating its robustness. Our performance analysis shows that the proposed protocol is lightweight and more secure in contrast to the state-of-the-art solutions. In addition, performance of the proposed protocol subjected to unknown attacks is investigated, which deduces that the proposed protocol has less overhead under unknown attacks than its competitors. A prototype of the protocol has been developed to demonstrate its feasibility and accuracy.
Cited by 9
Francisco Lopez-Gomez, Rafael Marín-López, Gabriel López-Millán et al. · Computer Standards & Interfaces · 2025
The Extensible Authentication Protocol (EAP) has been a cornerstone of secure authentication in both wired and wireless networks, as well as enterprise systems, enabling integration with a wide range of authentication mechanisms. Recently, the IETF EAP Method Update (EMU) Working Group has adopted EAP-EDHOC, a method that combines EAP’s extensibility with the recent standard Ephemeral Diffie–Hellman Over COSE (EDHOC). EDHOC is a lightweight authentication and key exchange protocol designed to be supported in resource-constrained environments. This enhances EAP-EDHOC as a high-performance authentication method for EAP-based networks. This paper presents a comprehensive analysis of the standardization efforts surrounding EAP-EDHOC, including a first proof-of-concept implementation and performance evaluation conducted over Wi-Fi networks. Additionally, a new design that optimizes the existing protocol by reversing the roles of the communication parties is proposed. The original and optimized versions are evaluated and compared with each other, as well as with EAP-TLS 1.3 and EAP-PSK. The results demonstrate that EAP-EDHOC achieves more efficient authentication than EAP-TLS 1.3 in terms of execution time, number of messages, and data transmitted. Meanwhile, EAP-PSK, which is based on symmetric cryptography, serves as a performance baseline. • Comprehensive analysis of EAP-EDHOC , providing a detailed explanation of its design and operation. • Proposed optimization for EAP-EDHOC , introducing a new design to enhance its efficiency. • Proof-of-concept implementation and performance evaluation , demonstrating its feasibility and benefits.
Cited by 0Open access
B Adoba, L Blunk, J Vollbrecht et al. · National Sun Yat-sen University Electronic Theses & Dissertations Service (National Sun Yat-sen University)
Authentication protocols are used for two parties to authenticate each other and build a secure channel over wired or wireless public channels.However, the present standards of authentication protocols are either insufficiently secure or inefficient for light weight devices.Therefore, we propose two authentication protocols for improving the security and user efficiency in wired and wireless environments, respectively.Traditionally, TLS/SSL is the standard of authentication and key exchange protocols in wired Internet.It is known that the security of TLS/SSL is not enough due to all sorts of client side attacks.To amend the client side security, multi-factor authentication is an effective solution.However, this solution brings about the issue of biometric privacy which raises public concern of revealing biometric data to an authentication server.Therefore, we propose a truly threefactor authentication protocol, where the authentication server can verify their biometric data without the knowledge of users' templates and samples.In the major wireless technologies, extensible Authentication Protocol (EAP) is an authentication framework widely used in IEEE 802.11WLANs.Authentication mechanisms built on EAP are called EAP methods.The requirements for EAP methods in WLANs authentication have been defined in RFC 4017.To achieve user efficiency and robust security, lightweight computation and forward secrecy, excluded in RFC 4017, are desired in WLAN authentication.However, all EAP methods and authentication protocols designed for WLANs so far do not satisfy all of the above properties.We will present a complete EAP method that utilizes stored secrets and passwords to verify users so that it can (1) meet the requirements of RFC 4017, (2) provide lightweight computation, and (3) allow for forward secrecy.In order to prove our proposed protocols completely, we apply two different models to examine their security properties: Bellare's model, a standard reduction based on computational model, that reduces the security properties to the computationally hard problems and the OFMC/AVISPA tool, a model checking approach based on formal model, that uses the concept of the search tree to systematically find the weaknesses of a protocol.Through adopting Bellare's model and OFMC/AVISPA tool, the security of our work is firmly established.
Cited by 0Open access
M. Abdul Alim · 2008
We present the design of an IPv6 enabled wireless sensor network based on the IEEE 802.15.4 standard for medical monitoring. We design a routing mechanism for efficient flooding, a hop-by-hop error recovery and congestion control mechanism for reliable packet delivery and a lightweight security architecture for the medical monitoring system. We extend the widely used Extensible Authentication Protocol (EAP) to employ the Generalized Pre-shared Key (GPSK) authentication method with some optimizations for securing the system. We use the 3-party EAP model with the Personal Area Network Coordinator (PAN coordinator) of IEEE 802.15.4 standard as the EAP authenticator for authenticating sensor nodes within the radio range of the PAN coordinator. In order to use EAP authentication for a sensor node several hops away from the PAN coordinator, we define a new role (relay authenticator) for its coordinator which tunnels EAP messages to the PAN coordinator securely. We define EAP message encapsulation for IEEE 802.15.4 networks and a key hierarchy for the security architecture. We have simulated the system and shown that EAP based authentication is feasible in wireless sensor networks.
Cited by 1Open access
Adrian Hornsby, Eloi Bail · 2009
This paper deals with a lightweight implementation of the eXtensible Messaging and Presence Protocol (XMPP) protocol for the Contiki operating system, offering a standardized, open, web-service like architecture, as opposed to existing technologies which lack proper open architecture. To achieve our objective, our implementation is based on the Internet Protocol version 6 (IPv6) and XMPP. Until recently IP was thought to be too complicated and power consuming, but with advances in chip integration and software implementation, it becomes a reality. Following the IPv6 standard as the basic underlying networking technology, we also embrace the application protocol XMPP which provides a push-based notification functionality that is especially appropriate for the event-driven paradigm of low power operating systems. XMPP offers functionalities such as short instant messaging, presence, publish-subscribe and also provides the authentication and encryption required for data protection. In this paper, we first introduce the benefits of XMPP for low power wireless sensor network nodes. We then introduce the Contiki operating system and present ¿XMPP, our lightweight implementation of the XMPP protocol and its operation in the Contiki operating system. This architecture is light, flexible, highly functional and open, therefore it is particularly interesting for low power wireless sensor network nodes and other smart devices that will populate the Internet of Things.
Cited by 27
Maysam Alkwiefi, Ala’ Khalifeh · 2024
In this paper we will present a comprehensive comparison of two used Machine-to-Machine (M2M) communication protocols in the Internet of Things (IoT) scenarios: the Lightweight Machine-to-Machine (LwM2M) and the Extensible Messaging and Presence Protocol (XMPP). The discussion will cover their technical overviews, working mechanisms, and comparisons based on several factors such as protocol reliability, security (authentication and encryption), features, pros and cons, message overhead and transmission efficiency, packet size, and connection establishments. The LwM2M protocol is a fast IoT protocol developed by the Open Mobile Alliance (OMA). It is operated with the Constrained Application Protocol (CoAP) and is greatly famous for being utilized in device management and IoT data communication. Some advantages of LwM2M include providing higher efficiency, easy and stable data transfer, and low power consumption, which is beneficial in long-term and complicated IoT applications, thus making it a good candidate for different industries. On the other hand, the XMPP is a flexible, lightweight protocol that can handle CPU-constrained systems. It is primarily used in messaging and was not developed mainly for IoT applicationsLwM2M and XMPP have different purposes, structures, data processing times, transport, features, and IoT systems architecture. As for security, both protocols have high robust security features. Choosing between LwM2M and XMPP for a specific IoT project needs to be studied based on the requirements of the project to achieve the required aims precisely, as many factors must be taken into consideration when deciding which protocol to use.
Cited by 2
Marcin Pawłowski, Antonio J. Jara, Maciej Ogorzałek · Mobile Information Systems · 2015
Internet of Things security is one of the most challenging parts of the domain. Combining strong cryptography and lifelong security with highly constrained devices under conditions of limited energy consumption and no maintenance time is extremely difficult task. This paper presents an approach that combines authentication and bootstrapping protocol (TEPANOM) with Extensible Authentication Protocol (EAP) framework optimized for the IEEE 802.15.4 networks. The solution achieves significant reduction of network resource usage. Additionally, by application of EAP header compacting approach, further network usage savings have been reached. The EAP-TEPANOM solution has achieved substantial reduction of 42% in the number of transferred packets and 35% reduction of the transferred data. By application of EAP header compaction, it has been possible to achieve up to 80% smaller EAP header. That comprises further reduction of transferred data for 3.84% for the EAP-TEPANOM method and 10% for the EAP-TLS-ECDSA based methods. The results have placed the EAP-TEPANOM method as one of the most lightweight EAP methods from ones that have been tested throughout this research, making it feasible for large scale deployments scenarios of IoT.
Cited by 7Open access
Openldap Foundation · 2001
This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The Internet Society (2001). All Rights Reserved. This document describes schema in support of user/password authentication in a LDAP (Lightweight Directory Access Protocol) directory including the authPassword attribute type. This attribute type holds values derived from the user’s password(s) (commonly using cryptographic strength one-way hash). authPassword is intended to used instead of userPassword. 1. Background and Intended Use The userPassword attribute type [RFC2256] is intended to be used to support the LDAP [RFC2251] "simple " bind operation. However, values of userPassword must be clear text passwords. It is often desirable to store values derived from the user’s password(s) instead of actual passwords. The authPassword attribute type is intended to be used to store information used to implement simple password based authentication. The attribute type may be used by LDAP servers to implement the LDAP Bind operation’s "simple " authentication method. The attribute type supports multiple storage schemes. A matching rule is provided for use with extensible search filters to allow clients to assert that a clear text password "matches " one of the attribute’s values. Storage schemes often use cryptographic strength one-way hashing. Though the use of one-way hashing reduces the potential that exposed values will allow unauthorized access to the Directory (unless the Zeilenga Informational [Page 1] RFC 3112 LDAP Authentication Password Schema May 2001 hash algorithm/implementation is flawed), the hashing of passwords is intended to be as an additional layer of protection. It is RECOMMENDED that hashed values be protected as if they were clear text passwords. This attribute may be used in conjunction with server side password generation mechanisms (such as the LDAP Password Modify [RFC3062] extended operation). Access to this attribute may governed by administrative controls such as those which implement password change policies.
Cited by 0
A. Kamalasegaran, G. Kabilan, P. Sriramalakshmi · 2025
Transactive systems are a novel paradigm for managing distributed energy resources and enabling peer-to-peer transactions in smart grids. These systems require efficient and reliable communication protocols to exchange data and signals among different agents and devices. In this chapter, some of the most prominent protocols for transactive systems, such as message queuing telemetry transport (MQTT), constrained application protocol (CoAP), extensible messaging presence protocol (XMPP), advanced message queuing protocol (AMQP), and data distribution service (DDS) are reviewed. The exploration begins with an in-depth analysis of MQTT and CoAP, considering their lightweight nature, asynchronous capabilities, and applicability in transactive systems. This chapter delves into how these protocols foster edge computing paradigms, where data processing occurs closer to the source, reducing latency and enhancing overall system efficiency. Security is a paramount concern in transactive systems, and the study investigates the encryption, authentication, and authorization mechanisms inherent in MQTT, CoAP, and other relevant protocols. This exploration aims to secure sensitive data, guaranteeing the integrity and confidentiality of communications within transactive IoT ecosystems. Real-time communication forms a cornerstone of transactive systems. It navigates through the nuances of each protocol, considering their efficacy and trade-offs in scenarios demanding real-time responsiveness. To provide tangible insights, this chapter incorporates case studies and real-life implementations, showcasing how MQTT, CoAP, and other protocols have been successfully employed in diverse transactive IoT applications. In conclusion, this chapter consolidates its findings, highlighting the pivotal role of communication protocols in the reliability and scalability of transactive systems. It offers practical recommendations for implementing these protocols in real-world applications, providing valuable insights for researchers, practitioners, and industry professionals seeking to optimize communication in transactive IoT deployments. The study also identifies emerging trends that may shape the future evolution of communication protocols in the dynamic landscape of transactive systems.
Cited by 0Open access
Steven Price · Zenodo (CERN European Organization for Nuclear Research) · 2026
ZTLP (Zero Trust Layer Protocol) is an open‑source, identity‑first network overlay that enforces security at the packet layer. It combines a three‑layer DDoS mitigation pipeline (Magic → SessionID → HeaderAuthTag) with a Noise_XX handshake and ChaCha20‑Poly1305 encryption to provide strong mutual authentication, forward secrecy, and replay protection. Key features include: Identity‑First Design – every node must prove its cryptographic identity before being allowed to communicate; unknown identities are silently dropped. Three‑Layer DDoS Defense – a cheap “magic” byte filter, per‑session SessionID accounting, and a cryptographic HeaderAuthTag provide increasingly strict admission control, protecting against volumetric attacks while keeping the happy‑path latency low. Stateless Admission Challenge (SAC) – a lightweight challenge‑response mechanism that throttles new connection attempts once a configurable load threshold is reached, preventing handshake‑storm overloads. Relay Mesh – optional consistent‑hash mesh routing with per‑relay load scoring, enabling horizontal scaling and high‑availability without a central dispatcher. eBPF/XDP Packet Filtering – kernel‑level packet dropper that discards malformed or policy‑rejected traffic in nanoseconds, offloading the BEAM VM from malicious traffic. Extensible Service Namespace (ZTLP‑NS) – a distributed, signed namespace for service discovery, policy enforcement, and revocation, built on Erlang/Elixir ETS/Mnesia for low‑latency lookups. Full‑stack Rust client – a single binary (ztlp) that provides key generation, enrollment, connection establishment, multi‑hop tunneling, and CLI utilities for monitoring and testing. Comprehensive Test Suite – >2 500 automated tests across Rust, Erlang/Elixir, and Docker‑based integration scenarios, achieving 0 % failure rate in CI. The protocol is released under the Apache 2.0 license and targets a wide range of deployment scenarios, from edge IoT gateways to data‑center interconnects. It is intended to complement, rather than replace, existing VPN/IPsec solutions by shifting trust from network perimeters to immutable cryptographic identities.
Cited by 0Open access
Steven Price · Zenodo (CERN European Organization for Nuclear Research) · 2026
ZTLP (Zero Trust Layer Protocol) is an open‑source, identity‑first network overlay that enforces security at the packet layer. It combines a three‑layer DDoS mitigation pipeline (Magic → SessionID → HeaderAuthTag) with a Noise_XX handshake and ChaCha20‑Poly1305 encryption to provide strong mutual authentication, forward secrecy, and replay protection. Key features include: Identity‑First Design – every node must prove its cryptographic identity before being allowed to communicate; unknown identities are silently dropped. Three‑Layer DDoS Defense – a cheap “magic” byte filter, per‑session SessionID accounting, and a cryptographic HeaderAuthTag provide increasingly strict admission control, protecting against volumetric attacks while keeping the happy‑path latency low. Stateless Admission Challenge (SAC) – a lightweight challenge‑response mechanism that throttles new connection attempts once a configurable load threshold is reached, preventing handshake‑storm overloads. Relay Mesh – optional consistent‑hash mesh routing with per‑relay load scoring, enabling horizontal scaling and high‑availability without a central dispatcher. eBPF/XDP Packet Filtering – kernel‑level packet dropper that discards malformed or policy‑rejected traffic in nanoseconds, offloading the BEAM VM from malicious traffic. Extensible Service Namespace (ZTLP‑NS) – a distributed, signed namespace for service discovery, policy enforcement, and revocation, built on Erlang/Elixir ETS/Mnesia for low‑latency lookups. Full‑stack Rust client – a single binary (ztlp) that provides key generation, enrollment, connection establishment, multi‑hop tunneling, and CLI utilities for monitoring and testing. Comprehensive Test Suite – >2 500 automated tests across Rust, Erlang/Elixir, and Docker‑based integration scenarios, achieving 0 % failure rate in CI. The protocol is released under the Apache 2.0 license and targets a wide range of deployment scenarios, from edge IoT gateways to data‑center interconnects. It is intended to complement, rather than replace, existing VPN/IPsec solutions by shifting trust from network perimeters to immutable cryptographic identities.
Cited by 0Open access
Shaoquan Jiang, Tsuyoshi Takagi, Guilin Wang · Security and Communication Networks · 2016
Provable security is an important research area in modern cryptography. Cryptographic primitives or protocols without rigorous proofs cannot be regarded as secure even in practice. In fact, many schemes were originally thought as secure but were broken subsequently. This clearly indicates the necessity of formal security analysis. For real-world applications, provable security provides us with a strong confidence in using cryptographic solutions. For a theoretical study, provable security sometimes provides a clear answer to the (in)feasibility issue of a certain security mechanism. This special issue offers a platform for security researchers and practitioners to exchange their new ideas for studying information systems in provably secure manners. We have included eighteen high-quality papers. Among them, six papers were selected from accepted papers at the 6th International Conference on Provable Security (ProvSec 2012), and the remaining 12 papers were selected from new invited submissions. All of them have gone through stringent reviews in two rounds. Further, any selected paper that has a preliminary version at ProvSec 2012 or somewhere else must have been extensively expanded to include new contributions. The included articles highlight recent advances in provable security by presenting many novel techniques in this area. We now give a short summary of them, through six categories. The first category is public-key encryption (PKE). It considers the formal models, constructions, and analysis of PKE under various security concerns. In the leakage-resiliency model, one considers the security of PKE when a partial secret key has been leaked (e.g., through a side-channel attack). Paper “continual key-leakage tolerant encryption from extensible-set delegation functionality” by Bo Yang and Mingwu Zhang proposes a leakage-resilient functional encryption and shows that its provable security under a continual leakage of the secret key. Motivated by the threat from malware such as RAM scrapers, the paper “stronger public key encryption system withstanding RAM scraper like attacks” by S. Sree Vivek, S. Sharmila Deva Selvi, Akshayaram Srinivasan and C. Pandu Rangan proposes a public-key security notion that is stronger than adaptive chosen-ciphertext (CCA2) security. They show that the traditionally CCA2 secure schemes are no longer secure in the new model. They also propose a new scheme that is provably secure in the new model without a random oracle. The paper “a limitation on security evaluation of cryptographic primitives with fixed keys” by Yutaka Kawai, Goichiro Hanaoka, Kazuo Ohta, and Noboru Kunihiro studies the security of public-key system when the public key is fixed. They have obtained some impossibility results for this setting. A key encapsulation mechanism is an efficient tool to construct a public-key encryption through a paradigm of a hybrid encryption. The paper “efficient key encapsulation mechanisms with tight security reductions to standard assumptions in the two security models” by Yoshikazu Hanatani, Goichiro Hanaoka, Takahiro Matsuda, and Takashi Yamakawa presents two constructions of efficient key encapsulation mechanisms. Their schemes can be proven CCA secure under a strong hardness assumption without random oracle or under a weaker assumption in the random oracle model. A hash proof system is a general cryptographic structure proposed by Cramer-Shoup in Eurotypt 2002 to construct public-key systems. The paper “generalized (identity-based) hash proof system and its applications” by Yu Chen, Zongyang Zhang, Dongdai Lin, and Zhenfu Cao generalizes this concept to admit an anonymity property. They use this generalized structure to propose public-key encryptions with leakage resilience and anonymity. They further study it in the identity-based setting. The second category is searchable encryption. It considers the public key or the symmetric key cryptosystems that allow keywords search over encrypted data. Usually, the search encryption requires a complete match on the keyword during the search. The paper “character-based symmetric searchable encryption and its implementation on mobile devices” by Takanori Suga, Takashi Nishide, and Kouichi Sakurai proposes a scheme that admits a partial keyword match for the search, and their scheme uses a symmetric encryption. They also have implemented the solution over a mobile device. The paper “searchable symmetric encryption capable of searching for an arbitrary string” by Yoshinao Uchide and Noboru Kunihiro further studies the partial keyword match problem and proposes a searchable encryption that admits a search query of an arbitrary string. Their main technique is an oblivious cross tag protocol by Cash et al. at CRYPTO 2013. The third category is a re-encryption. This considers to re-encrypt a ciphertext without using a decryption key. This is to reuse the ciphertext for a certain security or privacy purpose. The paper “strongly average-case secure obfuscation: achieving input privacy and circuit obscurity” by Mingwu Zhang, Yi Mu, Yixin Su, and Xinyi Huang studies the obfuscation for a re-encryption program with strong security such that an attacker, when executing an obfuscated re-encryption program, cannot obtain any information about the private key and the plaintext. Here, an obfuscation is an algorithm that converts a program into another with the same functionality while difficult to understand. An attribute-based encryption is a public-key cryptosystem that classifies a user using attributes such that a user can decrypt a ciphertext if and only if his attribute collection satisfies the desired requirement in the ciphertext. This achieves the access control functionality for the encryption. Attribute-based proxy re-encryption (PRE) is a useful technique for a delegation of access rights to encrypted data, which is useful in a public cloud storage. The paper “verifiable attribute-based proxy re-encryption for secure public cloud data sharing” by Suqing Lin, Rui Zhang, and Mingsheng Wang proposes a generic construction for attribute-based PRE and presents three realizations for it. The paper “on the application of generic CCA-secure transformations to proxy re-encryption” by David Nuñez, Isaac Agudo, and Javier Lopez studies the generic transformation for PRE from weak security to CCA security. For a regular public-key encryption, it is well known that a Fujisaki–Okamoto technique can transform a chosen-plaintext secure scheme into a CCA2 secure scheme. But the authors found out that this does not work for PRE. Instead, they achieve a weak form of CCA security for PRE using a generalized Fujisaki–Okamoto. The paper “proxy re-encryption via indistinguishability obfuscation” by Satsuya Ohata and Kanta Matsuura presents a technique for achieving PRE from obfuscation. Their idea is to carefully modify the public-key encryption scheme of Sahai and Waters at STOC 2014. The fourth category is a digital signature. This studies the models, constructions, and their analysis under various security concerns. A nominative signature is a signature that is generated by a signer A and a user B jointly. When the signature is to be verified by a user C, C will run a disavowal/confirmation protocol with B. The paper “one-move convertible nominative signature in the standard model” by Dennis Y. W. Liu and Duncan S. Wong proposes an efficient nominative signature that is provably secure in the standard model with a constant size of key for any party in the system. A ring signature is a signature, where a signer remains fully anonymous among a group of members (called a ring). The paper “non-interactive deniable ring signature without random oracles” by Shengke Zeng and Qinyi Li considers a variant of a ring signature, where the signer anonymity is conditional in the sense that a signer can confirm the authorship of the signature while a non-signer can disprove the authorship of a signature. They propose a new scheme for this model using the Boneh and Boyen signature and shows its security in the standard model. A blind signature is a special signature that allows one to obtain a signature on a message from a signature without leaking the message to the latter. This primitive has many applications in systems such as e-cash and e-voting schemes. The paper “a lattice based partially blind signature” by Haibo Tian, Fangguo Zhang, and Baodian Wei proposes the first latticed-based blind signature with partial blindness using the technique of Lyubashevsky from EUROCRYPT 2012 and the technique of Abe and Okamoto from CRYPTO 2000. The paper “generic transformations for existentially unforgeable signature schemes in the bounded leakage model” by Yuyu Wang and Keisuke Tanaka studies how to obtain strongly secure digital signatures. They propose two transformations that convert a regular weakly secure signature into a strongly secure signature in the bounded leakage model. The fifth category is a key exchange. A key exchange is a procedure that allows two or more parties to share a secret key securely. The paper “authenticated key exchange with entities from different settings and varied groups” by Yanfei Guo and Zhenfeng Zhang proposes several key exchange protocols with an initiator being identity based and the responder being certificate based. They consider the constructions with an identity-based system from a bilinear group and a prime residue group both. The last category is the symmetric key cryptography. It studies the cryptographic structure that does not use any public-key tool. A lightweight cryptographic primitive is such an example. It only incurs a very small computation cost. A lightweight primitive with provable security has a very important impact in the real world. The paper “two new message authentication codes based on APN functions and stream ciphers” by Teng Wu and Guang Gong proposes two lightweight message authentication codes and quantifies the insecurity upper bounds against a substitution attack. The paper “two-level security for message streams” by Mohsen Alimomeni and Reihaneh Safavi-Naini studies the information theoretic security of a private key encryption. They formalize a new model to quantify the security of many ciphertexts, where they require the message in the most recent ciphertext to be perfectly secure while messages in older ciphertexts have a lower level of security. They propose a non-trivial construction with provable security under their model. We would like to thank editor-in-chiefs Prof. Hsiao-Hwa Chen and Prof. Hamid R. Sharif for agreeing to this special issue and supporting us throughout the process. We also would like to thank all authors who submitted their papers to this special issue and reviewers who spent their precious time on the submissions and provided us with their insights that help us in an essential way to make the decisions.
Cited by 0Open access