Suivre
Máté Horváth
Máté Horváth
Postdoc, University of Wuppertal
Adresse e-mail validée de crysys.hu - Page d'accueil
Titre
Citée par
Citée par
Année
Attribute-based encryption optimized for cloud computing
M Horváth
SOFSEM 2015: Theory and Practice of Computer Science - 41st International …, 2015
902015
Cryptographic Obfuscation A Survey
M Horváth, L Buttyán
Springer International Publishing, 2020
29*2020
The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications
IA Seres, M Horváth, P Burcsi
Applicable Algebra in Engineering, Communication and Computing, 1-31, 2023
182023
Problem domain analysis of iot-driven secure data markets
M Horváth, L Buttyán
Security in Computer and Information Sciences: First International ISCIS …, 2018
72018
Security analysis of the whatsapp end-to-end encrypted backup protocol
GT Davies, S Faller, K Gellert, T Handirk, J Hesse, M Horváth, T Jager
Annual International Cryptology Conference, 330-361, 2023
52023
Searchable Symmetric Encryption for Restricted Search
M Horvath, I Vajda
Journal of Communications Software and Systems 14 (1), 104-111, 2018
32018
Searchable symmetric encryption: Sequential scan can be practical
M Horváth, I Vajda
2017 25th International Conference on Software, Telecommunications and …, 2017
32017
Private key delegation in attribute-based encryption
M Horváth
Mesterproba Conference of the Budapest University of Technology and …, 2015
22015
There Is Always an Exception: Controlling Partial Information Leakage in Secure Computation
M Horváth, L Buttyán, G Székely, D Neubrandt
Information Security and Cryptology–ICISC 2019: 22nd International …, 2020
12020
Cryptographic Problems in the Context of Data Markets
M Horváth
Budapest University of Technology and Economics, Hungary, 2021
2021
The cost of having been pwned: a security service provider’s perspective
G Biczók, M Horváth, S Szebeni, I Lám, L Buttyán
Emerging Technologies for Authorization and Authentication: Third …, 2020
2020
Le systčme ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–11