Researcher:
Boshrooyeh, Sanaz Taheri

Profile Picture
ORCID

Job Title

PhD Student

First Name

Sanaz Taheri

Last Name

Boshrooyeh

Name

Name Variants

Boshrooyeh, Sanaz Taheri

Email Address

Birth Date

Filters

2015 - 201972020 - 20224

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.25f1ea2f-1e30-4941-9c3d-0f58c2509b95

Search Results

Now showing 1 - 10 of 11
  • Placeholder
    PublicationMetadata only
    PPAD: privacy preserving group-based advertising in online social networks
    (IEEE, 2018) N/A; Department of Computer Engineering; Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Küpçü, Alptekin; Özkasap, Öznur; PhD Student; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 168060; 113507
    Services provided as free by Online Social Networks (OSN) come with privacy concerns. Users' information kept by OSN providers are vulnerable to the risk of being sold to the advertising firms. To protect user privacy, existing proposals utilize data encryption, which prevents the providers from monetizing users' information. Therefore, the providers would not be financially motivated to establish secure OSN designs based on users' data encryption. Addressing these problems, we propose the first Privacy Preserving Group-Based Advertising (PPAD) system that gives monetizing ability for the OSN providers. PPAD performs profile and advertisement matching without requiring the users or advertisers to be online, and is shown to be secure in the presence of honest but curious servers that are allowed to create fake users or advertisers. We also present advertisement accuracy metrics under various system parameters providing a range of security-accuracy trade-offs.
  • Placeholder
    PublicationMetadata only
    A consensus protocol with deterministic finality
    (Ieee, 2021) N/A; N/A; N/A; Hassanzadeh-Nazarabadi, Yahya; Boshrooyeh, Sanaz Taheri; PhD Student; PhD Student; Graduate School of Sciences and Engineering; Graduate School of Sciences and Engineering; N/A; N/A
    Proof-of-Validation (PoV) is a fair, immutable, and fully decentralized blockchain consensus protocol with an O(1) asymptotic message complexity. The original PoV proposal lacks deterministic finality, which guarantees that a valid block will not be revoked once it is committed to the blockchain. Supporting deterministic finality yields a fork-resistant blockchain. In this extended abstract, we pitch the architectural outline of our proposed Finalita, which is the extension of PoV that enables deterministic finality. Blockchains running with Finalita feature deterministic finality, in addition to all qualities supported by the original PoV.
  • Placeholder
    PublicationMetadata only
    Guard: secure routing in skip graph
    (Institute of Electrical and Electronics Engineers (IEEE), 2017) N/A; Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Özkasap, Öznur; PhD Student; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 113507
    Skip Graph is a distributed hash table (DHT) which acts as the underlying infrastructure in various P2P applications such as cloud storage and online social networks. The basic operation in Skip Graph is the search which is done in a fully decentralized manner. Any misbehavior of peers during the routing of a search query heavily degrades the system functionality. Security of search queries is the missing feature of Skip Graph, and applying existing DHT-based solutions on a Skip Graph reduces the search operation's efficiency and degrades the performance of query processing and response time. In this work, we propose Guard, the first fully decentralized secure search mechanism for Skip Graph, that provides authenticated and reliable search operation in a fully decentralized manner. Guard secures Skip Graph against the Sybil attack and routing attacks in the presence of the malicious colluding nodes. In contrast to the existing solutions, security of our design is formally proven.
  • Placeholder
    PublicationMetadata only
    Inonymous: anonymous invitation-based system
    (Springer International Publishing Ag, 2017) N/A; Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Küpçü, Alptekin; PhD Student; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 168060
    In invitation-based systems, a user is allowed to join upon receipt of a certain number of invitations from the existing members. The system administrator approves the new membership if he authenticates the inviters and the invitations, knowing who is invited by whom. However, the inviter-invitee relationship is privacy-sensitive information and can be exploited for inference attacks: The invitee's profile (e.g., political view or location) might leak through the inviters' profiles. To cope with this problem, we propose Inonymous, an anonymous invitationbased system where the administrator and the existing members do not know who is invited by whom. We formally define and prove the inviter anonymity against honest but curious adversaries and the information theoretic unforgeability of invitations. Inonymous is efficiently scalable in the sense that once a user joins the system, he can immediately act as an inviter, without re-keying and imposing overhead on the existing members. We also present InonymouX, an anonymous cross-network invitation-based system where users join one network (e.g., Twitter) using invitations of members of another network (e.g., Facebook).
  • Placeholder
    PublicationMetadata only
    Distributed landmark placement in P2P networks
    (Institute of Electrical and Electronics Engineers (IEEE), 2018) N/A; Department of Computer Engineering; Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Özkasap, Öznur; Akgün, Barış; PhD Student; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 113507; 258784
    Peer-to-peer (P2P) paradigm is a promising way to provide services to the masses for a very low cost, and hence, P2P services have been gaining significant attention. Since P2P services usually operate over their users' resources, without using central servers, their performance is becoming of interest to researchers. Several existing solutions rely on supernodes, called landmarks, to enhance system performance. The landmarks are placed manually based on the density and the distribution of the nodes in the corresponding P2P network, and landmark locations are presumed to be determined before system setup. However, this assumption is not realistic since, in a P2P system, no global view about the peers' locations exists. Hence, the best landmark locations would not be known a priori. We propose a family of distributed landmark placement algorithms, called DLP, to address this issue. We implement four versions of the DLP family and evaluate their landmark placements in a simulation environment. We define two performance metrics to assess their performance as compared to manually placed landmarks. Our results show that the DLP algorithms can generate landmark locations that are on par with the manual placement and significantly reduce the landmark-to-peer latencies.
  • Placeholder
    PublicationMetadata only
    Security and privacy of distributed online social networks
    (Ieee, 2015) N/A; Department of Computer Engineering; Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Küpçü, Alptekin; Özkasap, Öznur; PhD Student; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 168060; 113507
    Online social networks (OSNs) suffer from various security and privacy problems. The main source of the security problems is the central service provider that observes users' data and relationships. Distributed OSN (DOSN) is an alternative approach where users control their data without having any central service provider. In DOSNs, for the sake of data availability, users replicate or cache data in other users of the OSN. The replica nodes are indeed another kind of service provider in a small scale and with a local view. Therefore, even though decentralization removes the global view of the single provider, it results in having several small ones. By this claim, centralized and distributed OSNs have several common security concerns. Although there exist prior studies discussing and classifying security issues, a fine grained classification of various state-of-the-art solutions is not available. In this paper, we focus on the data privacy, data integrity, and secure social search solutions for centralized and distributed OSNs. Furthermore, we discuss open security problems and concerns, that can be used as future research directions.
  • Thumbnail Image
    PublicationOpen Access
    Privado: privacy-preserving group-based advertising using multiple independent social network providers
    (Association for Computing Machinery (ACM), 2020) Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Küpçü, Alptekin; Özkasap, Öznur; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 168060; 113507
    Online Social Networks (OSNs) offer free storage and social networking services through which users can communicate personal information with one another. The personal information of the users collected by the OSN provider comes with privacy problems when being monetized for advertising purposes. To protect user privacy, existing studies propose utilizing data encryption that immediately prevents OSNs from monetizing users data and hence leaves secure OSNs with no convincing commercial model. To address this problem, we propose Privado as a privacy-preserving group-based advertising mechanism to be integrated into se- cure OSNs to re-empower monetizing ability. Privado is run by N servers, each provided by an independent provider. User privacy is protected against an active malicious adversary controlling N - 1 providers, all the advertisers, and a large fraction of the users. We base our design on the group-based advertising notion to protect user privacy, which is not possible in the personalized variant. Our design also delivers advertising transparency; the procedure of identifying target customers is operated solely by the OSN servers without getting users and advertisers involved. We carry out experiments to examine the advertising running time under various number of servers and group sizes. We also argue about the optimum number of servers with respect to user privacy and advertising running time.
  • Thumbnail Image
    PublicationOpen Access
    Understanding game-based privacy proofs for energy consumption aggregation protocols
    (Institute of Electrical and Electronics Engineers (IEEE), 2019) Unterweger, Andreas; Eibl, Gunther; Knirsch, Fabian; Engel, Dominik; Department of Computer Engineering; Küpçü, Alptekin; Boshrooyeh, Sanaz Taheri; Faculty Member; Department of Computer Engineering; College of Engineering; Graduate School of Sciences and Engineering; 168060; N/A
    Despite the large number of privacy-preserving aggregation protocols in the smart grid, there is no common methodology for evaluating and comparing their privacy guarantees. Protocol discussion often lacks a formal evaluation of the proposed privacy guarantees. In order to transfer the well-established formal methodology of game-based proofs to the smart grid domain, in this paper we: 1) present a game-based privacy definition which addresses the privacy requirement to be captured in an aggregation protocol (the definition may be used or extended for other protocols); 2) exemplify our game-based proof technique for two aggregation protocols; and 3) provide a novel and compact way to visualize and easily compare the privacy guarantees of different protocols. We employ two sample protocols that reflect the basis of the most common approaches currently found in the energy aggregation literature. In summary, we contribute a guideline on how to conduct formal evaluations for protocol developers as well as an easy-to-understand way to assess the privacy guarantees of different aggregation protocols for non-experts.
  • Thumbnail Image
    PublicationOpen Access
    Demo: a proof-of-concept implementation of Guard secure routing protocol
    (Institute of Electrical and Electronics Engineers (IEEE), 2020) Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Hassanzadeh-Nazarabadi, Yahya; Şahin, Ali Utkan; Özkasap, Öznur; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; N/A; N/A; 113507
    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.
  • Thumbnail Image
    PublicationOpen Access
    DHT-based edge and fog computing systems: infrastructures and applications
    (Institute of Electrical and Electronics Engineers (IEEE), 2022) Department of Computer Engineering; Özkasap, Öznur; Hassanzadeh-Nazarabadi, Yahya; Boshrooyeh, Sanaz Taheri; Faculty Member; Department of Computer Engineering; College of Engineering; 113507; N/A; N/A
    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.