Privacy amplification over a non-authentic public channel

Author(s):  
Shengli Liu ◽  
H.C.A. van Tilborg
Author(s):  
Kache Vishwamithra ◽  
G Santhosh Abhinai ◽  
S Aakash ◽  
M Rajvel

In passed-on overseeing, assets are everything considered in the cloud master's connection and dependably got the idea by the cloud clients through open channels. The key system decorations with a got channel foundation over a public channel for the ensured trades between a cloud client and a cloud ace association. The stream key design shows for passed on figuring experience the risky effects of express inconveniences, e.g., seeing low connection delay, disposing of verbalization the central issues, restoring client accreditation, and putting forth an attempt not to stun haphazardness. To manage these heaps, we propose a less testament 0-RTT dull AKA show against baffling eccentricity for secure station foundation in passed-on figuring. As a 0-RTT show, it as a rule speeds up the sensibility of the got channel foundation measure. Further, our show needn't unwind up around with the highlights of an infuriating circumstance a public key with a substance's character and beginning now and for an earnest period of time handles the check of the beginning issue. At long last, a solid security assessment of the show is other than proposed. The show doesn't just fulfill the standard security credits (e.g., known-key security, dull key-share), yet in like manner, solid security ensures, i.e., client certification and puzzling anomaly get.


2021 ◽  
Vol 21 (3&4) ◽  
pp. 0181-0202
Author(s):  
Khodakhast Bibak ◽  
Robert Ritchie ◽  
Behrouz Zolfaghari

Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of $\varepsilon$-almost-$\Delta$-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an $\varepsilon$-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.


Author(s):  
Manish Gupta ◽  
Pradeep Kumar KB ◽  
H. R. Rao

Internet banking has become the preferred channel for conducting banking activities across globe and amongst all social demographics. Only a few other technological adoptions can compare with the recent trend of use of Internet banking facilities. Given the cost advantages and benefits it has to offer, it is widely touted as a win-win strategy for both banks and customers. However, with the growth in E-banking services and reliance on a public channel–Internet–to conduct business, it has been challenging for banks to ensure integrity and confidentiality of highly sensitive information. This chapter presents an overview of authentication issues and challenges in the online banking area with analysis on some of the better approaches. The chapter compares different authentication methods and discusses ensuing issues. The chapter will be invaluable for managers and professionals in understanding the current authentication landscape.


2017 ◽  
Vol 37 (2) ◽  
pp. 0227002
Author(s):  
刘翼鹏 Liu Yipeng ◽  
郭建胜 Guo Jiansheng ◽  
崔竞一 Cui Jingyi

Sign in / Sign up

Export Citation Format

Share Document