151 search results - page 6 / 31 » Optimal (2, n) visual cryptographic schemes |
ALGORITHMICA
1998
13 years 7 months ago
1998
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
MOC
2002
13 years 7 months ago
2002
We consider a family of tensor product finite element methods for hyperbolic equations in RN , N 2, which are explicit and generate a continuous approximate solution. The base cas...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
TCS
2011
13 years 2 months ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
ASIACRYPT
2010
Springer
13 years 4 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...