Titlebook: Cryptography and Coding; 12th IMA Internation Matthew G. Parker Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 Code.DES

拖网

A New Protocol for the Nearby Friend Problemllow the users to benefit from location-based services without disclosing their private location information unless necessary and that too only to the party eligible to receive that information. In this work, we investigate the so-called nearby friend problem. The problem has emerged in the context

发微光

Distributing the Key Distribution Centre in Sakai–Kasahara Based Systemsntre. For other types of identity based key this distribution can be done using non-interactive and simple techniques. In this short note we explain how this can be done for Sakai–Kasahara style keys using a simple application of a general technique from multi-party computation. The self-checking pr

Brain-Imaging

Misnomer

demote

Certificate-Free Attribute Authenticationemonstrate (1) he owns sufficient attributes to pass an attribute verification without showing his full attribute details, (2) he has been authorized by a number of authorities without revealing his identity, and (3) no certification of the user’s public key is required, and his secret key as a whol

Spongy-Bone

Comparing with RSAs paper introduces a new .-based .. The new function is efficient and produces small hashes. We prove that the proposed . is collision-resistant under the assumption of unforgeability of deterministic . signatures..In many practical applications, programmers need to compare two (unordered) sets of i

Endearing

flutter

Ligang Dong,Bharadwaj Veeravalli C-AAS and four security notions: full anonymity, full traceability, non-frameability and attribute unforgeability. We also construct a concrete C-AAS and prove it is correct and secure under the definition and security notions.

怒目而视

antipsychotic