Sciweavers

TCC
2016
Springer
43views Cryptology» more  TCC 2016»
10 years 16 days ago
On Basing Private Information Retrieval on NP-Hardness
Tianren Liu, Vinod Vaikuntanathan
TCC
2016
Springer
47views Cryptology» more  TCC 2016»
10 years 16 days ago
On the Correlation Intractability of Obfuscated Pseudorandom Functions
Ran Canetti, Yilei Chen, Leonid Reyzin
TCC
2016
Springer
44views Cryptology» more  TCC 2016»
10 years 16 days ago
Non-Malleable Encryption: Simpler, Shorter, Stronger
Sandro Coretti, Yevgeniy Dodis, Björn Tackman...
TCC
2016
Springer
47views Cryptology» more  TCC 2016»
10 years 16 days ago
How to Avoid Obfuscation Using Witness PRFs
We propose a new cryptographic primitive called witness pseudorandom functions (witness PRFs). Witness PRFs are related to witness encryption, but appear strictly stronger: we sho...
Mark Zhandry
TCC
2016
Springer
44views Cryptology» more  TCC 2016»
10 years 16 days ago
Information-Theoretic Local Non-malleable Codes and Their Applications
Abstract. Error correcting codes, though powerful, are only applicable in scenarios where the adversarial channel does not introduce “too many” errors into the codewords. Yet, ...
Nishanth Chandran, Bhavana Kanukurthi, Srinivasan ...