Efficient Secret Key Delivery Using Heartbeats
نویسندگان
چکیده
منابع مشابه
Efficient Biometric Iris Recognition Using Hough Transform With Secret Key
The demand for an accurate biometric system that provides reliable identification and verification of an individual has increased over the years. A biometric system that provides reliable and accurate identification of an individual is an iris recognition system. Iris recognition systems capture an image of an individual's eye; the iris in the image is then segmented and normalized for feature ...
متن کاملSecret Key Cryptography Using Graphics Cards
One frequently cited reason for the lack of wide deployment of cryptographic protocols is the (perceived) poor performance of the algorithms they employ and their impact on the rest of the system. Although high-performance dedicated cryptographic accelerator cards have been commercially available for some time, market penetration remains low. We take a different approach, seeking to exploit exi...
متن کاملCryptoGraphics: Secret Key Cryptography Using Graphics Cards
We investigate the feasibility of using Graphics Processing Units (GPUs) for cryptographic processing by exploiting the ability for GPUs to simultaneously process large quantities of pixels to offload symmetric key encryption from the main processor. We demonstrate the use of GPUs for applying the key stream when using stream ciphers. We investigate the use of GPUs for block ciphers, discuss op...
متن کاملA N Efficient Key Exchange Protocol Based on Secret Sharing
Group key protocols are still an important research issue in the network security, generation and sharing the secret session key is the important factor during the the groupkey transfer protocols. Usually it will be taken care of KGC. KGC encrypts session keys under another secret key shared with each entity during registration. In this paper, we propose an authenticated key transfer protocol b...
متن کاملResource-Efficient Common Randomness and Secret-Key Schemes
We study common randomnesswhere two parties have access to i.i.d. samples from a known random source, and wish to generate a shared random key using limited (or no) communication with the largest possible probability of agreement. This problem is at the core of secret key generation in cryptography, with connections to communication under uncertainty and locality sensitive hashing. We take the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201712503006