2967 search results - page 415 / 594 » Cryptology |
172
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a s...
163
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
162
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
162
click to vote
PKC
2009
Springer
16 years 6 months ago
2009
Springer
This paper proposes a chosen-ciphertext secure variant of the ElGamal public-key encryption scheme which generates very compact ciphertexts for messages of arbitrary length. The ci...
131
click to vote
TCC
2010
Springer
16 years 2 months ago
2010
Springer
Aumann and Lindell defined security against covert attacks, where the adversary is malicious, but is only caught cheating with a certain probability, where the idea is that in man...