31 search results - page 5 / 7 » On the Hardness of Information-Theoretic Multiparty Computat... |
STOC
2006
ACM
15 years 3 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
ATAL
2005
Springer
15 years 2 months ago
2005
Springer
The aggregation of conflicting preferences is a key issue in multiagent systems. Due to its universality, voting has a central role among preference aggregation mechanisms. Votin...
COCO
2005
Springer
14 years 11 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
FC
2010
Springer
15 years 1 months ago
2010
Springer
A key way in which banks mitigate the effects of phishing is to remove fraudulent websites or suspend abusive domain names. This ‘take-down’ is often subcontracted to special...
NDSS
2007
IEEE
15 years 3 months ago
2007
IEEE
With Hidden Credentials Alice can send policyencrypted data to Bob in such a way that he can decrypt the data only with the right combination of credentials. Alice gains no knowle...