Silas Richelson

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 32

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

CoRR

FOCS

University of California, Los Angeles, USA (PHD)

Education History

University of California, Los Angeles, USA

PHD

Publications

Abdulrahman Bin Rabiah, Anas Alsoliman, Yugarshi Shashwat, Silas Richelson, Nael B. Abu-Ghazaleh
Token-based Vehicular Security System (TVSS): Scalable, Secure, Low-latency Public Key Infrastructure for Connected Vehicles. CoRR (2024)
Silas Richelson, Sourya Roy
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. IEEE Trans. Inf. Theory 70 (2) (2024)
Silas Richelson, Sourya Roy
Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes. FOCS (2023)
Parker Newton, Silas Richelson, Chase Wilson
A High Dimensional Goldreich-Levin Theorem. STOC (2023)
Parker Newton, Silas Richelson, Chase Wilson
A High Dimensional Goldreich-Levin Theorem. Electron. Colloquium Comput. Complex. (2023)
Parker Newton, Silas Richelson
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. IACR Cryptol. ePrint Arch. 2022 (2022)
Parker Newton, Silas Richelson
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. CRYPTO (5) (2022)
Silas Richelson, Sourya Roy
List-Decoding Random Walk XOR Codes Near the Johnson Bound. Electron. Colloquium Comput. Complex. (2022)
Silas Richelson, Sourya Roy
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. Electron. Colloquium Comput. Complex. 29 (2022)
Silas Richelson, Sourya Roy
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. CoRR (2022)
Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
An Algebraic Approach to Nonmalleability. SIAM J. Comput. 50 (5) (2021)
Abdulrahman Bin Rabiah, K. K. Ramakrishnan, Silas Richelson, Ahmad Bin Rabiah, Elizabeth Liri, Koushik Kar
Haiku: Efficient Authenticated Key Agreement with Strong Security Guarantees for IoT. ICDCN (2021)
Abdulrahman Bin Rabiah, Yugarshi Shashwat, Fatemah Alharbi, Silas Richelson, Nael B. Abu-Ghazaleh
MSS: Lightweight network authentication for resource constrained devices via Mergeable Stateful Signatures. ICDCS (2021)
Fatemah Alharbi, Arwa Alrawais, Abdulrahman Bin Rabiah, Silas Richelson, Nael B. Abu-Ghazaleh
CSProp: Ciphertext and Signature Propagation Low-Overhead Public-Key Cryptosystem for IoT Environments. USENIX Security Symposium (2021)
Silas Richelson, Sourya Roy
Locally Testable Non-Malleable Codes. Electron. Colloquium Comput. Complex. 26 (2019)
Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. ITCS (2019)
Vipul Goyal, Silas Richelson
Non-Malleable Commitments Using Goldreich-Levin List Decoding. IACR Cryptol. ePrint Arch. 2019 (2019)
Vipul Goyal, Silas Richelson
Non-Malleable Commitments using Goldreich-Levin List Decoding. FOCS (2019)
Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. IACR Cryptol. ePrint Arch. 2018 (2018)
Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. CoRR (2018)
Ran Canetti, Justin Holmgren, Silas Richelson
Towards Doubly Efficient Private Information Retrieval. TCC (2) (2017)
Ran Canetti, Justin Holmgren, Silas Richelson
Towards Doubly Efficient Private Information Retrieval. IACR Cryptol. ePrint Arch. 2017 (2017)
Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan
Chosen-Ciphertext Secure Fully Homomorphic Encryption. Public Key Cryptography (2) (2017)
Vipul Goyal, Omkant Pandey, Silas Richelson
Textbook non-malleable commitments. STOC (2016)
Brett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen
Adaptive Security with Quasi-Optimal Rate. TCC (A1) (2016)
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen
On the Hardness of Learning with Rounding over Small Modulus. TCC (A1) (2016)
Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
Fast Non-Malleable Commitments. CCS (2015)
Tal Moran, Ilan Orlov, Silas Richelson
Topology-Hiding Computation. TCC (1) (2015)
Vipul Goyal, Omkant Pandey, Silas Richelson
Textbook Non-Malleable Commitments. IACR Cryptol. ePrint Arch. 2015 (2015)
Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro
Round-Optimal Black-Box Two-Party Computation. CRYPTO (2) (2015)
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen
On the Hardness of Learning with Rounding over Small Modulus. IACR Cryptol. ePrint Arch. 2015 (2015)
Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro
Round-Optimal Black-Box Two-Party Computation. IACR Cryptol. ePrint Arch. 2015 (2015)
Tal Moran, Ilan Orlov, Silas Richelson
Topology-Hiding Computation. IACR Cryptol. ePrint Arch. 2014 (2014)
Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
An Algebraic Approach to Non-Malleability. IACR Cryptol. ePrint Arch. 2014 (2014)
Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
An Algebraic Approach to Non-malleability. FOCS (2014)
Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model. ASIACRYPT (1) (2013)
Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti
Concurrent Zero Knowledge in the Bounded Player Model. TCC (2013)
Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti
Concurrent Zero Knowledge in the Bounded Player Model. IACR Cryptol. ePrint Arch. 2012 (2012)

Silas Richelson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Silas Richelson