Sciweavers

2601 search results - page 401 / 521
» Secure Rewarding Schemes
Sort
View
MOBIHOC
2009
ACM
16 years 3 months ago
Efficient uncoordinated FHSS anti-jamming communication
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
Mario Strasser, Christina Pöpper, Srdjan Capk...
ICS
2010
Tsinghua U.
16 years 18 days ago
Robustness of the Learning with Errors Assumption
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are s...
Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod...
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
16 years 2 days ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
EUROSEC
2009
ACM
15 years 10 months ago
Deep packet anonymization
Network traces of Internet attacks are among the most valuable resources for network analysts and security researchers. However, organizations and researchers are usually reluctan...
Michalis Foukarakis, Demetres Antoniades, Michalis...
WISEC
2009
ACM
15 years 10 months ago
Mitigating control-channel jamming attacks in multi-channel ad hoc networks
We address the problem of control-channel jamming attacks in multi-channel ad hoc networks. Deviating from the traditional view that sees jamming attacks as a physical-layer vulne...
Loukas Lazos, Sisi Liu, Marwan Krunz