Receiver Anonymity Research Articles

Privacy Preserving Quantum Anonymous Transmission via Entanglement Relay.

Anonymous transmission is an interesting and crucial issue in computer communication area, which plays a supplementary role to data privacy. In this paper, we put forward a privacy preserving quantum anonymous transmission protocol based on entanglement relay, which constructs anonymous entanglement from EPR pairs instead of multi-particle entangled state, e.g. GHZ state. Our protocol achieves both sender anonymity and receiver anonymity against an active adversary and tolerates any number of corrupt participants. Meanwhile, our protocol obtains an improvement in efficiency compared to quantum schemes in previous literature.

Anonymous multi‐receiver ID‐based signcryption scheme

In earlier multi-receiver signcryption schemes, in order to help the authorised receivers to find the corresponding information for decryption from the ciphertext, the list of identities of all authorised receivers should be included in the ciphertext as a necessary element. However, this method has directly led to the privacy leakage problem of receivers. Later, several anonymous multi-receiver signcryption schemes use the Lagrange interpolation method to mix and hide the real identities of all receivers, so that the ciphertext does not expose identities of the receivers any longer. Therefore the Lagrange interpolation method is considered to be a perfect solution to the receiver anonymity problem, and multiple anonymous multi-receiver signcryption schemes have been proposed based on it. However, recently, this method has been proven to be insecure because it cannot assure the anonymity of receivers either. In fact, in any of the existing anonymous schemes based on the Lagrange interpolation method, it is easy for one authorised receiver to judge whether anyone is an authorised receiver or not, which badly violates the receiver anonymity. Motivated by these concerns, the authors propose a new multi-receiver signcryption scheme to solve this problem. Analyses show that the proposed scheme meets confidentiality, unforgeablity and the sender and receivers’ anonymity.

Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing

Recently, numerous multireceiver identity-based encryption or identity-based broadcast encryption schemes have been introduced with bilinear pairing and probabilistic map-to-point MTP function. As the bilinear pairing and MTP functions are expensive operations, any cryptographic schemes based on these operations experience high computational burden. The certificateless public key cryptography sidesteps the private key escrow problem occurring in identity-based cryptosystem and certificate management troubles of certificate authority-based public key cryptography CA-PKC. We observed that certificateless multireceiver encryption CL-MRE scheme without pairing and MTP hash function has not yet been considered in the literature. In this paper, we proposed a bilinear pairing and MTP hash-function-free CL-MRE scheme with chosen ciphertext attack resilience. The detailed analyses provide evidence that our scheme achieves forward secrecy, backward secrecy, and low computation costs than others. The scheme also provides confidentiality of the message and receiver anonymity in the random oracle model with the hardness of computational Diffie-Hellman problem. Copyright © 2014 John Wiley & Sons, Ltd.

Anonymous encryption with partial‐order subset delegation and its application in privacy email systems

In privacy-carrying email systems, the authors should guarantee that the email content is confidential and sometimes the sender/receiver identities are hidden. Also, they require that the key generation is flexible and manageable. In this study, first, they propose an anonymous encryption scheme that supports a partial-order subset delegatable ability. The proposed scheme achieves the security properties of confidentiality against adaptive chosen-plaintext attacks, anonymity against adaptive chosen-subset attacks and computational delegation indistinguishability. Secondly, they provide a deployment application of their anonymous encryption in an interdisciplinary group email management system with flexible and fine-grained key delegation. The deployment can achieve the privacy of message confidentiality, receiver anonymity and delegation obliviousness, which has fine-grained security in secure email systems. Finally, they provide an extension for the chosen-ciphertext secure scheme, and discuss the efficiency for decryption and the security level.

An efficient quantum anonymous communication with hybrid entanglement swapping

An efficient information-theoretically secure protocol is proposed. It is built for the anonymous transmission of quantum information. In our proposed scheme, a photon of hybrid entangled pairs is travelling through the participants. After operations performed by the participants, anonymous entanglement transmission channels are generated between the sender and receiver by hybrid entanglement swapping. Our protocol achieves both sender anonymity and receiver anonymity against an active adversary and tolerates any number of corrupt participants. Furthermore, we demonstrate that our protocol has great capacity to teleportate quantum message with fewer resources.

Privacy‐preserving multireceiver ID‐based encryption with provable security

SUMMARYMultireceiver identity (ID) based encryption and ID‐based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. It can be used for many practical applications such as digital content distribution, pay‐per‐view and multicast communication. For protecting the privacy of receivers or providing receiver anonymity, several privacy‐preserving (or anonymous) multireceiver ID‐based encryption and ID‐based broadcast encryption schemes were recently proposed, in which receiver anonymity means that nobody (including any selected receiver), except the sender, knows who the other selected receivers are. However, security incompleteness or flaws were found in these schemes. In this paper, we propose a new privacy‐preserving multireceiver ID‐based encryption scheme with provable security. We formally prove that the proposed scheme is semantically secure for confidentiality and receiver anonymity. Compared with the previously proposed anonymous multireceiver ID‐based encryption and ID‐based broadcast encryption schemes, the proposed scheme has better performance and robust security. Copyright © 2012 John Wiley & Sons, Ltd.

Reasoning about minimal anonymity in security protocols

