default search action
Cody Freitag
Person information
- affiliation: Cornell University, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Cody Freitag, Omer Paneth, Rafael Pass:
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. EUROCRYPT (4) 2024: 112-141 - 2023
- [c16]Nirvan Tyagi
, Arasu Arun
Riggs: Decentralized Sealed-Bid Auctions. CCS 2023: 1227-1241 - [c15]Cody Freitag, Ilan Komargodski:
The Cost of Statistical Security in Proofs for Repeated Squaring. ITC 2023: 4:1-4:23 - [c14]Cody Freitag, Brent Waters, David J. Wu:
How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More. CRYPTO (4) 2023: 498-531 - [c13]Cody Freitag
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. EUROCRYPT (4) 2023: 440-469 - [i14]Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski:
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. IACR Cryptol. ePrint Arch. 2023: 348 (2023) - [i13]Cody Freitag, Brent Waters, David J. Wu:
How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More. IACR Cryptol. ePrint Arch. 2023: 812 (2023) - [i12]Nirvan Tyagi, Arasu Arun, Cody Freitag, Riad Wahby, Joseph Bonneau, David Mazières:
Riggs: Decentralized Sealed-Bid Auctions. IACR Cryptol. ePrint Arch. 2023: 1336 (2023) - 2022
- [j2]Naomi Ephraim
SPARKs: Succinct Parallelizable Arguments of Knowledge. J. ACM 69(5): 31:1-31:88 (2022) - [c12]Cody Freitag
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. CRYPTO (3) 2022: 131-160 - [c11]Benjamin Y. Chan
Universal Reductions: Reductions Relative to Stateful Oracles. TCC (3) 2022: 151-180 - [c10]Cody Freitag
Parallelizable Delegation from LWE. TCC (2) 2022: 623-652 - [i11]Benjamin Y. Chan, Cody Freitag, Rafael Pass:
Cosmic Security. IACR Cryptol. ePrint Arch. 2022: 156 (2022) - [i10]Cody Freitag, Ilan Komargodski:
The Cost of Statistical Security in Interactive Proofs for Repeated Squaring. IACR Cryptol. ePrint Arch. 2022: 766 (2022) - [i9]Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski:
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. IACR Cryptol. ePrint Arch. 2022: 1009 (2022) - [i8]Cody Freitag, Rafael Pass, Naomi Sirkin:
Parallelizable Delegation from LWE. IACR Cryptol. ePrint Arch. 2022: 1025 (2022) - 2021
- [j1]Jayadev Acharya
Inference Under Information Constraints III: Local Privacy Constraints. IEEE J. Sel. Areas Inf. Theory 2(1): 253-267 (2021) - [c9]Cody Freitag, Ilan Komargodski, Rafael Pass
Non-malleable Time-Lock Puzzles and Applications. TCC (3) 2021: 447-479 - [i7]Jayadev Acharya, Clément L. Canonne, Cody Freitag, Ziteng Sun, Himanshu Tyagi:
Inference under Information Constraints III: Local Privacy Constraints. CoRR abs/2101.07981 (2021) - 2020
- [c8]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
Continuous Verifiable Delay Functions. EUROCRYPT (3) 2020: 125-154 - [c7]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) 2020: 707-737 - [c6]Cody Freitag, Ilan Komargodski, Rafael Pass
Impossibility of Strong KDM Security with Auxiliary Input. SCN 2020: 512-524 - [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
- [c5]Jayadev Acharya, Clément L. Canonne, Cody Freitag, Himanshu Tyagi:
Test without Trust: Optimal Locally Private Distribution Testing. AISTATS 2019: 2067-2076 - [c4]Cody Freitag, Ilan Komargodski, Rafael Pass
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. CRYPTO (3) 2019: 98-127 - [i4]Cody Freitag, Ilan Komargodski, Rafael Pass:
Impossibility of Strong KDM Security with Auxiliary Input. IACR Cryptol. ePrint Arch. 2019: 293 (2019) - [i3]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Continuous Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019: 619 (2019) - [i2]Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. IACR Cryptol. ePrint Arch. 2019: 631 (2019) - 2018
- [i1]Jayadev Acharya, Clément L. Canonne, Cody Freitag, Himanshu Tyagi:
Test without Trust: Optimal Locally Private Distribution Testing. CoRR abs/1808.02174 (2018) - 2017
- [c3]Cody Freitag, Rishab Goyal, Susan Hohenberger, Venkata Koppula, Eysa Lee, Tatsuaki Okamoto, Jordan Tran, Brent Waters:
Signature Schemes with Randomized Verification. ACNS 2017: 373-389 - [c2]Cody R. Freitag, Eric Price, William J. Swartworth:
Testing Hereditary Properties of Sequences. APPROX-RANDOM 2017: 44:1-44:10 - [c1]Cody Freitag, Jonathan Katz, Nathan Klein:
Symmetric-Key Broadcast Encryption: The Multi-sender Case. CSCML 2017: 200-214
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-05-10 18:53 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: