Silas Richelson

Orcid: 0009-0005-1482-0338

According to our database1, Silas Richelson authored at least 26 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Token-based Vehicular Security System (TVSS): Scalable, Secure, Low-latency Public Key Infrastructure for Connected Vehicles.
CoRR, 2024

2023
A High Dimensional Goldreich-Levin Theorem.
Electron. Colloquium Comput. Complex., 2023

Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus.
IACR Cryptol. ePrint Arch., 2022

List-Decoding Random Walk XOR Codes Near the Johnson Bound.
Electron. Colloquium Comput. Complex., 2022

Analyzing Ta-Shma's Code via the Expander Mixing Lemma.
Electron. Colloquium Comput. Complex., 2022

2021
An Algebraic Approach to Nonmalleability.
SIAM J. Comput., 2021

CSProp: Ciphertext and Signature Propagation Low-Overhead Public-Key Cryptosystem for IoT Environments.
Proceedings of the 30th USENIX Security Symposium, 2021

MSS: Lightweight network authentication for resource constrained devices via Mergeable Stateful Signatures.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Haiku: Efficient Authenticated Key Agreement with Strong Security Guarantees for IoT.
Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2019
Non-Malleable Commitments Using Goldreich-Levin List Decoding.
IACR Cryptol. ePrint Arch., 2019

Locally Testable Non-Malleable Codes.
Electron. Colloquium Comput. Complex., 2019

2018
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts.
IACR Cryptol. ePrint Arch., 2018

2017
Towards Doubly Efficient Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2017

Chosen-Ciphertext Secure Fully Homomorphic Encryption.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

2016
Adaptive Security with Quasi-Optimal Rate.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015
Round-Optimal Black-Box Two-Party Computation.
IACR Cryptol. ePrint Arch., 2015

Textbook Non-Malleable Commitments.
IACR Cryptol. ePrint Arch., 2015

On the Hardness of Learning with Rounding over Small Modulus.
IACR Cryptol. ePrint Arch., 2015

Fast Non-Malleable Commitments.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Cryptographic Protocols with Strong Security: Non-Malleable Commitments, Concurrent Zero-Knowledge and Topology-Hiding Multi-Party Computation.
PhD thesis, 2014

Topology-Hiding Computation.
IACR Cryptol. ePrint Arch., 2014

An Algebraic Approach to Non-Malleability.
IACR Cryptol. ePrint Arch., 2014

2013
Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Concurrent Zero Knowledge in the Bounded Player Model.
IACR Cryptol. ePrint Arch., 2012


  Loading...