Smart Home Survey on Security and Privacy
---
paper_title: Lightweight and Secure Session-Key Establishment Scheme in Smart Home Environments

paper_content:

The proliferation of current wireless communications and information technologies have been altering humans lifestyle and social interactions—the next frontier is the smart home environments or spaces. A smart home consists of low capacity devices (e.g., sensors) and wireless networks, and therefore, all working together as a secure system that needs an adequate level of security. This paper introduces lightweight and secure session key establishment scheme for smart home environments. To establish trust among the network, every sensor and control unit uses a short authentication token and establishes a secure session key. The proposed scheme provides important security attributes including prevention of various popular attacks, such as denial-of-service and eavesdropping attacks. The preliminary evaluation and feasibility tests are demonstrated by the proof-of-concept implementation. In addition, the proposed scheme attains both computation efficiency and communication efficiency as compared with other schemes from the literature.
---
paper_title: Verifiable Round-Robin Scheme for Smart Homes

paper_content:

Advances in sensing, networking, and actuation technologies have resulted in the IoT wave that is expected to revolutionize all aspects of modern society. This paper focuses on the new challenges of privacy that arise in IoT in the context of smart homes. Specifically, the paper focuses on preventing the user's privacy via inferences through channel and in-home device activities. We propose a method for securely scheduling the devices while decoupling the device and channels activities. The proposed solution avoids any attacks that may reveal the coordinated schedule of the devices, and hence, also, assures that inferences that may compromise individual's privacy are not leaked due to device and channel level activities. Our experiments also validate the proposed approach, and consequently, an adversary cannot infer device and channel activities by just observing the network traffic.
---
paper_title: Efficient Identification and Signatures for Smart Cards

paper_content:

We present an efficient interactive identification scheme and a related signature scheme that are based on discrete logarithms and which are particularly suited for smart cards. Previous cryptoschemes, based on the discrete logarithm, have been proposed by El Gamal (1985), Chaum, Evertse, Graaf (1988), Beth (1988) and Gunter (1989). The new scheme comprises the following novel features.
---
paper_title: Time-based coordination in geo-distributed cyber-physical systems

paper_content:

Emerging Cyber-Physical Systems (CPS) such as connected vehicles and smart cities span large geographical areas. These systems are increasingly distributed and interconnected. Hence, a hierarchy of cloudlet and cloud deployments will be key to enable scaling, while simultaneously hosting the intelligence behind these systems. Given that CPS applications are often safety-critical, existing techniques focus on reducing latency to provide real-time performance. While low latency is useful, a shared and precise notion of time is key to enabling coordinated action in distributed CPS. In this position paper, we argue for a global Quality of Time (QoT)-based architecture, centered around a shared virtualized notion of time, based on the timeline abstraction [1]. Our architecture allows applications to specify their QoT requirements, while exposing timing uncertainty to the application. The timeline abstraction with the associated knowledge of QoT enables scalable geo-distributed coordination in CPS, while providing avenues for fault tolerance and graceful degradation in the face of adversity.
---
paper_title: New Directions in Cryptography

paper_content:

Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
---
paper_title: Charm: a framework for rapidly prototyping cryptosystems

paper_content:

We describe Charm, an extensible framework for rapidly prototyping cryptographic systems. Charm provides a number of features that explicitly support the development of new protocols, including support for modular composition of cryptographic building blocks, infrastructure for developing interactive protocols, and an extensive library of re-usable code. Our framework also provides a series of specialized tools that enable different cryptosystems to interoperate. We implemented over 40 cryptographic schemes using Charm, including some new ones that, to our knowledge, have never been built in practice. This paper describes our modular architecture, which includes a built-in benchmarking module to compare the performance of Charm primitives to existing C implementations. We show that in many cases our techniques result in an order of magnitude decrease in code size, while inducing an acceptable performance impact. Lastly, the Charm framework is freely available to the research community and to date, we have developed a large, active user base.
---
paper_title: Schnorr-Like Identification Scheme Resistant to Malicious Subliminal Setting of Ephemeral Secret

paper_content:

In this paper we propose a modification of the Schnorr Identification Scheme (\({\mathsf {IS}}\)), which is immune to malicious subliminal setting of ephemeral secret. We introduce a new strong security model in which, during the query stage, we allow the adversary verifier to set random values used on the prover side in the commitment phase. We define the \({\mathsf {IS}}\) scheme to be secure if such a setting will not enable the adversary to impersonate the prover later on. Subsequently we prove the security of the modified Schnorr \({\mathsf {IS}}\) in our strong model. We assume the proposition is important for scenarios in which we do not control the production process of the device on which the scheme is implemented, and where the erroneous pseudo-random number generators make such attacks possible.
---
paper_title: Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes

