Our aim in this paper is to show an example of the formalism we have developed to avoid the label-tensor-product-vector-space-formalism of quantum mechanics when dealing with indistinguishable quanta. States in this new vector space, that we call the Q-space, refer only to occupation numbers and permutation operators act as the identity operator on them, reflecting in the formalism the unobserv...

This paper presents new methods enabling anonymous ommuni ation on the Internet. We des ribe a new proto ol that allows us to reate an anonymous overlay network by exploiting the web browsing a tivities of regular users. We show that the overlay network provides an anonymity set greater than the set of senders and re eivers in a realisti threat model. In parti ular, the proto ol provides unobse...

Based on the nomenclature of the early papers in the field, we propose a terminology which is both expressive and precise. More particularly, we define anonymity, unlinkability, unobservability, pseudonymity (pseudonyms and digital pseudonyms, and their attributes), and identity management. In addition, we describe the relationships between these terms, give a rational why we define them as we ...

In mobile ad hoc networks packets are relayed over multiple hops to reach their destination. Due to the features of open medium, dynamic topology, cooperative algorithms, lack of centralized monitoring and management point mobile ad-hoc networks are much more vulnerable to security attacks when compared to the wired networks. A number of secure routing schemes have been brought forward. However...

The main problem arising in value exchange over a network, e.g. in the exchange of digital money for other valuable information, is the lack of simultaneity of the exchange, yielding a temporary advantage for one party, who could then stop communication. The situation is even worse when this party is anonymous. This normally is the case when digital payment systems enabling unobservability are ...

It is a hard problem to achieve anonymity for real-time services in the Internet (e.g. Web access). All existing concepts fail when we assume a very strong attacker model (i.e. an attacker is able to observe all communication links). We also show that these attacks are real-world attacks. This paper outlines alternative models which mostly render these attacks useless. Our present work tries to...

Increasing renewable penetration in distribution grids calls for improved monitoring and control, where power flow (PF) model is the basis many advanced functionalities. However, unobservability makes traditional way infeasible to construct PF analysis via admittance matrix grids. While data-driven approaches can approximate mapping, direct machine learning (ML) applications may suffer from sev...

We present a Bayesian approach to predict the clustering of opinions for system interacting agents from partial observations. The formulation overcomes unobservability and quantifies uncertainty in prediction. characterize by posterior clusters’ sizes centers, we represent samples. To overcome challenge sampling high-dimensional posterior, introduce an auxiliary implicit (AIS) algorithm using t...

We present the architecture, design issues and functions of a MIX-based system for anonymous and unobservable real-time Internet access. This system prevents tra c analysis as well as ooding attacks. The core technologies include an adaptive, anonymous, time/volumesliced channel mechanism and a ticket-based authentication mechanism. The system also provides an interface to inform anonymous user...