Silas Richelson

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