1769 search results - page 229 / 354 » Cryptography |
103
Voted
TCC
2010
Springer
15 years 11 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
106
Voted
TCC
2010
Springer
15 years 11 months ago
2010
Springer
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
121
click to vote
TCC
2010
Springer
15 years 11 months ago
2010
Springer
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...
143
click to vote
TCC
2010
Springer
15 years 11 months ago
2010
Springer
We construct a fully secure HIBE scheme with short ciphertexts. The previous construction of Boneh, Boyen, and Goh was only proven to be secure in the selective model, under a non...
118
click to vote
WISEC
2010
ACM
15 years 9 months ago
2010
ACM
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...