paper_content:

This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm problem. This provably secure scheme is almost as efficient as the Schnorr identification scheme, while the Schnorr scheme is not provably secure. This paper also presents another practical identification scheme which is proven to be as secure as the factoring problem and is almost as efficient as the Guillou-Quisquater identification scheme: the Guillou-Quisquater scheme is not provably secure. We also propose practical digital signature schemes based on these identification schemes. The signature schemes are almost as efficient as the Schnorr and Guillou-Quisquater signature schemes, while the security assumptions of our signature schemes are weaker than those of the Schnorr and Guillou-Quisquater. signature schemes. This paper also gives a theoretically generalized result: a three-move identification scheme can be constructed which is as secure as the random-self-reducible problem. Moreover, this paper proposes a variant which is proven to be as secuie as the difficulty of solving both the discrete logarithm problem and the specific factoring problem simultaneously. Some other variants such as an identity-based variant and an elliptic curve variant are also proposed.
---
paper_title: From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security

paper_content:

The Fiat-Shamir paradigm for transforming identification schemes into signature schemes has been popular since its introduction because it yields efficient signature schemes, and has been receiving renewed interest of late as the main tool in deriving forward-secure signature schemes. We find minimal (meaning necessary and sufficient) conditions on the identification scheme to ensure security of the signature scheme in the random oracle model, in both the usual and the forward-secure cases. Specifically we show that the signature scheme is secure (resp. forward-secure) against chosen-message attacks in the random oracle model if and only if the underlying identification scheme is secure (resp. forward-secure) against impersonation under passive (i.e., eavesdropping only) attacks, and has its commitments drawn at random from a large space. An extension is proven incorporating a random seed into the Fiat-Shamir transform so that the commitment space assumption may be removed.
---
paper_title: Wallet Databases with Observers

paper_content:

Previously there have been essentially only two models for computers that people can use to handle ordinary consumer transactions: (1) the tamper-proof module, such as a smart card, that the person cannot modify or probe: and (2) the personal workstation whose inner working is totally under control of the individual. The first part of this article argues that a particular combination of these two kinds of mechanism can overcome the limitations of each alone, providing both security and correctness for organizations as well as privacy and even anonymity for individuals.Then it is shown how this combined device, called a wallet, ran carry a database containing personal information. The construction presented ensures that no single part of the device (i.e. neither the tamper-proof part nor the workstation) can learn the contents of the database -- this information can only be recovered by the two parts together.
---

Title: Smart Home Survey on Security and Privacy

Section 1: INTRODUCTION
Description 1: Describe the rapid growth of IoT in smart homes, the typical structure of a Home Area Network (HAN), and its associated security and privacy challenges.

Section 2: SECURITY THREATS AND GOALS
Description 2: Discuss the vulnerabilities of existing HANs, present a taxonomy of threats, and provide an overview of basic security requirements necessary for proximity-based communication in HANs.

Section 3: Proximity Model
Description 3: Explain the proximity communication model based on space and time dimensions. Discuss different device interaction scenarios categorized by time and space, along with corresponding security solutions.

Section 4: Key Generation
Description 4: Describe general methods for secure key management, such as key pre-sharing, key evolution, and PUF-enabled key-store, and classify device communication into categories based on these methods.

Section 5: Device-to-Device Wireless (D2DWL) Connectivity
Description 5: Elaborate on the security adaptations for D2D wireless connectivity, including reactive authentication and distance-bounding protocols.

Section 6: Device-to-Device Wired (D2DW) Connectivity
Description 6: Present the security solutions for D2D wired connectivity, including the application of symmetric and asymmetric key protocols like ISO-KE, SIGMA, and TLS.

Section 7: Owner-to-Cloud (O2C) Connectivity
Description 7: Discuss the security considerations for O2C connectivity, including secure storage, query processing, and authentication. Illustrate protocols like Schnorr and Okamoto Identification Schemes, Pedersen’s Commitment Scheme, proxy re-encryption, and homomorphic encryption.

Section 8: CONCLUSION
Description 8: Summarize the study of security protocols for proximity-based communication models in HANs, and highlight the suitability of different security protocols based on time and space dimensions.