Abstract. We revisit the problem of finding small solutions to a collection of linear equations modulo an unknown divisor p for a known composite integer N. In CaLC 2001, Howgrave...
It is well-known that analysis of incomplete Cholesky and LU decompositions with a general dropping is very difficult and of limited applicability, see, for example, the results o...
In this paper Cartesian, direct and strong Cartesian product of hypergraphs are investigated. A new concept named the adjacency function is defined on hypergraphs. This definition...
This paper proposes a new approach for the design of a composite structure. This approach is formulated as an optimization problem where the weight of the structure is minimized s...
Enabling private database queries is an important and challenging research problem with many real-world applications. The goal is for the client to obtain the results of its queri...
Craig Gentry, Shai Halevi, Charanjit S. Jutla, Mar...
Traditional user authentication methods using passcode or finger movement on smartphones are vulnerable to shoulder surfing attack, smudge attack, and keylogger attack. These att...
Distributed data usage control enables data owners to constrain how their data is used by remote entities. However, many data usage policies refer to events happening within severa...
We show how to construct a completely generic UC-secure oblivious transfer scheme from a collision-resistant chameleon hash scheme (CH) and a CCA encryption scheme accepting a smoo...
There is a growing need to develop lightweight cryptographic primitives suitable for resource-constrained devices permeating in increasing numbers into the fabric of life. Such dev...