Anonymity, as an instance of information hiding, is one of the security properties intensively studied nowadays due to its applications to various fields such as electronic voting, electronic commerce, electronic mail, and so on.This paper presents a comprehensive study on minimal anonymity properties in security protocols. In order to reach this objective, an epistemic language and logic to reason about anonymity properties in security protocols, are provided. Agent states are endowed with facts derived from actions performed by agents in protocol executions, and an inference system is proposed. To define minimal anonymity, an observational equivalence is used, which is shown to be decidable in deterministic polynomial time. We distinguish between various forms of sender and receiver anonymity with respect to two types of observers: honest agents and the intruder. A large spectrum of relationships between these anonymity concepts is then derived. It is also shown that an anonymous action in a security protocol under a passive intruder might not be anonymous in the same security protocol if the intruder is active, and vice-versa.The decidability and complexity status of the anonymity concepts introduced in the paper is finally investigated. Thus, it is shown that minimal anonymity is undecidable in unrestricted security protocols, is NEXPTIME-complete in bounded security protocols, and is NP-complete in 1-session bounded security protocols.

Cryptanalysis and improvements of an anonymous multi-receiver identity-based encryption scheme

In 2010, Fan et al. presented an anonymous multi-receiver identity-based encryption scheme where they adopt Lagrange interpolating polynomial mechanism. They showed that their scheme makes it impossible for an attacker or any other message receiver to derive the identity of a message receiver such that the privacy of every receiver can be guaranteed. They also formally showed that every receiver in the proposed scheme is anonymous to any other receiver. In this work, the authors study the security of Fan et al.'s anonymous multi-receiver identity-based encryption scheme. It is regretful that they found their scheme is insecure. Every receiver in Fan et al.'s scheme is not anonymous to any other receiver. The authors showed that simple protocol changes can fix these weaknesses and render Fan et al.'s scheme. The improved scheme is proved to satisfy the confidentiality and receiver anonymity in the random oracle.

Improved Anonymous Multi-receiver Identity-Based Encryption

In 2010, Fan et al. proposed an efficient anonymous multi-receiver identity-based encryption scheme. This scheme allows a sender to send an encrypted message to a set of designated receivers while preserving receiver anonymity. The scheme is highly efficient for each receiver as it requires only two pairing operations. However, we found that the scheme failed to protect receiver anonymity and the security notation for receiver anonymity captures only semantics in the case of a single receiver, but does not for multiple recipients. In this paper, we present the weaknesses and propose an improved scheme. The improved scheme enhances both security and computational performance.

Confidential deniable authentication using promised signcryption

In a deniable authentication protocol, a receiver is convinced that a received message is indeed from a particular sender, but cannot prove this to any third party. Deniable authentication protocols satisfy deniability and intended receiver properties. Among the proposed deniable authentication protocols, non-interactive protocols are more efficient than interactive protocols by reducing communication cost. The Hwang and Ma, and the Hwang and Chao non-interactive protocols provide sender anonymity. Recently some interactive protocols provide confidentiality while no non-interactive protocols do. However, the transferred data may damage sender or receiver anonymity. To provide confidentiality and anonymity efficiently, the first promised signcryption scheme is proposed. Using our promised signcryption scheme, we propose the first efficient non-interactive deniable authentication protocol with confidentiality, sender anonymity, and sender protection.

Measuring anonymity in P2P anonymous communication system

The model of P2P anonymous system and attack model were analyzed. And then based on information entropy and aiming at collusion attack, receiver anonymity of several kinds of typical systems were measured. Finally, mathematic analysis was provided for the relationship among anonymity, the size of system, the proportion of malicious node, the length of rerouting path and forwarding probability. Calculations show that nested encryption causes the system to obtain strong anonymity, and the degree of receiver anonymity increases while the system scale increases and decreases while the proportion of malicious node increases. The degree of receiver anonymity is affected by the proportion of malicious node and the system scale obviously, and is affected by the length of path slightly.

An Efficient Overlay Infrastructure for Privacy-Preserving Communication on the Internet

This paper presents Mist2 (Mist 2nd generation), an overlay infrastructure for privacy-preserving communication. Nodes are arranged in concentric rings, which reduce average overlay hop latencies. Mist2 builds on the strengths of previous work on Mist, and significantly improves on the communication overhead, resilience to router failures, and the distributed nature of the algorithm. Mist2 provides sender, receiver, and sender-receiver anonymity for communicating end users. Compared to previous approaches, Mist2 significantly improves the communication efficiency in latency without sacrificing the level of anonymity. This paper proposes an enhancement to the original Mist, and improves this solution using rings resulting in Mist2. The simulation results clearly demonstrate the improved performance of anonymous communication in Mist2 compared to relevant systems, while maintaining anonymity. Since the proposed ring-based approach optimizes path latencies, it performs better than the other proposed solutions where the overlay hops can potentially traverse large distances.

P 5 : A protocol for scalable anonymous communication

We present a protocol for anonymous communication over the Internet. Our protocol, called P 5 (Peer-to-Peer Personal Privacy Protocol) provides sender–, receiver–, and sender–receiver anonymity. P 5 is designed to be implemented over the current Inte

Xor-trees for efficient anonymous multicast and reception

We examine the problem of efficient anonymous multicast and reception in general communication networks. We present algorithms that achieve anonymous communication, are protected against traffic analysis, and require O (1) amortized communication complexity on each link and low computational comlexity. The algorithms support sender anonymity, receiver(s) anonymity, or sender-receiver anonymity.