Sciweavers

STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 5 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 5 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai