Sciweavers

2601 search results - page 200 / 521
» Secure Rewarding Schemes
Sort
View
131
Voted
WOTE
2010
15 years 1 months ago
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
We present a K-out-of-L voting scheme, i.e., a voting scheme that allows every voter to vote for (up to) K candidates from a set of L candidates. The scheme is receipt-free, which ...
Martin Hirt
CSFW
2009
IEEE
15 years 10 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal
IWNAS
2008
IEEE
15 years 10 months ago
Event-based Trust Framework Model in Wireless Sensor Networks
The security of wireless sensor networks is ever more important nowadays. Most of the proposed security protocols in wireless sensor networks are based on authentication and encry...
Haiguang Chen, Huafeng Wu, Jinchu Hu, Chuanshan Ga...
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
15 years 9 months ago
A Formal Treatment of Onion Routing
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
Jan Camenisch, Anna Lysyanskaya
134
Voted
EUROSEC
2010
ACM
15 years 8 months ago
The robustness of a new CAPTCHA
CAPTCHA is a standard security technology that presents tests to tell computers and humans apart. In this paper, we examine the security of a new CAPTCHA that was deployed until v...
Ahmad Salah El Ahmad, Jeff Yan, Lindsay Marshall