![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Silas Richelson
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2014
- [b1]Silas Richelson:
Cryptographic Protocols with Strong Security: Non-Malleable Commitments, Concurrent Zero-Knowledge and Topology-Hiding Multi-Party Computation. University of California, Los Angeles, USA, 2014
Journal Articles
- 2024
- [j2]Silas Richelson, Sourya Roy
:
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. IEEE Trans. Inf. Theory 70(2): 1040-1049 (2024) - 2021
- [j1]Vipul Goyal, Silas Richelson
, Alon Rosen
, Margarita Vald:
An Algebraic Approach to Nonmalleability. SIAM J. Comput. 50(5): 1537-1579 (2021)
Conference and Workshop Papers
- 2023
- [c19]Parker Newton, Silas Richelson:
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. CRYPTO (5) 2023: 805-835 - [c18]Silas Richelson, Sourya Roy:
Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes. FOCS 2023: 194-205 - [c17]Parker Newton, Silas Richelson
, Chase Wilson:
A High Dimensional Goldreich-Levin Theorem. STOC 2023: 1463-1474 - 2021
- [c16]Abdulrahman Bin Rabiah, K. K. Ramakrishnan, Silas Richelson, Ahmad Bin Rabiah, Elizabeth Liri, Koushik Kar:
Haiku: Efficient Authenticated Key Agreement with Strong Security Guarantees for IoT. ICDCN 2021: 196-205 - [c15]Abdulrahman Bin Rabiah, Yugarshi Shashwat, Fatemah Alharbi, Silas Richelson, Nael B. Abu-Ghazaleh:
MSS: Lightweight network authentication for resource constrained devices via Mergeable Stateful Signatures. ICDCS 2021: 282-292 - [c14]Fatemah Alharbi, Arwa Alrawais, Abdulrahman Bin Rabiah, Silas Richelson
, Nael B. Abu-Ghazaleh:
CSProp: Ciphertext and Signature Propagation Low-Overhead Public-Key Cryptosystem for IoT Environments. USENIX Security Symposium 2021: 609-626 - 2019
- [c13]Vipul Goyal, Silas Richelson
:
Non-Malleable Commitments using Goldreich-Levin List Decoding. FOCS 2019: 686-699 - [c12]Thibaut Horel, Sunoo Park, Silas Richelson
, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. ITCS 2019: 42:1-42:20 - 2017
- [c11]Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan:
Chosen-Ciphertext Secure Fully Homomorphic Encryption. Public Key Cryptography (2) 2017: 213-240 - [c10]Ran Canetti, Justin Holmgren, Silas Richelson:
Towards Doubly Efficient Private Information Retrieval. TCC (2) 2017: 694-726 - 2016
- [c9]Vipul Goyal, Omkant Pandey, Silas Richelson
:
Textbook non-malleable commitments. STOC 2016: 1128-1141 - [c8]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. TCC (A1) 2016: 209-224 - [c7]Brett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen:
Adaptive Security with Quasi-Optimal Rate. TCC (A1) 2016: 525-541 - 2015
- [c6]Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald:
Fast Non-Malleable Commitments. CCS 2015: 1048-1057 - [c5]Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro:
Round-Optimal Black-Box Two-Party Computation. CRYPTO (2) 2015: 339-358 - [c4]Tal Moran, Ilan Orlov, Silas Richelson:
Topology-Hiding Computation. TCC (1) 2015: 159-181 - 2014
- [c3]Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald:
An Algebraic Approach to Non-malleability. FOCS 2014: 41-50 - 2013
- [c2]Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti:
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model. ASIACRYPT (1) 2013: 21-40 - [c1]Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti:
Concurrent Zero Knowledge in the Bounded Player Model. TCC 2013: 60-79
Informal and Other Publications
- 2024
- [i17]Abdulrahman Bin Rabiah, Anas Alsoliman, Yugarshi Shashwat, Silas Richelson, Nael B. Abu-Ghazaleh:
Token-based Vehicular Security System (TVSS): Scalable, Secure, Low-latency Public Key Infrastructure for Connected Vehicles. CoRR abs/2402.18365 (2024) - 2023
- [i16]Parker Newton, Silas Richelson, Chase Wilson:
A High Dimensional Goldreich-Levin Theorem. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i15]Silas Richelson, Sourya Roy:
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. CoRR abs/2201.11166 (2022) - [i14]Silas Richelson
, Sourya Roy:
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. Electron. Colloquium Comput. Complex. TR22 (2022) - [i13]Silas Richelson
, Sourya Roy:
List-Decoding Random Walk XOR Codes Near the Johnson Bound. Electron. Colloquium Comput. Complex. TR22 (2022) - [i12]Parker Newton, Silas Richelson
:
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. IACR Cryptol. ePrint Arch. 2022: 727 (2022) - 2019
- [i11]Silas Richelson
, Sourya Roy:
Locally Testable Non-Malleable Codes. Electron. Colloquium Comput. Complex. TR19 (2019) - [i10]Vipul Goyal, Silas Richelson:
Non-Malleable Commitments Using Goldreich-Levin List Decoding. IACR Cryptol. ePrint Arch. 2019: 1195 (2019) - 2018
- [i9]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. CoRR abs/1802.07381 (2018) - [i8]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. IACR Cryptol. ePrint Arch. 2018: 212 (2018) - 2017
- [i7]Ran Canetti, Justin Holmgren, Silas Richelson:
Towards Doubly Efficient Private Information Retrieval. IACR Cryptol. ePrint Arch. 2017: 568 (2017) - 2015
- [i6]Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro:
Round-Optimal Black-Box Two-Party Computation. IACR Cryptol. ePrint Arch. 2015: 553 (2015) - [i5]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. IACR Cryptol. ePrint Arch. 2015: 769 (2015) - [i4]Vipul Goyal, Omkant Pandey, Silas Richelson:
Textbook Non-Malleable Commitments. IACR Cryptol. ePrint Arch. 2015: 1178 (2015) - 2014
- [i3]Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald:
An Algebraic Approach to Non-Malleability. IACR Cryptol. ePrint Arch. 2014: 586 (2014) - [i2]Tal Moran, Ilan Orlov, Silas Richelson:
Topology-Hiding Computation. IACR Cryptol. ePrint Arch. 2014: 1022 (2014) - 2012
- [i1]Abhishek Jain
, Rafail Ostrovsky, Silas Richelson, Ivan Visconti:
Concurrent Zero Knowledge in the Bounded Player Model. IACR Cryptol. ePrint Arch. 2012: 279 (2012)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint