Sciweavers

Share
39 search results - page 1 / 8
» tcc 2009
Sort
View
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
9 years 10 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz
TCC
2009
Springer
114views Cryptology» more  TCC 2009»
9 years 10 months ago
Predicate Privacy in Encryption Systems
Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generat...
Emily Shen, Elaine Shi, Brent Waters
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
9 years 10 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
112views Cryptology» more  TCC 2009»
9 years 10 months ago
Non-malleable Obfuscation
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
Ran Canetti, Mayank Varia
books