Proceedings of the 2nd Workshop on Communication Security
Cryptography and Physical Layer Security
Page
%P
136,469 Result(s)
-
Book and Conference Proceedings
-
Book Series
Lecture Notes in Electrical Engineering
Volume 1 / 2007 to Volume 999 / 2017
-
Chapter and Conference Paper
A Study of Injection and Jamming Attacks in Wireless Secret Sharing Systems
Secret key generation (SKG) have been shown to be vulnerable to denial of service (DoS) attacks in the form of jamming and to man in the middle attacks implemented as injection attacks. In this paper, a comp...
-
Chapter and Conference Paper
Semantically-Secured Message-Key Trade-Off over Wiretap Channels with Random Parameters
trade- message (SM) and secret key (SK) rates simultaneously achievable over a state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model ...
-
Chapter and Conference Paper
A CCA-Secure Cryptosystem Using Massive MIMO Channels
the technique of physical-layer cryptography based on using a massive MIMO channel as a key between the sender and desired receiver, which need not be secret. The goal is for low-complexity encoding and d...
-
Chapter and Conference Paper
Fuzzy Authentication Using Rank Distance
authentication based on the fuzzy matching of two objects, for example based on the similarity of two strings in the Hamming metric, or on the similiarity of two sets in the set difference metric. Aim o...
-
Chapter and Conference Paper
An ICN-Based Authentication Protocol for a Simplified LTE Architecture
Nowadays, approach for supporting device mobility is to implement specific mechanisms at link-layer (e.g., tunneling) supported by a dedicated architecture (e.g., LTE architecture). While this approach c...
-
Chapter and Conference Paper
Robust Secret Sharing for End-to-End Key Establishment with Physical Layer Keys Under Active Attacks
years, been an increasing interest in physical layer key generation. Most of the approaches require that the communication partners who wish to generate a common secret key share a physical channel. T...
-
Chapter and Conference Paper
Hash-then-Encode: A Modular Semantically Secure Wiretap Code
modular construction of a semantically secure wiretap code that achieves secrecy capacity for a large class of wiretap channels. Security of the construction is proved by interpreting the construction a...
-
Chapter and Conference Paper
You Are How You Play: Authenticating Mobile Users via Game Playing
Nowadays, authentication on a secret (e.g., password, PIN), while recently two-factors authentication methods have been proposed to make more secure such secret-based methods. Two-factors authent...
-
Chapter and Conference Paper
A McEliece-Based Key Exchange Protocol for Optical Communication Systems
The McEliece cryptosystem the public-key cryptosystems that do not have known vulnerabilities to attacks using quantum computers. However, the McEliece cryptosystem has not been widely used for practical...
-
Journal
Algorithmica
Volume 1 / 1986 - Volume 78 / 2017
-
Article
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant of the well-known Christofides’ algorithm for the TSP, called the Best-of-Many Christofides’ algorithm. ...
-
Article
Guest Editors’ Foreword
-
Article
Improved Analysis of Complete-Linkage Clustering
Complete-linkage clustering is a very popular method for computing hierarchical clusterings in practice, which is not fully understood theoretically. Given a finite set
-
Article
Scheduling with Deadlines and Buffer Management with Processing Requirements
We discuss the well known online job scheduling problem with release times and deadlines, alongside an extended model—buffer management for packets with processing requirements. For job scheduling, an ...
-
Article
Explicit Expanding Expanders
Deterministic constructions of expander graphs have been an important topic of research in computer science and mathematics, with many well-studied constructions of infinite families of expanders. In some appl...
-
Article
How to Sort by Walking and Swapping on Paths and Trees
Consider a graph G with n vertices. On each vertex we place a box. The n vertices and n boxes are each numbered from 1 to n, and initially shuffled according to a permutation
-
Article
I/O-Efficient Similarity Join
We present an I/O-efficient algorithm for computing similarity joins based on locality-sensitive hashing (LSH). In contrast to the filtering methods commonly suggested our method has provable sub-quadratic dep...
-
Article
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, th...
