default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaomi Sirkin
Person information
- affiliation: Cornell University, Ithaca, NY, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i9]Edward Kim, Isamu Isozaki, Naomi Sirkin, Michael P. Robson:
Generative Artificial Intelligence Consensus in a Trustless Network. CoRR abs/2307.01898 (2023)- 2022
- [j2]Naomi Ephraim
, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. J. ACM 69(5): 31:1-31:88 (2022) - [j1]Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin:
On the Complexity of Compressing Obfuscation. J. Cryptol. 35(3): 21 (2022) - [c6]Cody Freitag, Rafael Pass, Naomi Sirkin:
Parallelizable Delegation from LWE. TCC (2) 2022: 623-652 - [i8]Cody Freitag, Rafael Pass, Naomi Sirkin:
Parallelizable Delegation from LWE. IACR Cryptol. ePrint Arch. 2022: 1025 (2022) - 2021
- [c5]Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin:
Non-malleable Time-Lock Puzzles and Applications. TCC (3) 2021: 447-479 - 2020
- [c4]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Continuous Verifiable Delay Functions. EUROCRYPT (3) 2020: 125-154 - [c3]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) 2020: 707-737 - [i7]T.-H. Hubert Chan, Naomi Ephraim, Antonio Marcedone, Andrew Morgan, Rafael Pass, Elaine Shi:
Blockchain with Varying Number of Players. IACR Cryptol. ePrint Arch. 2020: 677 (2020) - [i6]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Malleable Time-Lock Puzzles and Applications. IACR Cryptol. ePrint Arch. 2020: 779 (2020) - [i5]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. IACR Cryptol. ePrint Arch. 2020: 994 (2020)
2010 – 2019
- 2019
- [c2]Michael Dinitz, Naomi Ephraim:
Reception Capacity: Definitions, Game Theory and Hardness. ALGOSENSORS 2019: 96-115 - [i4]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Continuous Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019: 619 (2019) - [i3]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On Perfect Correctness without Derandomization. IACR Cryptol. ePrint Arch. 2019: 1025 (2019) - 2018
- [c1]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On the Complexity of Compressing Obfuscation. CRYPTO (3) 2018: 753-783 - [i2]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On the Complexity of Compressing Obfuscation. IACR Cryptol. ePrint Arch. 2018: 552 (2018) - 2017
- [i1]Michael Dinitz, Naomi Ephraim:
Multicast Capacity Through Perfect Domination. CoRR abs/1702.03978 (2017)
Coauthor Index
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-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
