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

BET

Pageant

剥削

Włodzimierz Czernuszenko,Paweł M. Rowińskient a method to construct key predistribution schemes from linear codes that provide new families of KPSs and OTBESs for an arbitrarily large number of users and with secret keys of constant size. As a consequence of the Gilbert-Varshamov bound, we can prove that our KPSs are asymptotically more eff

AER

Towards Informed Web Content Deliveryer is that it does not involve key update phase for all non-revoked users interacting with the key authority. In this paper, we present the first . scheme that allows senders to select on-the-fly when encrypting whether to use either direct or indirect revocation mode; therefore, it combines best ad

FOVEA

On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channeland the corresponding quantization region thresholds, that minimize the PEP of wrongly decoding to a non-zero codeword . when the all-zero codeword is transmitted is independent of the specific codeword .. However, this is not the case with LP decoding based on a parity-check matrix ., which means t

Myelin

Security of Cyclic Double Block Length Hash Functionshan .(. share a common key). Furthermore we give a practical DBL construction that has the highest security guarantee of all DBL compression functions currently known in literature. We also provide a (relatively weak) analysis of preimage resistance for ..

Debrief

A New Protocol for the Nearby Friend Problemnearby. Similarly, no eavesdropper should be able to gain any information about their actual locations, whether they are actually nearby or not. The problem becomes more challenging as both Alice and Bob are restricted in computational power and communication bandwidth. Starting from an earlier work

incision

RECUR

EVEN

Nansook Park,Christopher PetersonIn this paper, we establish a mass formula for even codes over .. In particular, a formula giving the total number of distinct Type II self-dual codes over . of length . is established for each positive integer . divisible by 8.