E-MACs: Toward More Secure and More Efficient Constructions of Secure Channels

2014 ◽  
Vol 63 (1) ◽  
pp. 204-217 ◽  
Author(s):  
Basel Alomair ◽  
Radha Poovendran
Keyword(s):  
2019 ◽  
Vol 17 (11) ◽  
pp. 1831-1842
Author(s):  
Hector Caballero Hernandez ◽  
Vianney Munoz Jimenez ◽  
Marco Antonio Ramos-Corchado ◽  
Alicia Morales-Reyes ◽  
Marcelo Romero-Huertas

Author(s):  
Gene Itkis ◽  
Robert McNerney ◽  
Scott Russell
Keyword(s):  

2001 ◽  
Vol 8 (47) ◽  
Author(s):  
Jesper Buus Nielsen

The non-committing encryption problem arises in the setting of adaptively secure cryptographic protocols, as the task of implementing secure channels. We prove that in the random oracle model, where the parties have oracle access to a uniformly random function, non-committing encryption can be implemented efficiently using any trapdoor permutation.<br /> <br />We also prove that no matter how the oracle is instantiated in practice the resulting scheme will never be non-committing, and we give a short discussion of the random oracle model in light of this.


Author(s):  
Amit Kumar ◽  
Hari Om

Wireless local area networks (WLANs), like IEEE 802.11, are right now very common in numerous outdoor or indoor environments for providing wireless communication among WiFi-enabled devices by accessing an Access Point (infrastructure mode) or through peer to peer connections (ad hoc mode). Authentication is one among the most primary research challenges for the realization of the envisioned mobile and wireless Internet. This is mainly due to the latency delay introduced during the authentication process, which are of major concern for real-time applications and media streaming application. In the same way, it is also crucial for WLANs to authenticate clients and build secure channels with them. In the historical researches, the traditional authentication mechanisms frequently adopted the names and passwords of clients as login authentication. However, these Single Factor Authentication mechanisms are proved to be defective. In virtue of enhancing security, recent researches on authentication are built on Two-Factor authentication schemes. In this paper, the authors proposed a two factor, lightweight RFID authentication scheme based on elliptic curve cryptography (ECC) for WLAN. The analytic comparison demonstrates the research not just reduces the expense of proposed authentication schemes, yet gives security similarly as smart card technology. In addition, the performance of the proposed authentication scheme will analyze in terms of computational cost, communications cost, and storage cost.


Author(s):  
Christina Brzuska ◽  
Håkon Jacobsen ◽  
Douglas Stebila
Keyword(s):  

2017 ◽  
Vol 11 (4) ◽  
Author(s):  
Janaka Alawatugoda

AbstractTypically, secure channels are constructed from an authenticated key exchange (AKE) protocol, which authenticates the communicating parties based on long-term public keys and establishes secret session keys. In this paper we address the partial leakage of long-term secret keys of key exchange protocol participants due to various side-channel attacks. Security models for two-party authenticated key exchange protocols have been developed over time to provide security even when the adversary learns certain secret values. This paper combines and extends the advances of security modelling for AKE protocols addressing more granular partial leakage of long-term secrets of protocol participants. Further, we fix some flaws in security proofs of previous leakage-resilient key exchange protocols.


Sign in / Sign up

Export Citation Format

Share Document