We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
We present the first identity-based traitor tracing scheme. The scheme is shown to be secure in the standard model, assuming the bilinear decision Diffie-Hellman (DBDH) is hard in...
Michel Abdalla, Alexander W. Dent, John Malone-Lee...
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...
Data protection is an increasingly important issue in today’s communication networks. Traditional solutions for protecting data when transferred over a network are almost exclusi...
Stefan Lindskog, Karl-Johan Grinnemo, Anna Brunstr...