default search action
Essam Ghadafi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Yunus Kareem
, Djamel Djenouri
A Survey on Emerging Blockchain Technology Platforms for Securing the Internet of Things. Future Internet 16(8): 285 (2024) - [j7]Mohamed Seifelnasr
Privacy-Preserving Mutual Authentication Protocol With Forward Secrecy for IoT-Edge-Cloud. IEEE Internet Things J. 11(5): 8105-8117 (2024) - 2023
- [j6]Andrew McCarthy
Defending against adversarial machine learning attacks using hierarchical learning: A case study on network traffic attack classification. J. Inf. Secur. Appl. 72: 103398 (2023) - 2022
- [j5]Sabri Barbaria
Leveraging Patient Information Sharing Using Blockchain-Based Distributed Networks. IEEE Access 10: 106334-106351 (2022) - [j4]Andrew McCarthy
Functionality-Preserving Adversarial Machine Learning for Robust Classification in Cybersecurity and Intrusion Detection Domains: A Survey. J. Cybersecur. Priv. 2(1): 154-190 (2022) - 2021
- [j3]Santeri Paavolainen
Adventures of a Light Blockchain Protocol in a Forest of Transactions: A Subset of a Story. IEEE Access 9: 110085-110102 (2021) - [c23]Essam Ghadafi:
Partially Structure-Preserving Signatures: Lower Bounds, Constructions and More. ACNS (1) 2021: 284-312 - [c22]Andrew McCarthy
Feature Vulnerability and Robustness Assessment against Adversarial Machine Learning Attacks. CyberSA 2021: 1-8 - 2020
- [j2]Jonathan Bootle
Foundations of Fully Dynamic Group Signatures. J. Cryptol. 33(4): 1822-1870 (2020) - [i19]Essam Ghadafi:
Partially Structure-Preserving Signatures: Lower Bounds, Constructions and More. IACR Cryptol. ePrint Arch. 2020: 477 (2020)
2010 – 2019
- 2019
- [c21]Essam Ghadafi
Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups. AFRICACRYPT 2019: 409-428 - 2018
- [i18]Essam Ghadafi:
Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups. IACR Cryptol. ePrint Arch. 2018: 1224 (2018) - 2017
- [c20]Essam Ghadafi
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups. ASIACRYPT (2) 2017: 66-96 - [c19]Jonathan Bootle
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. ASIACRYPT (3) 2017: 336-365 - [c18]Essam Ghadafi
More Efficient Structure-Preserving Signatures - Or: Bypassing the Type-III Lower Bounds. ESORICS (2) 2017: 43-61 - [c17]Essam Ghadafi
Efficient Round-Optimal Blind Signatures in the Standard Model. Financial Cryptography 2017: 455-473 - [c16]Ali El Kaafarani, Essam Ghadafi
Attribute-Based Signatures with User-Controlled Linkability Without Random Oracles. IMACC 2017: 161-184 - [c15]Essam Ghadafi
How Low Can You Go? Short Structure-Preserving Signatures for Diffie-Hellman Vectors. IMACC 2017: 185-204 - [c14]Essam Ghadafi
Subset Signatures with Controlled Context-Hiding. IMACC 2017: 280-304 - [i17]Essam Ghadafi:
Efficient Round-Optimal Blind Signatures in the Standard Model. IACR Cryptol. ePrint Arch. 2017: 45 (2017) - [i16]Essam Ghadafi, Jens Groth:
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups. IACR Cryptol. ePrint Arch. 2017: 343 (2017) - [i15]Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen:
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. IACR Cryptol. ePrint Arch. 2017: 872 (2017) - [i14]Essam Ghadafi:
How Low Can You Go? Short Structure-Preserving Signatures for Diffie-Hellman Vectors. IACR Cryptol. ePrint Arch. 2017: 902 (2017) - 2016
- [c13]Jonathan Bootle
Foundations of Fully Dynamic Group Signatures. ACNS 2016: 117-136 - [c12]Essam Ghadafi
Short Structure-Preserving Signatures. CT-RSA 2016: 305-321 - [i13]Essam Ghadafi:
More Efficient Structure-Preserving Signatures - Or: Bypassing the Type-III Lower Bounds. IACR Cryptol. ePrint Arch. 2016: 255 (2016) - [i12]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth:
Foundations of Fully Dynamic Group Signatures. IACR Cryptol. ePrint Arch. 2016: 368 (2016) - 2015
- [c11]Essam Ghadafi
Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions. CT-RSA 2015: 391-409 - [c10]Jonathan Bootle
Short Accountable Ring Signatures Based on DDH. ESORICS (1) 2015: 243-265 - [i11]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit:
Short Accountable Ring Signatures Based on DDH. IACR Cryptol. ePrint Arch. 2015: 643 (2015) - [i10]Essam Ghadafi:
Short Structure-Preserving Signatures. IACR Cryptol. ePrint Arch. 2015: 961 (2015) - 2014
- [c9]Ali El Kaafarani, Liqun Chen
Attribute-Based Signatures with User-Controlled Linkability. CANS 2014: 256-269 - [c8]Ali El Kaafarani, Essam Ghadafi
Decentralized Traceable Attribute-Based Signatures. CT-RSA 2014: 327-348 - [c7]Essam Ghadafi
Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability. LATINCRYPT 2014: 327-347 - [i9]Essam Ghadafi:
Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions. IACR Cryptol. ePrint Arch. 2014: 278 (2014) - [i8]Essam Ghadafi:
Efficient Distributed Tag-Based Encryption and its Application to Group Signatures with Efficient Distributed Traceability. IACR Cryptol. ePrint Arch. 2014: 833 (2014) - 2013
- [j1]David Bernhard, Georg Fuchsbauer, Essam Ghadafi
Anonymous attestation with user-controlled linkability. Int. J. Inf. Sec. 12(3): 219-249 (2013) - [c6]Essam Ghadafi
Formalizing Group Blind Signatures and Practical Constructions without Random Oracles. ACISP 2013: 330-346 - [c5]David Bernhard, Georg Fuchsbauer, Essam Ghadafi
Efficient Signatures of Knowledge and DAA in the Standard Model. ACNS 2013: 518-533 - [c4]Essam Ghadafi
Sub-linear Blind Ring Signatures without Random Oracles. IMACC 2013: 304-323 - [i7]Essam Ghadafi:
Sub-linear Blind Ring Signatures without Random Oracles. IACR Cryptol. ePrint Arch. 2013: 612 (2013) - [i6]Ali El Kaafarani, Essam Ghadafi, Dalia Khader:
Decentralized Traceable Attribute-Based Signatures. IACR Cryptol. ePrint Arch. 2013: 828 (2013) - 2012
- [c3]Essam Ghadafi
Efficient Two-Move Blind Signatures in the Common Reference String Model. ISC 2012: 274-289 - [i5]David Bernhard, Georg Fuchsbauer, Essam Ghadafi:
Efficient Signatures of Knowledge and DAA in the Standard Model. IACR Cryptol. ePrint Arch. 2012: 475 (2012) - 2011
- [b1]Essam Ghadafi:
Practical privacy-preserving cryptographic protocols. University of Bristol, UK, 2011 - [i4]Essam Ghadafi:
Formalizing Group Blind Signatures and Practical Constructions without Random Oracles. IACR Cryptol. ePrint Arch. 2011: 402 (2011) - [i3]David Bernhard, Georg Fuchsbauer, Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi:
Anonymous attestation with user-controlled linkability. IACR Cryptol. ePrint Arch. 2011: 658 (2011) - 2010
- [c2]Essam Ghadafi
Groth-Sahai Proofs Revisited. Public Key Cryptography 2010: 177-192 - [i2]Essam Ghadafi, Nigel P. Smart:
Efficient Two-Move Blind Signatures in the Common Reference String Model. IACR Cryptol. ePrint Arch. 2010: 568 (2010)
2000 – 2009
- 2009
- [c1]Essam Ghadafi
Practical Zero-Knowledge Proofs for Circuit Evaluation. IMACC 2009: 469-494 - [i1]Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi:
Groth-Sahai proofs revisited. IACR Cryptol. ePrint Arch. 2009: 599 (2009)
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-04 21:02 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: