301 search results - page 6 / 61 » An efficient algorithm to verify generalized false paths |
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
STOC
2000
ACM
13 years 12 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
IJRR
2000
13 years 8 months ago
2000
This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path betwe...
ALGORITHMICA
2004
13 years 8 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
PKC
2009
Springer
14 years 9 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...