Obserwuj
Daniel Wichs
Tytuł
Cytowane przez
Cytowane przez
Rok
Separating succinct non-interactive arguments from all falsifiable assumptions
C Gentry, D Wichs
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
5662011
Multiparty computation with low communication, computation and interaction via threshold FHE
G Asharov, A Jain, A López-Alt, E Tromer, V Vaikuntanathan, D Wichs
Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference …, 2012
5652012
Proofs of retrievability via hardness amplification
Y Dodis, S Vadhan, D Wichs
Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009
5532009
Two round multiparty computation via multi-key FHE
P Mukherjee, D Wichs
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
4312016
Leakage-resilient public-key cryptography in the bounded-retrieval model
J Alwen, Y Dodis, D Wichs
Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009
3752009
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors
R Cramer, Y Dodis, S Fehr, C Padró, D Wichs
Annual International Conference on the Theory and Applications of …, 2008
3482008
Dynamic proofs of retrievability via oblivious RAM
D Cash, A Küpçü, D Wichs
Journal of Cryptology 30, 22-57, 2017
3182017
Cryptography against continuous memory attacks
Y Dodis, K Haralambiev, A López-Alt, D Wichs
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 511-520, 2010
2942010
Non-malleable codes
S Dziembowski, K Pietrzak, D Wichs
Journal of the ACM (JACM) 65 (4), 1-32, 2018
2922018
Leveled fully homomorphic signatures from standard lattices
S Gorbunov, V Vaikuntanathan, D Wichs
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
2862015
Optimizing ORAM and using it efficiently for secure computation
C Gentry, KA Goldman, S Halevi, C Julta, M Raykova, D Wichs
Privacy Enhancing Technologies: 13th International Symposium, PETS 2013 …, 2013
2602013
Public-key encryption in the bounded-retrieval model
J Alwen, Y Dodis, M Naor, G Segev, S Walfish, D Wichs
Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010
2582010
Learning with rounding, revisited: New reduction, properties and applications
J Alwen, S Krenn, K Pietrzak, D Wichs
Annual Cryptology Conference, 57-74, 2013
2372013
Efficient public-key cryptography in the presence of key leakage
Y Dodis, K Haralambiev, A López-Alt, D Wichs
Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the …, 2010
2182010
Fully homomorphic message authenticators
R Gennaro, D Wichs
International Conference on the Theory and Application of Cryptology and …, 2013
2152013
Fiat-Shamir: from practice to theory
R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum, ...
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
208*2019
Onion ORAM: A constant bandwidth blowup oblivious RAM
S Devadas, M van Dijk, CW Fletcher, L Ren, E Shi, D Wichs
Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2016
2052016
Non-malleable extractors and symmetric key cryptography from weak secrets
Y Dodis, D Wichs
Proceedings of the forty-first annual ACM Symposium on Theory of Computing …, 2009
1822009
Obfuscating compute-and-compare programs under LWE
D Wichs, G Zirdelis
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
1752017
Security analysis of pseudo-random number generators with input: /dev/random is not robust
Y Dodis, D Pointcheval, S Ruhault, D Vergniaud, D Wichs
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013
1682013
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20