Sciweavers

1769 search results - page 159 / 354
» Cryptography
Sort
View
TCC
2009
Springer
154views Cryptology» more  TCC 2009»
16 years 4 months ago
Fairness with an Honest Minority and a Rational Majority
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...
Shien Jin Ong, David C. Parkes, Alon Rosen, Salil ...
130
Voted
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
16 years 4 months ago
On the (Im)Possibility of Key Dependent Encryption
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...
Iftach Haitner, Thomas Holenstein
TCC
2009
Springer
160views Cryptology» more  TCC 2009»
16 years 4 months ago
Simple, Black-Box Constructions of Adaptively Secure Protocols
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...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
133
Voted
PKC
2009
Springer
115views Cryptology» more  PKC 2009»
16 years 4 months ago
Compact CCA-Secure Encryption for Messages of Arbitrary Length
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...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
PERCOM
2007
ACM
16 years 3 months ago
Identity-Based Encryption for Sensor Networks
In spite of several years of intense research, the area of security and cryptography in Wireless Sensor Networks (WSNs) still has a number of open problems. On the other hand, the...
Leonardo B. Oliveira, Ricardo Dahab, Julio L&oacut...