Kamu erişimi zorunlu olan makaleler - Tal MalkinDaha fazla bilgi edinin
Hiçbir yerde sunulmuyor: 1
XSPIR: Efficient symmetrically private information retrieval from ring-LWE
C Lin, Z Liu, T Malkin
European Symposium on Research in Computer Security, 217-236, 2022
Zorunlu olanlar: US Department of Energy
Bir yerde sunuluyor: 29
Garbling gadgets for boolean and arithmetic circuits
M Ball, T Malkin, M Rosulek
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
Zorunlu olanlar: US National Science Foundation
Garbled neural networks are practical
M Ball, B Carmer, T Malkin, M Rosulek, N Schimanski
Cryptology ePrint Archive, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Non-malleable codes for bounded depth, bounded fan-in circuits
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
Zorunlu olanlar: US National Science Foundation
Non-malleable codes for small-depth circuits
M Ball, D Dachman-Soled, S Guo, T Malkin, LY Tan
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Non-malleable codes from average-case hardness:, decision trees, and streaming space-bounded tampering
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Annual International Conference on the Theory and Applications of …, 2018
Zorunlu olanlar: US National Science Foundation, US Department of Defense
The power of negations in cryptography
S Guo, T Malkin, IC Oliveira, A Rosen
Theory of Cryptography Conference, 36-65, 2015
Zorunlu olanlar: Research Grants Council, Hong Kong
A simple obfuscation scheme for pattern-matching with wildcards
A Bishop, L Kowalczyk, T Malkin, V Pastro, M Raykova, K Shi
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Non-malleable codes against bounded polynomial time tampering
M Ball, D Dachman-Soled, M Kulkarni, H Lin, T Malkin
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense
On the complexity of decomposable randomized encodings, or: How friendly can a garbling-friendly PRF be?
M Ball, J Holmgren, Y Ishai, T Liu, T Malkin
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 86 …, 2020
Zorunlu olanlar: US National Science Foundation, US Department of Defense, US Office of the …
Hardness of non-interactive differential privacy from one-way functions
L Kowalczyk, T Malkin, J Ullman, D Wichs
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Gage MPC: bypassing residual function leakage for non-interactive MPC
G Almashaqbeh, F Benhamouda, S Han, D Jaroslawicz, T Malkin, A Nicita, ...
Cryptology ePrint Archive, 2021
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Exploring the boundaries of topology-hiding computation
M Ball, E Boyle, T Malkin, T Moran
Annual International Conference on the Theory and Applications of …, 2018
Zorunlu olanlar: US National Science Foundation, US Department of Defense, European Commission
Strong hardness of privacy from weak traitor tracing
L Kowalczyk, T Malkin, J Ullman, M Zhandry
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
Zorunlu olanlar: US National Science Foundation
Randomness extraction from somewhat dependent sources
M Ball, O Goldreich, T Malkin
13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 12 …, 2022
Zorunlu olanlar: US Department of Defense, US Office of the Director of National Intelligence …
Public-key function-private hidden vector encryption (and more)
J Bartusek, B Carmer, A Jain, Z Jin, T Lepoint, F Ma, T Malkin, ...
International Conference on the Theory and Application of Cryptology and …, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Is information-theoretic topology-hiding computation possible?
M Ball, E Boyle, R Cohen, T Malkin, T Moran
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense, US Office of the …
Non-malleability against polynomial tampering
M Ball, E Chattopadhyay, JJ Liao, T Malkin, LY Tan
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
Zorunlu olanlar: US National Science Foundation, US Department of Defense, US Office of the …
Limits to non-malleability
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Cryptology ePrint Archive, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense, US Office of the …
Topology-hiding communication from minimal assumptions
M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran
Journal of Cryptology 36 (4), 39, 2023
Zorunlu olanlar: US National Science Foundation, US Department of Energy, US Department of …
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir