Juliet Samandari

Ms. Juliet Samandari

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
JSJuliet Samandari
Juliet Samandari
Clementine GrittiClementine Gritti
Clementine Gritti
Message Queue Telemetry Transport (MQTT) is a common communication protocol used in the Internet of Things (IoT). MQTT is a simple, lightweight messaging protocol used to establish communication between multiple devices relying on the publish–subscribe model. However, the protocol does not provide authentication, and most proposals to incorporate it lose their lightweight feature and do not consider the future risk of quantum attacks. IoT devices are generally resource-constrained, and postquantum cryptography is often more computationally resource-intensive compared to current cryptographic standards, adding to the complexity of the transition. In this paper, we use the postquantum digital signature scheme CRYSTALS-Dilithium to provide authentication for MQTT and determine what the CPU, memory and disk usage are when doing so. We further investigate another possibility to provide authentication when using MQTT, namely a key encapsulation mechanism (KEM) trick proposed in 2020 for transport level security (TLS). Such a trick is claimed to save up to 90% in CPU cycles. We use the postquantum KEM scheme CRYSTALS-KYBER and compare the resulting CPU, memory and disk usages with traditional authentication. We found that the use of KEM for authentication resulted in a speed increase of 25 ms, a saving of 71%. There were some extra costs for memory but this is minimal enough to be acceptable for most IoT devices.


16 May 2025 in IEEE Access
Verified
Journal Article
Open access
JSJuliet Samandari
Juliet Samandari
Clementine GrittiClementine Gritti
Clementine Gritti
In the rapidly evolving digital landscape, efficient cryptographic systems are increasingly critical. Digital Signature (DS) schemes are essential for ensuring data integrity and authenticity, particularly in resource-constrained environments like the Internet of Things (IoT). The Offline/Online (O/O) extension has gained attention for its effective signing process, as it allows for the precomputation of operations beforehand. Informally, in this kind of scheme, signing a message involves two phases. The first is an offline phase that requires moderate computation but can be done in advance, before the message is known. The second is an online phase that starts once the message is available, using the precomputed data to complete the signature more quickly. This survey provides the first comprehensive overview of the adaptation of O/O constructions for various resource-constrained use cases, such as IoT, low-power and mobile contexts, and other contexts, such as blockchains, where latency is a crucial metric. We reviewed 36 O/O DS schemes, focusing on trends, challenges, and applications. We examined the benefits, drawbacks, and potential areas for improvement of the reviewed O/O schemes, as well as identifying the features inherent to the O/O design. Our analysis indicates that the latter effectively mitigates issues related to expensive computations, delays, and high energy consumption, provided that the increased storage demands for offline signatures are manageable. This survey lays the groundwork for future research and development of O/O schemes, driven by the increasing prevalence of constrained environments where these schemes are particularly useful.

16 August 2023 in Cryptography
Verified
Journal Article
Open access
PDF file
ADAeryn Dunmore
Aeryn Dunmore
JSJuliet Samandari
Juliet Samandari
JJJulian Jang-Jaccard
Julian Jang-Jaccard
In this paper, we propose a new symmetric stream cipher encryption algorithm based on Graph Walks and 2-dimensional matrices, called Matrix Encryption Walks (MEW). We offer example Key Matrices and show the efficiency of the proposed method, which operates in linear complexity with an extremely large key space and low-resource requirements. We also provide the Proof of Concept code for the encryption algorithm and a detailed analysis of the security of our proposed MEW. The MEW algorithm is designed for low-resource environments such as IoT or smart devices and is therefore intended to be simple in operation. The encryption, decryption, and key generation time, along with the bytes required to store the key, are all discussed, and similar proposed algorithms are examined and compared. We further discuss the avalanche effect, key space, frequency analysis, Shannon entropy, and chosen/known plaintext-ciphertext attacks, and how MEW remains robust against these attacks. We have also discussed the potential for future research into algorithms such as MEW, which make use of alternative structures and graphic methods for improving encryption models.