Sciweavers

503 search results - page 34 / 101
» An Independence Relation for Sets of Secrets
Sort
View
ICFP
2009
ACM
16 years 6 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
EUROCRYPT
2008
Springer
15 years 7 months ago
Isolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
COMBINATORICA
2007
126views more  COMBINATORICA 2007»
15 years 6 months ago
Privileged users in zero-error transmission over a noisy channel
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
Noga Alon, Eyal Lubetzky
CVPR
2001
IEEE
16 years 8 months ago
Combining Two-view Constraints For Motion Estimation
In this paper we describe two methods for estimating the motion parameters of an image sequence. For a sequence of images, the global motion can be described by ???? independent m...
Venu Madhav Govindu
ASIACRYPT
2007
Springer
16 years 8 days ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub