| On the hardness of learning with rounding over small modulus A Bogdanov, S Guo, D Masny, S Richelson, A Rosen Theory of Cryptography Conference, 209-224, 2016 | 114 | 2016 |
| Textbook non-malleable commitments V Goyal, O Pandey, S Richelson Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 99 | 2016 |
| Chosen-ciphertext secure fully homomorphic encryption R Canetti, S Raghuraman, S Richelson, V Vaikuntanathan IACR International Workshop on Public Key Cryptography, 213-240, 2017 | 64 | 2017 |
| An algebraic approach to non-malleability V Goyal, S Richelson, A Rosen, M Vald 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 41-50, 2014 | 53 | 2014 |
| Round-optimal black-box two-party computation R Ostrovsky, S Richelson, A Scafuro Annual Cryptology Conference, 339-358, 2015 | 45 | 2015 |
| Towards doubly efficient private information retrieval R Canetti, J Holmgren, S Richelson Theory of Cryptography Conference, 694-726, 2017 | 37 | 2017 |
| Topology-hiding computation T Moran, I Orlov, S Richelson Theory of Cryptography Conference, 159-181, 2015 | 27 | 2015 |
| Fast non-malleable commitments H Brenner, V Goyal, S Richelson, A Rosen, M Vald Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015 | 16 | 2015 |
| Constant-round concurrent zero knowledge in the bounded player model V Goyal, A Jain, R Ostrovsky, S Richelson, I Visconti International Conference on the Theory and Application of Cryptology and …, 2013 | 14 | 2013 |
| How to subvert backdoored encryption: security against adversaries that decrypt all ciphertexts T Horel, S Park, S Richelson, V Vaikuntanathan arXiv preprint arXiv:1802.07381, 2018 | 13 | 2018 |
| Non-malleable commitments using Goldreich-Levin list decoding V Goyal, S Richelson 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 12 | 2019 |
| Adaptive security with quasi-optimal rate B Hemenway, R Ostrovsky, S Richelson, A Rosen Theory of Cryptography Conference, 525-541, 2016 | 12 | 2016 |
| Concurrent zero knowledge in the bounded player model V Goyal, A Jain, R Ostrovsky, S Richelson, I Visconti Theory of Cryptography Conference, 60-79, 2013 | 12 | 2013 |
| Non-malleable commitments from non-malleable extractors V Goyal, A Kumar, S Park, S Richelson, A Srinivasan Manuscript, accessed via personal communication, 2018 | 7 | 2018 |
| An Algebraic Approach to Nonmalleability V Goyal, S Richelson, A Rosen, M Vald SIAM Journal on Computing 50 (5), 1537-1579, 2021 | 2 | 2021 |
| {CSProp}: Ciphertext and Signature Propagation {Low-Overhead}{Public-Key} Cryptosystem for {IoT} Environments F Alharbi, A Alrawais, AB Rabiah, S Richelson, N Abu-Ghazaleh 30th USENIX Security Symposium (USENIX Security 21), 609-626, 2021 | 2 | 2021 |
| An FPGA-based Programmable Vector Engine for Fast Fully Homomorphic Encryption over the Torus S Gener, P Newton, D Tan, S Richelson, G Lemieux, P Brisk SPSL: Secure and Private Systems for Machine Learning (ISCA Workshop), 2021 | 2 | 2021 |
| Cryptographic Protocols with Strong Security: Non-Malleable Commitments, Concurrent Zero-Knowledge and Topology-Hiding Multi-Party Computation S Richelson UCLA, 2014 | 2 | 2014 |
| Concurrent Zero Knowledge in the Bounded Player Model. A Jain, R Ostrovsky, S Richelson, I Visconti IACR Cryptol. ePrint Arch. 2012, 279, 2012 | 2 | 2012 |
| Analyzing Ta-Shma's Code via the Expander Mixing Lemma S Richelson, S Roy arXiv preprint arXiv:2201.11166, 2022 | | 2022 |
