Silas Richelson

CoRR, 2024

2023

A High Dimensional Goldreich-Levin Theorem.

[BibT_eX]

[DOI]

Parker Newton

Chase Wilson

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus.

[BibT_eX]

[DOI]

Parker Newton

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022

List-Decoding Random Walk XOR Codes Near the Johnson Bound.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

Analyzing Ta-Shma's Code via the Expander Mixing Lemma.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

2021

An Algebraic Approach to Nonmalleability.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

CSProp: Ciphertext and Signature Propagation Low-Overhead Public-Key Cryptosystem for IoT Environments.

[BibT_eX]

[DOI]

Fatemah Alharbi

Arwa Alrawais

Nael B. Abu-Ghazaleh

Proceedings of the 30th USENIX Security Symposium, 2021

MSS: Lightweight network authentication for resource constrained devices via Mergeable Stateful Signatures.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Haiku: Efficient Authenticated Key Agreement with Strong Security Guarantees for IoT.

[BibT_eX]

[DOI]

Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2019

Locally Testable Non-Malleable Codes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Non-Malleable Commitments using Goldreich-Levin List Decoding.

[BibT_eX]

[DOI]

Vipul Goyal

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017

Towards Doubly Efficient Private Information Retrieval.

[BibT_eX]

[DOI]

Ran Canetti

Justin Holmgren

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Chosen-Ciphertext Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Ran Canetti

Srinivasan Raghuraman

Vinod Vaikuntanathan

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

2016

Adaptive Security with Quasi-Optimal Rate.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

On the Hardness of Learning with Rounding over Small Modulus.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Textbook non-malleable commitments.

[BibT_eX]

[DOI]

Vipul Goyal

Omkant Pandey

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015

Topology-Hiding Computation.

[BibT_eX]

[DOI]

Tal Moran

Ilan Orlov

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Round-Optimal Black-Box Two-Party Computation.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Alessandra Scafuro

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Fast Non-Malleable Commitments.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]