Suivre
Ron Rothblum
Ron Rothblum
Adresse e-mail validée de cs.technion.ac.il - Page d'accueil
Titre
Citée par
Citée par
Année
Constant-round interactive proofs for delegating computation
O Reingold, GN Rothblum, RD Rothblum
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing …, 2016
2392016
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
1862019
How to delegate computations: The power of no-signaling proofs
YT Kalai, R Raz, RD Rothblum
Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 485-494, 2014
1612014
Spooky encryption and its applications
Y Dodis, S Halevi, RD Rothblum, D Wichs
Annual Cryptology Conference, 93-122, 2016
1322016
Homomorphic encryption: From private-key to public-key
R Rothblum
Theory of cryptography conference, 219-234, 2011
1132011
Fiat-Shamir and correlation intractability from strong KDM-secure encryption
R Canetti, Y Chen, L Reyzin, RD Rothblum
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
1042018
From Obfuscation to the Security of Fiat-Shamir for Proofs
YT Kalai, GN Rothblum, RD Rothblum
Cryptology ePrint Archive, Report 2016/303, 2016. http://eprint. iacr. org …, 2016
1022016
Delegation for bounded space
Y Tauman Kalai, R Raz, RD Rothblum
Proceedings of the 45th annual ACM symposium on Symposium on theory of …, 2013
862013
On the circular security of bit-encryption
RD Rothblum
Theory of Cryptography, 579-598, 2013
802013
Non-interactive proofs of proximity
T Gur, RD Rothblum
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
752015
Distinguisher-Dependent Simulation in Two Rounds and its Applications
A Jain, YT Kalai, D Khurana, R Rothblum
IACR Cryptology ePrint Archive, 2017: 330, 2017
702017
Time-and space-efficient arguments from groups of unknown order
AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
652021
Fiat-shamir from simpler assumptions
R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum
Cryptology ePrint Archive, Report 2018/1004, 2018. http://eprint. iacr. org, 2018
612018
Local Proofs Approaching the Witness Length
N Ron-Zewi, RD Rothblum
Cryptology ePrint Archive, Report 2019/1062. 2019. URL: https://eprint. iacr …, 2019
522019
Enhancements of Trapdoor Permutations
O Goldreich, RD Rothblum
Journal of Cryptology, 1-29, 2013
492013
Efficient multiparty protocols via log-depth threshold formulae
G Cohen, IB Damgård, Y Ishai, J Kölker, PB Miltersen, R Raz, ...
Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013
422013
Multi-collision resistant hash functions and their applications
I Berman, A Degwekar, RD Rothblum, PN Vasudevan
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
412018
New constructions of reusable designated-verifier NIZKs
A Lombardi, W Quach, RD Rothblum, D Wichs, DJ Wu
IACR Cryptology ePrint Archive, 2019
402019
Delegating computations with (almost) minimal time and space overhead
J Holmgren, R Rothblum
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
382018
Fiat–shamir via list-recoverable codes (or: parallel repetition of gmw is not zero-knowledge)
J Holmgren, A Lombardi, RD Rothblum
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
362021
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20