Securing a secret master key is a non-trivial task, we even argue it is impossible to fully secure it, hence we must make it as difficult as possible for any powerful adversary to steal or use the key. We introduce the reader to interesting cryptography which is starting to get more attention in terms of addressing the above problem, and we briefly overview some commercial and open-source products that can be used. Finally, we propose a set of solutions on how to secure master keys, more as guidelines rather than exact technical specifications, with aim to inspire and raise awareness of how to increase the security as much as possible.
Users' devices, e.g., smartphones or laptops, are typically incapable of securely storing and processing cryptographic keys. We present Tandem, a novel set of protocols for securing cryptographic keys with support from a central server. Tandem uses one-time-use key-share tokens to preserve users' privacy with respect to a malicious central server. Additionally, Tandem enables users to block their keys if they lose their device, and it enables the server to limit how often an adversary can use an unblocked key. We prove Tandem's security and privacy properties, apply Tandem to attribute-based c…
We explore the use of SGX enclaves as a means to improve the security of handling keys and data in storage systems. We study two main configurations for SGX computations, as they apply to performing data-at-rest encryption in a storage system. The first configuration aims to protect the encryption keys used in the encryption process. The second configuration aims to protect both the encryption keys and the data, thus providing end-to-end security of the entire data path. Our main contribution is an evaluation of the viability of SGX for data-at-rest encryption from a performance perspective an…
Secure communication between two nodes in a network depends on reliable key management systems that generate and distribute keys between communicating nodes and a secure routing protocol that establishes a route between them. But due to lack of central server and infrastructure in Mobile Ad hoc Networks (MANETs), this is major problem to manage the keys in the network. Dynamically changes in network's topology causes weak trust relationship among the nodes in the network. In MANETs a mobile node operates as not only end terminal but also as an intermediate router. Therefore, a multi-hop scenar…
A few years ago, Automotive area in the IoT was seen as theoretical concept and today we are already seeing the possibilities of not only driverless cars, but applications of IoT in the intelligent vehicles including parking, maintaining environment, protecting lives and smoothing the flow vehicle movements. We have realized the urgent need of using simple and efficient secure protocol in Vehicular Ad Hoc Network (VANET) to be practical in the fast mobility of the network nodes, and taking advantage of the existence of base stations gateways along the road to inherit the protocol to different …
In this work, we propose a secret key generation procedure specifically designed for the inter-spacecraft communication links. As a novel secrecy source, the spacecrafts utilize Doppler frequency shift based measurements. In this way, the mobilities of the communication devices are exploited to generate secret keys, where this resource can be utilized in the environments that the channel fading based key generation methods are not available. The mobility of a spacecraft is modeled as the superposition of a pre-determined component and a dynamic component. We derive the maximum achievable secre…
Unconditionally secure physical key distribution schemes are very slow, and it is practically impossible to use a one-time-pad based cipher to guarantee unconditional security for the encryption of data because using the key bits more than once gives out statistical information, for example via the known-plain-text-attack or by utilizing known components of the protocol and language statistics. Here we outline a protocol that reduces this speed problem and allows almost-one-time-pad based communication with an unconditionally secure physical key of finite length. The physical, unconditionally …
This paper describes the problem of securing data by making it disappear after some time limit, making it impossible for it to be recovered by an unauthorized party. This method is in response to the need to keep the data secured and to protect the privacy of archived data on the servers, Cloud and Peer-to-Peer architectures. Due to the distributed nature of these architectures, it is impossible to destroy the data completely. So, we store the data by applying encryption and then manage the key, which is easier to do as the key is small and it can be hidden in the DHT (Distributed hash table).…
Informatics Institute, Istanbul Technical University（伊斯坦布尔理工大学信息学研究所）；Securify Information Technology and Security Training Consulting Inc.（Securify信息技术与安全培训咨询有限公司）
University of Cambridge（剑桥大学）；Shenzhen International Center For Industrial And Applied Mathematics, Shenzhen Research Institute of Big Data（深圳国际应用数学中心，深圳大数据研究院）；Tsinghua University（清华大学）；University of California San Diego（加州大学圣地亚哥分校）
Privacy preserving RFID (Radio Frequency Identification) authentication has been an active research area in recent years. Both forward security and backward security are required to maintain the privacy of a tag, i.e., exposure of a tag's secret key should not reveal the past or future secret keys of the tag. We envisage the need for a formal model for backward security for RFID protocol designs in shared key settings, since the RFID tags are too resource-constrained to support public key settings. However, there has not been much research on backward security for shared key environment since …
RFID tags are heavily constrained in computational and storage capabilities, and raise numerous privacy concerns in everyday life due to their vulnerability to different attacks. Both forward security and backward security are required to maintain the privacy of a tag i.e., exposure of a tag's secret key should not reveal the past or future secret keys of the tag. We envisage the need for a formal model for backward security for RFID protocol designs in shared key settings, since the RFID tags are too resource-constrained to support public key settings. However, there has not been much researc…
Caesar cipher is an ancient, elementary method of encrypting plain text message to protect it from adversaries. However, with the advent of powerful computers there is a need for increasing the complexity of such algorithms. In this paper, we contribute in the area of classical cryptography by providing a modified approach and expanded version for Caesar cipher using knowledge of mathematics and computer science. To increase the strength of this classical encryption technique we use the concepts of affine ciphers, transposition ciphers and randomized substitution techniques to create a cipher …
Public key infrastructure (PKI) is the most widely used security mechanism for securing communications over the network. However, there are known performance issues, making it unsuitable for use in vehicular networks. In this paper, we propose a secure and authenticated key management protocol (SA-KMP) to overcome the shortcomings of the PKI. The SA-KMP scheme distributes repository containing the bindings of the en-tity's identity and its corresponding public key to each vehicle and road side unit. By doing so, certificate exchanges and certificate revocation lists are eliminated. Furthermore…
On the Feasibility of Simulation-Secure Quantum Functional Encryption
Université de Montréal (DIRO)（蒙特利尔大学）；University of Ottawa（渥太华大学）；CISPA Helmholtz Center for Information Security（CISPA赫尔姆霍兹信息安全中心）；Saarland University（萨尔兰大学）
