208 search results - page 12 / 42 » Computing Anonymously with Arbitrary Knowledge |
CVPR
2004
IEEE
15 years 2 days ago
2004
IEEE
Multibody factorization algorithms [2, 1, 16] give an elegant and simple solution to the problem of structure from motion even for scenes containing multiple independent motions. ...
ICIP
2007
IEEE
14 years 11 months ago
2007
IEEE
To achieve good image quality for computed tomography scans, it is important to accurately know the geometrical relationship between the x-ray source, detector, and axis of rotati...
SPAA
2010
ACM
14 years 2 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
CRYPTO
2011
Springer
12 years 10 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...