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, 2015 | 147 | 2015 |

Textbook non-malleable commitments V Goyal, O Pandey, S Richelson Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 118 | 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 | 87 | 2017 |

Towards doubly efficient private information retrieval R Canetti, J Holmgren, S Richelson Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017 | 67 | 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 | 59 | 2014 |

Round-optimal black-box two-party computation R Ostrovsky, S Richelson, A Scafuro Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference …, 2015 | 54 | 2015 |

Topology-hiding computation T Moran, I Orlov, S Richelson Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015 | 31 | 2015 |

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 | 22 | 2018 |

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 | 20 | 2021 |

Non-malleable commitments using Goldreich-Levin list decoding V Goyal, S Richelson 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 20 | 2019 |

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 | 19 | 2015 |

Adaptive security with quasi-optimal rate B Hemenway, R Ostrovsky, S Richelson, A Rosen Theory of Cryptography Conference, 525-541, 2015 | 12 | 2015 |

Concurrent zero knowledge in the bounded player model V Goyal, A Jain, R Ostrovsky, S Richelson, I Visconti Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013 …, 2013 | 12 | 2013 |

Constant-round concurrent zero knowledge in the bounded player model V Goyal, A Jain, R Ostrovsky, S Richelson, I Visconti Advances in Cryptology-ASIACRYPT 2013: 19th International Conference on the …, 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 | 8 | 2018 |

{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 | 7 | 2021 |

Haiku: Efficient authenticated key agreement with strong security guarantees for iot A Bin Rabiah, KK Ramakrishnan, S Richelson, A Bin Rabiah, E Liri, K Kar Proceedings of the 22nd International Conference on Distributed Computing …, 2021 | 3 | 2021 |

A lower bound for proving hardness of learning with rounding with polynomial modulus P Newton, S Richelson Annual International Cryptology Conference, 805-835, 2023 | 2 | 2023 |

MSS: Lightweight network authentication for resource constrained devices via Mergeable Stateful Signatures AB Rabiah, Y Shashwat, F Alharbi, S Richelson, N Abu-Ghazaleh 2021 IEEE 41st International Conference on Distributed Computing Systems …, 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 |