— Until recently, the problem of localization in wireless networks has been mainly studied in a non-adversarial setting. Only recently, a number of solutions have been proposed t...
Abstract We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expe...
Recent information hiding schemes are scrutinized in terms of their cryptographic performance. We establish conditions under which the key equivocation function is optimal for the...
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...
We present extremely simple ways of embedding a backdoor in the key generation scheme of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to...