Silas Richelson

Available identifiers

zbMath Open richelson.silasMaRDI QIDQ1690291

List of research outcomes

Publication	Date of Publication	Type
Analyzing Ta-Shma's code via the expander mixing lemma	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	2024-02-06	Paper
https://portal.mardi4nfdi.de/entity/Q5090419	2022-07-18	Paper
An Algebraic Approach to Nonmalleability	2021-10-18	Paper
Towards doubly efficient private information retrieval	2018-01-19	Paper
Textbook non-malleable commitments	2017-09-29	Paper
Chosen-Ciphertext Secure Fully Homomorphic Encryption	2017-06-13	Paper
Adaptive Security with Quasi-Optimal Rate	2016-03-23	Paper
On the Hardness of Learning with Rounding over Small Modulus	2016-03-23	Paper
Round-Optimal Black-Box Two-Party Computation	2015-12-10	Paper
Topology-Hiding Computation	2015-07-06	Paper
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model	2013-12-10	Paper
Concurrent Zero Knowledge in the Bounded Player Model	2013-03-18	Paper

Research outcomes over time

This page was built for person: Silas Richelson