6861 search results - page 1001 / 1373 » Security for Ubiquitous Computing |
142
click to vote
IJISEC
2002
15 years 6 months ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
155
click to vote
TPDS
1998
15 years 6 months ago
1998
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
180
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
156
click to vote
CCR
2010
15 years 4 months ago
2010
This is a brief journey across the Internet privacy landscape. After trying to convince you about the importance of the problem I will try to present questions of interest and how...
177
click to vote
MP
2010
15 years 1 months ago
2010
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...