Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Abstract— In this paper, we propose an authentication and secure channel establishment protocol that is reliable and adaptable for multihop wireless home networks. The main idea ...
Han Sang Kim, Jin Wook Lee, Sandeep K. S. Gupta, Y...
— This paper addresses the topology control problem for large wireless networks that are modelled by an infinite point process on a two-dimensional plane. Topology control is th...
We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanc...
Steven D. Galbraith, Chris Heneghan, James F. McKe...