For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
—In this paper we investigate the issues in designing key management architecture for secure multicasting in remote software distribution to advance vehicles. We consider the Veh...
The dynamic classification and identification of network applications responsible for network traffic flows offers substantial benefits to a number of key areas in IP network engi...
Sebastian Zander, Thuy T. T. Nguyen, Grenville J. ...