Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1909.05028

User-Controlled Privacy-Preserving User Profile Data Sharing based on Blockchain

Ajay Kumar Shrestha·Ralph Deters·Julita Vassileva
View original source ↗Read source document ↗Export metadata ↓

Abstract

The tremendous technological advancement in the last few decades has brought many enterprises to collaborate in a better way while making intelligent decisions. The use of Information Technology tools in obtaining data of people's everyday life from various autonomous data sources allowing unrestricted access to user data has emerged as an important practical issue and has given rise to legal implications. Various innovative models for data sharing and management have privacy and centrality issues. To alleviate these limitations, we have incorporated blockchain in user modeling. In this paper, we constructed a decentralized data sharing architecture with MultiChain blockchain in the travel domain, which is also applicable to other similar domains including education, health, and sports. Businesses that operate in the tourism industries including travel and tour agencies, hotels and resorts, shopping malls are connected to the MultiChain and they share their user profile data via stream in the MultiChain. The paper presents the hotel booking service for an imaginary hotel as one of the enterprise nodes, which collects user profile data with proper validation and will allow users to decide which of their data to be shared thus ensuring user control over their data and the preservation of privacy. The data from the repository is converted into an open data format while sharing via stream in the blockchain so that other enterprise nodes, after receiving the data, can easily convert them and store into their own repositories. The paper presents an evaluation of the performance of the model by measuring the latency and memory consumption with three test scenarios that mostly affect the user experience. The node responded quickly in all of these cases.

Explore related subjects

cs.CRcs.DB

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ajay Kumar Shrestha, Ralph Deters, Julita Vassileva. 2019-09-10. User-Controlled Privacy-Preserving User Profile Data Sharing based on Blockchain. https://arxiv.org/abs/1909.05028

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

SynGhost: Invisible and Universal Task-agnostic Backdoor Attack via Syntactic Transfer

Although pre-training achieves remarkable performance, it suffers from task-agnostic backdoor attacks due to vulnerabilities in data and training mechanisms. These attacks can transfer backdoors to various downstream tasks. In this paper, we introduce $\mathtt{maxEntropy}$, an entropy-based poisoning filter that mitigates such risks. To overcome the limitations of manual target setting and explicit triggers, we propose $\mathtt{SynGhost}$, an invisible and universal task-agnostic backdoor attack via syntactic transfer, further exposing vulnerabilities in pre-trained language models (PLMs). Specifically, $\mathtt{SynGhost}$ injects multiple syntactic backdoors into the pre-training space through corpus poisoning, while preserving the PLM's pre-training capabilities. Second, $\mathtt{SynGhost}$ adaptively selects optimal targets based on contrastive learning, creating a uniform distribution in the pre-training space. To identify syntactic differences, we also introduce an awareness module to minimize interference between backdoors. Experiments show that $\mathtt{SynGhost}$ poses significant threats and can transfer to various downstream tasks. Furthermore, $\mathtt{SynGhost}$ resists defenses based on perplexity, fine-pruning, and $\mathtt{maxEntropy}$. The code is available at https://github.com/Zhou-CyberSecurity-AI/SynGhost.

cs.CR↗
arXiv2026

Towards the ideals of Self-Recovery and Metadata Privacy in Social Vault Recovery with Apollo

Social recovery enables users to enlist trusted contacts, or trustees, to help recover lost access to end-to-end-encrypted repositories or vaults. However, existing recovery mechanisms often make strong memorability assumptions about what users will remember. Weakening these memorability assumptions to increase the robustness of recovery is possible, but may leak sensitive metadata about the user and/or trustees if done naively. This paper's first contribution is to draw attention to and formalize this basic tension between memorability and metadata privacy in social vault recovery. Our second contribution is Apollo, a social recovery mechanism that aims to avoid any memorability assumptions while strongly protecting recovery metadata privacy. Apollo approximates the ideal of self-recovery by relying only on a threshold of social reconnection events, which may be initiated either by the user or the user's contacts. Apollo thereby has a chance of succeeding in vault recovery even in a worst-case scenario where the user has forgotten all metadata, including even the vault's existence. To protect the metadata's privacy, Apollo distributes either real or fake (chaff) data to all of a user's contacts, not just the user's trustees, thus systematically anonymizing the trustees among the larger set of contacts. To make this anonymity set scalable, Apollo uses a novel multi-layered secret sharing scheme to mitigate the computational overhead of recovery in this setting, which would otherwise be exponential in the recovery threshold. Finally, we evaluate a prototype implementation of Apollo. Apollo reduces the probability of malicious recovery to under 0.1% for an adversary capable of obtaining shares from every 1-out-of-2 contacts. After reconnecting with 30 contacts, the multi-layered design shows an improvement of 5 orders in computation time, compared to a single-layered approach.

cs.CR↗
arXiv2026

Computational Certified Deletion Property of Magic Square Game and its Application to Classical Secure Key Leasing

We present the first construction of a computational Certified Deletion Property (CDP) achievable with classical communication, derived from the compilation of the non-local Magic Square Game (MSG). We leverage the KLVY compiler to transform the non-local MSG into a 2-round interactive protocol, rigorously demonstrating that this compilation preserves the game-specific CDP. Previously, the quantum value and rigidity of the compiled game were investigated. We emphasize that we are the first to investigate CDP (local randomness in [Fu and Miller, Phys. Rev. A 97, 032324 (2018)]) for the compiled game. Then, we combine this CDP with the framework [Kitagawa, Morimae, and Yamakawa, Eurocrypt 2025] to construct Secure Key Leasing with classical Lessor (cSKL). SKL enables the Lessor to lease the secret key to the Lessee and verify that a quantum Lessee has indeed deleted the key. In this paper, we realize cSKL for PKE, PRF, and digital signature. Compared to prior works for cSKL, we realize cSKL for PRF and digital signature for the first time. In addition, we succeed in weakening the assumption needed to construct cSKL.

cs.CR↗