arXiv subjects

Sanaz Taheri-Boshrooyeh

Publications and source records attributed to Sanaz Taheri-Boshrooyeh.

8 recordsLinked to original sources

arXiv2026

Constraint-Level Design of zkEVMs: Architectures, Trade-offs, and Evolution

Zero-Knowledge Ethereum Virtual Machines (zkEVMs) face an inherent tension. The Ethereum Virtual Machine (EVM) was built for transparent step-by-step execution. Proving that execution in zero-knowledge requires recasting it as algebraic circuits that encode computation as mathematical constraints. Existing surveys address zkEVMs at the level of implementations, cryptographic primitives, or Layer 2 deployment, leaving the constraint-system design that governs their cost largely unexamined. This survey provides the first constraint-level analysis of how production zkEVMs and universal Zero-Knowledge Virtual Machines (zkVMs) resolve this tension. We show that the degree of EVM compatibility, captured by the Type 1-4 spectrum, is the defining architectural decision. We classify the design space along four dimensions, namely arithmetization frameworks, dispatch strategies, semantic rewrites, and recursion approaches. The most Ethereum-equivalent systems accept higher constraint counts to preserve full bytecode fidelity, while those that relax fidelity attain lower constraint cost. We close with the open problems that this constraint-level view brings into focus.

cs.CR↗

arXiv2022

DHT-based Edge and Fog Computing Systems: Infrastructures and Applications

Intending to support new emerging applications with latency requirements below what can be offered by the cloud data centers, the edge and fog computing paradigms have reared. In such systems, the real-time instant data is processed closer to the edge of the network, instead of the remote data centers. With the advances in edge and fog computing systems, novel and efficient solutions based on Distributed Hash Tables (DHTs) emerge and play critical roles in system design. Several DHT-based solutions have been proposed to either augment the scalability and efficiency of edge and fog computing infrastructures or to enable application-specific functionalities such as task and resource management. This paper presents the first comprehensive study on the state-of-the-art DHT-based architectures in edge and fog computing systems from the lenses of infrastructure and application. Moreover, the paper details the open problems and discusses future research guidelines for the DHT-based edge and fog computing systems.

cs.DC↗

arXiv2022

Waku: A Family of Modular P2P Protocols For Secure & Censorship-Resistant Communication

Waku is a family of modular protocols that enable secure, censorship-resistant, and anonymous peer-to-peer communication. Waku protocols provide capabilities that make them suitable to run in resource-restricted environments e.g., mobile devices and web browsers. Such capabilities include (i) retrieving historical messaging for mostly-offline devices (ii) adaptive nodes; allowing for heterogeneous nodes to contribute to the network (iii) preserving bandwidth usage for resource-restricted devices, (iv) minimizing connectivity requirements for devices with a limited connection, and (v) enabling efficient, private, economic spam protection for heterogeneous nodes. Waku's modular design and resource-efficient protocols make it superior to its predecessor i.e., Whisper. In this paper, we give an overview of the Waku protocols stack, its architecture, and protocols interaction along with a sample demo scenario on configuring and running a Waku node using nwaku i.e., Waku client written in Nim.

cs.CR↗

arXiv2022

Privacy-Preserving Spam-Protected Gossip-Based Routing

WAKU-RLN-RELAY is an anonymous peer-to-peer gossip-based routing protocol that features a privacy-preserving spam-protection with cryptographically guaranteed economic incentives. While being an anonymous routing protocol where routed messages are not attributable to their origin, it allows global identification and removal of spammers. It addresses the performance and privacy issues of its counterparts including proof-of-work and reputation-based schemes. Its light computational overhead makes it suitable for resource-limited environments. The spam protection works by limiting the messaging rate of each network participant where rate violation results in financial punishment. We deploy the novel construct of rate-limiting nullifier to enforce the message rate limit. We provide a proof-of-concept implementation of WAKU-RLN-RELAY to prove the efficiency and feasibility of our solution.

cs.CR↗

arXiv2022

WAKU-RLN-RELAY: Privacy-Preserving Peer-to-Peer Economic Spam Protection

