Cryptographic Energy Costs Are Assumable in Ad Hoc Networks

Abstract

SUMMARYThe performance of symmetric and asymmetric cryptography algorithms in small devices is presented. Both temporal and energy costs are measured and compared with the basic functional costs of a device. We demonstrate that cryptographic power costs are not a limiting factor of the autonomy of a device and explain how processing delays can be conveniently managed to minimize their impact.

Recipients' Anonymity in Multihop Ad-Hoc Networks

“…The plot shows that in networks with 100 connected users, the probability of a collision is 32%, and the probability of 2 or more collisions is less than 6%. Thus, from the total 100 connected participants, only a few nodes which are not the intended receiver of the communication may have to exectue a resource-consuming [9], [10] public key decryption operation. The overhead of the system for a recipient's lookup is null with a probability of 74.65%, one decryption with 25.35%, two decryptions with 5.06%, and three or more decryptions with < 1%.…”

A Fair and Secure Cluster Formation Process for Ad Hoc Networks

“…The security anchor is a public key infrastructure. However, most of the cryptographic operations involved in a cluster formation process are very efficient, based on symmetric cryptography and hash chains [10].…”

Anonymous reputation based reservations in e-commerce (amnesic)

“…Once the user has received the vcode of the vendor, she can verify that it is correctly performing the hash operation over it. Note that if the user holds a smart phone, all the operations of the protocol can be easily and automatically executed by the mobile itself which has the computational resources to do it [21,22].…”