Related papers: Riposte: An Anonymous Messaging System Handling Mi…
Anonymous Hierarchical Identity-Based Encryption (HIBE) is an extension of Identity-Based Encryption (IBE), and it provides not only a message hiding property but also an identity hiding property. Anonymous HIBE schemes can be applicable to…
Telegram is a globally popular instant messaging platform known for its strong emphasis on security, privacy, and unique social networking features. It has recently emerged as the host for various cross-domain analysis and research works,…
Federated learning enables users to collaboratively train a machine learning model over their private datasets. Secure aggregation protocols are employed to mitigate information leakage about the local datasets. This setup, however, still…
We present an intelligent, crowd-powered information collection system that automatically identifies and asks target-ed strangers on Twitter for desired information (e.g., cur-rent wait time at a nightclub). Our work includes three parts.…
Road network is employed for exchanging the information among the vehicles where accidents and traffic information can be delivered, or receive services by an infrastructure. Although wireless communication systems yield an efficient…
Reliable social connectivity and transmission of data for popular nodes is vital in multihop Ad-hoc Social Networks (ASNETs). In this networking paradigm, transmission unreliability could be caused by multiple social applications running on…
With 3.78 billion social media users worldwide in 2021 (48% of the human population), almost 3 billion images are shared daily. At the same time, a consistent evolution of smartphone cameras has led to a photography explosion with 85% of…
We introduce the problem of random symmetric private information retrieval (RSPIR). In canonical PIR, a user downloads a message out of $K$ messages from $N$ non-colluding and replicated databases in such a way that no database can know…
We propose a protocol for anonymous distribution of quantum information which can be used in two modifications. In the first modification the receiver of the message is publicly known, but the sender remains unknown (even to receiver). In…
Many recent proposals for anonymous communication omit from their security analyses a consideration of the effects of time on important system components. In practice, many components of anonymity systems, such as the client location and…
This document describes a best-effort delay-tolerant communication system that protects the privacy of users in wireless ad-hoc networks by making their communication undetectable. The proposed system is a wireless broadcast-based…
A crypto system can be used to encrypt messages sent between two communicating parties so that an eavesdropper who overhears the encrypted messages will not be able to decode them. The paper mainly concentrates on the method in which the…
We propose the first method that realizes the Laplace mechanism exactly (i.e., a Laplace noise is added to the data) that requires only a finite amount of communication (whereas the original Laplace mechanism requires the transmission of a…
We plan to simulate a private and unlinkable exchange of messages by using a Public bulletin board and Mix networks in Opportunistic networks. This Opportunistic network uses a secure and privacy-friendly asynchronous unidirectional message…
With Internet users constantly leaving a trail of text, whether through blogs, emails, or social media posts, the ability to write and protest anonymously is being eroded because artificial intelligence, when given a sample of previous…
A substantial body of research has focused on formalising what constitutes a ``secure'' messaging system, recognising that end-to-end encryption alone is insufficient to capture the full range of security, privacy, and usability properties…
Given a cloud-based anonymous data storage system, there are two ways for managing the nodes involved in file transfers. One of them is using reputations and the other uses a micropayment system. In reputation-based approach, each node has…
We present the first self-stabilizing consensus and replicated state machine for asynchronous message passing systems. The scheme does not require that all participants make a certain number of steps prior to reaching a practically infinite…
We analyze how the sparsity of a typical aggregate social relation impacts the network overhead of online communication systems designed to provide k-anonymity. Once users are grouped in anonymity sets there will likely be few related pairs…
E-business, information serving, and ubiquitous computing will create heavy request traffic from strangers or even incognitos. Such requests must be managed automatically. Two ways of doing this are well known: giving every incognito…