Sciweavers

321 search results - page 53 / 65
» Randomness extractors -- applications and constructions
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 9 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
203
Voted
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 8 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
157
Voted
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
14 years 7 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
TCC
2005
Springer
113views Cryptology» more  TCC 2005»
15 years 9 months ago
Entropic Security and the Encryption of High Entropy Messages
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of ...
Yevgeniy Dodis, Adam Smith
TMC
2010
143views more  TMC 2010»
15 years 2 months ago
Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing
—This paper deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than...
Paul J. Darby III, Nian-Feng Tzeng