Efficient Dynamic Data Encryption Algorithm for Mobile Ad Hoc Network

Two proper threshold broadcast encryption schemes are proposed for the mobile ad hoc network. The initial scheme achieves constant size private keys and O(n-t)-size ciphertexts. Under n+1-Decision Bilinear Diffie-Hellman Exponent (n+1-BDHE) assumption, it is provable security in the selective-identity model. Based on the dual system encryption, we propose our main construction. It also has constant size private keys and O(nt)- size ciphertexts. But it achieves full security under the static assumptions which are more natural than them in the existing schemes.

---

W artykule zaprezentowano dwie metody szyfrowania danych w mobilnych sieciach Ad Hoc.