In this paper, we propose WAKU-RLN-RELAY as a spam-protected gossip-based routing protocol that can run in heterogeneous networks. It features a privacy-preserving peer-to-peer (p2p) economic spam protection mechanism. WAKU-RLN-RELAY addresses the performance and privacy issues of the state-of-the-art p2p spam prevention techniques including peer scoring utilized by libp2p, and proof-of-work used by e.g., Whisper, the p2p messaging layer of Ethereum. In WAKU-RLN-RELAY, spam protection works by limiting the messaging rate of each network participant. Rate violation is disincentivized since it results in financial punishment where the punishment is cryptographically guaranteed. Peers who identify spammers are also rewarded. To enforce the rate limit, we adopt the suggested framework of Semaphore and its extended version, however, we modify that framework to properly address the unique requirements of a network of p2p resource-restricted users. The current work dives into the end-to-end integration of Semaphore into WAKU-RLN-RELAY, the modifications required to make it suitable for resource-limited users, and the open problems and future research directions. We also provide a proof-of-concept open-source implementation of WAKU-RLN-RELAY, and its specifications together with a rough performance evaluation.

cs.CR↗

arXiv2021

DHT-based Communications Survey: Architectures and Use Cases

Several distributed system paradigms utilize Distributed Hash Tables (DHTs) to realize structured peer-to-peer (P2P) overlays. DHT structures arise as the most commonly used organizations for peers that can efficiently perform crucial services such as data storage, replication, query resolution, and load balancing. With the advances in various distributed system technologies, novel and efficient solutions based on DHTs emerge and play critical roles in system design. DHT-based methods and communications have been proposed to address challenges such as scalability, availability, reliability and performance, by considering unique characteristics of these technologies. In this article, we propose a classification of the state-of-the-art DHT-based methods focusing on their system architecture, communication, routing and technological aspects across various system domains. To the best of our knowledge, there is no comprehensive survey on DHT-based applications from system architecture and communication perspectives that spans various domains of recent distributed system technologies. We investigate the recently emerged DHT-based solutions in the seven key domains of edge and fog computing, cloud computing, blockchain, the Internet of Things (IoT), Online Social Networks (OSNs), Mobile Ad Hoc Networks (MANETs), and Vehicular Ad Hoc Networks (VANETs). In contrast to the existing surveys, our study goes beyond the commonly known DHT methods such as storage, routing, and lookup, and identifies diverse DHT-based solutions including but not limited to aggregation, task scheduling, resource management and discovery, clustering and group management, federation, data dependency management, and data transmission. Furthermore, we identify open problems and discuss future research guidelines for each domain.

cs.DC↗

arXiv2021

AggFT: Low-Cost Fault-Tolerant Smart Meter Aggregation with Proven Termination and Privacy

Smart meter data aggregation protocols have been developed to address rising privacy threats against customers' consumption data. However, these protocols do not work satisfactorily in the presence of failures of smart meters or network communication links. In this paper, we propose a lightweight and fault-tolerant aggregation algorithm that can serve as a solid foundation for further research. We revisit an existing error-resilient privacy-preserving aggregation protocol based on masking and improve it by: (i) performing changes in the cryptographic parts that lead to a reduction of computational costs, (ii) simplifying the behaviour of the protocol in the presence of faults, and showing a proof of proper termination under a well-defined failure model, (iii) decoupling the computation part from the data flow so that the algorithm can also be used with homomorphic encryption as a basis for privacy-preservation. To best of our knowledge, this is the first algorithm that is formulated for both, masking and homomorphic encryption. (iv) Finally, we provide a formal proof of the privacy guarantee under failure. The systematic treatment with strict proofs and the established connection to graph theory may also serve as a starting point for possible generalizations and improvements with respect to increased resilience.

cs.CR↗

arXiv2020

Demo: A Proof-of-Concept Implementation of Guard Secure Routing Protocol

Skip Graphs belong to the family of Distributed Hash Table (DHT) structures that are utilized as routing overlays in various peer-to-peer applications including blockchains, cloud storage, and social networks. In a Skip Graph overlay, any misbehavior of peers during the routing of a query compromises the system functionality. Guard is the first authenticated search mechanism for Skip Graphs, enables reliable search operation in a fully decentralized manner. In this demo paper, we present a proof-of-concept implementation of Guard on Skip Graph nodes as well as a deployment demo scenario.

cs.DC↗