503 search results - page 6 / 101 » An Independence Relation for Sets of Secrets |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
SP
2006
IEEE
14 years 2 months ago
2006
IEEE
Can we secure user authentication against eavesdropping adversaries, relying on human cognitive functions alone, unassisted by any external computational device? To accomplish thi...
IMCSIT
2010
13 years 6 months ago
2010
This paper presents a methodology for learning taxonomic relations from a set of documents that each explain one of the concepts. Three different feature extraction approaches with...
CCCG
2010
13 years 10 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
VLDB
1987
ACM
13 years 12 months ago
1987
ACM
In a context considering in a unique framework all the relations in a database, by means of the notion of global consistency, independent database schemes allow enforcement of con...