Keyless Authentication and Authenticated Capacity
نویسندگان
چکیده
منابع مشابه
Keyless Authentication and Authenticated Capacity
We consider the problem of keyless message authentication over noisy channels in the presence of an active adversary. Different from the existing models, in our model, the legitimate users do not have any pre-shared key for authentication. Instead, we use the noisy channel connecting the legitimate users for authentication. The main idea is to utilize the noisy channel connecting the legitimate...
متن کاملKeyless Public Watermarking for Intellectual Property Authentication
A constraint-based watermarking technique has been introduced for the protection of intellectual properties such as hardware, software, algorithms, and solutions to hard problems. It provides desirable proof of authorship without rendering the intellectual properties useless. However, it makes the watermark detection, which is as important as watermarking, a NP-hard problem. We propose a keyles...
متن کاملAuthentication and Authenticated Key Exchanges
We discuss two-party mutual authentication protocols providing authenticated key exchange, focusing on those using asymmetric techniques. A simple, efficient protocol referred to as the station-to-station (STS) protocol is introduced, examined in detail, and considered in relation to existing protocols. The definition of a secure protocol is considered, and desirable characteristics of secure p...
متن کاملPermutation-based encryption, authentication and authenticated encryption
While mainstream symmetric cryptography has been dominated by block ciphers, we have proposed an alternative based on fixed-width permutations with modes built on top of the sponge and duplex construction, and our concrete proposal K . Our permutationbased approach is scalable and suitable for high-end CPUs as well as resource-constrained platforms. The la er is illustrated by the small K insta...
متن کاملEfficient Implementation of Keyless Signatures with Hash Sequence Authentication
We present new ideas for decreasing the size of secure memory needed for hardware implementations of hash-sequence based signatures proposed recently by Buldas, Laanoja and Truu (in the following referred to as BLT). In their scheme, a message m is signed by time-stamping a concatenation m‖zt of the message and the one-time pseudo-random password zt intended to sign messages at a particular tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2809779