We introduce a computational problem of distinguishing between the output an ideal coarse-grained boson sampler and true random number generator, as resource for cryptographic schemes, which are secure against computationally unbounded adversaries. Moreover, we define setting implementation such including message encryption authentication, well entity authentication.

Authentication is a process by which an entity, which could be a person or intended computer, establishes its identity to another entity. In private and public computer networks including the Internet, authentication is commonly done through the use of logon passwords. Knowledge of the password is assumed to guarantee that the user is authentic. Internet business and many other transactions req...

We extend the -calculus and the spi-calculus with two primitives that guarantee authentication. They enable us to abstract from various implementations/specifications of authentication, and to obtain idealized protocols which are “secure by construction”. The main underlying idea, originally proposed in [14] for entity authentication, is to use the locations of processes in order to check who i...

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. messa...

In the context of Internet Things (IoT), proliferation identity spoofing threats has led to need for constant entity verification devices. Recently, a formal framework been proposed study resistance impersonation attacks One-Message Unilateral Entity Authentication (OM-UEA) schemes, in which prover continuously authenticates itself through use sequence authentication messages. Given limited com...

It is common to implement challenge-response entity authentication with a MAC function. In such an scheme, aggregate effective when server needs authenticate many entities. Aggregate aggregates multiple tags (responses challenge) generated by entities into one short tag so that the can be authenticated simultaneously regarding only tag. Then, all associated are valid if pair of challenge and va...

Most of today’s authentication schemes involve verifying the identity of a principal in some way. This process is commonly known as entity authentication. In emerging ubiquitous computing paradigms which are highly dynamic and mobile in nature, entity authentication may not be sufficient or even appropriate, especially if a principal’s privacy is to be protected. In order to preserve privacy, o...