Sciweavers

34 search results - page 6 / 7
» tcc 2010
Sort
View
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 2 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 2 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
TCC
2010
Springer
324views Cryptology» more  TCC 2010»
14 years 2 months ago
Leakage-Resilient Signatures
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to ...
Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, G...
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 16 days ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
PAIRING
2010
Springer
116views Cryptology» more  PAIRING 2010»
13 years 4 months ago
Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts
Lewko and Waters [Eurocrypt 2010] presented a fully secure HIBE with short ciphertexts. In this paper we show how to modify their construction to achieve anonymity. We prove the s...
Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano