default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamza Abusalah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Hamza Abusalah
, Gennaro Avitabile:
Black-Box Timed Commitments from Time-Lock Puzzles. TCC (3) 2024: 460-493- [i9]Hamza Abusalah, Gennaro Avitabile:
Black-Box Timed Commitments from Time-Lock Puzzles. IACR Cryptol. ePrint Arch. 2024: 1786 (2024) - 2023
- [c8]Hamza Abusalah, Valerio Cini:
An Incremental PoSW for General Weight Distributions. EUROCRYPT (2) 2023: 282-311 - [c7]Hamza Abusalah:
SNACKs for Proof-of-Space Blockchains. FC 2023: 3-17 - [i8]Hamza Abusalah:
SNACKs for Proof-of-Space Blockchains. IACR Cryptol. ePrint Arch. 2023: 806 (2023) - [i7]Hamza Abusalah, Valerio Cini:
An Incremental PoSW for General Weight Distributions. IACR Cryptol. ePrint Arch. 2023: 1836 (2023) - 2022
- [c6]Hamza Abusalah, Georg Fuchsbauer, Peter Gazi, Karen Klein:
SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients. ASIACRYPT (1) 2022: 806-836 - [i6]Hamza Abusalah, Georg Fuchsbauer, Peter Gazi, Karen Klein:
SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients. IACR Cryptol. ePrint Arch. 2022: 240 (2022)
2010 – 2019
- 2019
- [c5]Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
Reversible Proofs of Sequential Work. EUROCRYPT (2) 2019: 277-291 - [i5]Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
Reversible Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2019: 252 (2019) - 2017
- [c4]Hamza Abusalah, Joël Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, Leonid Reyzin:
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. ASIACRYPT (2) 2017: 357-379 - [i4]Hamza Abusalah, Joël Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, Leonid Reyzin:
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. IACR Cryptol. ePrint Arch. 2017: 893 (2017) - 2016
- [c3]Hamza Abusalah, Georg Fuchsbauer, Krzysztof Pietrzak:
Offline Witness Encryption. ACNS 2016: 285-303 - [c2]Hamza Abusalah, Georg Fuchsbauer:
Constrained PRFs for Unbounded Inputs with Short Keys. ACNS 2016: 445-463 - [c1]Hamza Abusalah, Georg Fuchsbauer, Krzysztof Pietrzak:
Constrained PRFs for Unbounded Inputs. CT-RSA 2016: 413-428 - [i3]Hamza Abusalah, Georg Fuchsbauer:
Constrained PRFs for Unbounded Inputs with Short Keys. IACR Cryptol. ePrint Arch. 2016: 279 (2016) - 2015
- [i2]Hamza Abusalah, Georg Fuchsbauer, Krzysztof Pietrzak:
Offline Witness Encryption. IACR Cryptol. ePrint Arch. 2015: 838 (2015) - 2014
- [i1]Hamza Abusalah, Georg Fuchsbauer, Krzysztof Pietrzak:
Constrained PRFs for Unbounded Inputs. IACR Cryptol. ePrint Arch. 2014: 840 (2014)
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-12-23 19:23 CET 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:
