Silas Richelson

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Gilbert and Varshamov meet Johnson: list-decoding explicit nearly-optimal binary codes	2025-08-15	Paper
Non-malleable commitments using Goldreich-Levin list decoding	2025-08-12	Paper
An algebraic approach to non-malleability	2025-08-05	Paper
Analyzing Ta-Shma's code via the expander mixing lemma IEEE Transactions on Information Theory	2024-07-22	Paper
A high dimensional Goldreich-Levin theorem	2024-05-08	Paper
A lower bound for proving hardness of learning with rounding with polynomial modulus Advances in Cryptology – CRYPTO 2023	2024-02-06	Paper
scientific article; zbMATH DE number 7559085 (Why is no real title available?) (available as arXiv preprint)	2022-07-18	Paper
An Algebraic Approach to Nonmalleability SIAM Journal on Computing	2021-10-18	Paper
Towards doubly efficient private information retrieval	2018-01-19	Paper
Textbook non-malleable commitments Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
Chosen-Ciphertext Secure Fully Homomorphic Encryption Lecture Notes in Computer Science	2017-06-13	Paper
Adaptive security with quasi-optimal rate Theory of Cryptography	2016-03-23	Paper
On the hardness of learning with rounding over small modulus Theory of Cryptography	2016-03-23	Paper
Round-optimal black-box two-party computation Lecture Notes in Computer Science	2015-12-10	Paper
Topology-hiding computation Theory of Cryptography	2015-07-06	Paper
Constant-round concurrent zero knowledge in the bounded player model Advances in Cryptology - ASIACRYPT 2013	2013-12-10	Paper
Concurrent zero knowledge in the bounded player model Theory of Cryptography	2013-03-18	Paper

Research outcomes over time

This page was built for person: Silas Richelson