Open research questions in Cryptography and Data Security
157 gap statements mined from Cryptography and Data Security papers in our 7.9M-paper local library, which holds 2,206 papers on the topic — drawn mostly from each paper's own stated research gap, future-work, challenge and limitation notes, and its abstract. The ones listed below are a selection still marked open; each names the study that raised it, with a DOI link where the paper has one.
Choosing where to publish on Cryptography and Data Security? See the ranked Computer Science journals.
What the literature leaves open
Future work will focus on two extensions: (1) achieving full Byzantine fault tolerance against malicious adversaries, and (2) adapting our recursive patching mechanism to expressive FSS primitives, such as distributed comparison functions (DCFs), to support privacy-preserving range queries and complex analytics.
The need to prevent cross-component correlation attacks. The challenge of achieving dynamic extension security in the presence of adaptive chosen-message attacks.
There is a lack of schemes that can simultaneously achieve selective security and black-box traceability in the random oracle model.
The lack of a provably secure and efficient identity privacy scheme for IoT-enabled 3GPP mobile networks.
Strongly unforgeable and lightweight identity privacy scheme for the IoT-enabled 3GPP mobile networks · 2026 · DOIWhile the obtained results confirm the computational efficiency of the proposed method, future experiments on real IoT devices and distributed cloud infrastructures are necessary to fully validate its applicability under resource-constrained conditions. Another important direction for future research is the extension of the threat model to active adversaries acting in collusion.
The majority of existing studies lack ZKP-based verification, tool-level analysis, and formalized mappings between attack typologies and evaluation metrics.
Privacy-Preserving Machine Learning Techniques: Cryptographic Approaches, Challenges, and Future Directions · 2025 · DOIUnderstanding how to extend it to a new scheme that enables dynamic sharing and verifiability remains an interesting open problem.
The lack of support for dynamic updates and concealment of access patterns.
The lack of efficient and scalable solutions for searching encrypted data in cloud computing. The need for a secure and privacy-preserving data retrieval scheme that addresses the security and privacy concerns related to data confidentiality, unauthorized access, and privacy preservation.
The experimental evaluation lacks testing on realistic large-scale cloud datasets with millions of documents and dynamic insertion/deletion operations; scalability of the key-aggregate mechanism and optimized indexing to production-scale encrypted cloud environments remains unvalidated.
Future research can focus on optimizing the performance of DSKAG-IT-SIG. Future research can also explore the application of DSKAG-IT-SIG in other domains, such as secure multi-party computation.
DSKAG-IT-SIG: Information-Theoretic Transaction Signatures with Hardware-Bound Policy Binding and Permissionless Zero-Knowledge On-Chain Verification · 2026 · DOIThe lack of a secure and efficient broadcast encryption scheme that can prevent malicious encryptors and data leakage. The need for a public tracing mechanism to identify colluding malicious users. The requirement for a smart contract system to implement authentication services and store relevant data.
Traceable and Revocable Broadcast Encryption Scheme for Preventing Malicious Encryptors · 2026 · DOIThe lack of robustness in managing irrational updates in existing encrypted spatial-textual data retrieval schemes. The need for a novel scheme that achieves forward security, Type-I backward security, and enhanced robustness for boolean range queries.
REACTS: robust encrypted search for dynamic spatial-textual data with permission control · 2026 · DOIExisting decentralized reputation frameworks do not reconcile anonymity, reputation binding, and scalability. There is a need for a framework that achieves these requirements in fully decentralized crowdsourcing systems.
DARTIC: Decentralized Anonymous Reputation at Scale for Trustworthy Crowdsourcing · 2026Due to DP's inability to have zeros in the mechanism, the design of privacy mechanisms that optimize the worst-case utility is underexplored, and this work shows that PML is a privacy measure that is perfectly suited for this purpose.
Worst-Case Utility Privacy Mechanism via Pointwise Maximal Leakage · 2026Existing schemes are simultaneously too large, computationally secure rather than unconditionally secure, and architecturally disconnected from the compliance policy layer.
DSKAG-IT-SIG: Information-Theoretic Transaction Signatures with Hardware-Bound Policy Binding and Permissionless Zero-Knowledge On-Chain Verification · 2026 · DOIExisting cryptographic infrastructures are not suitable for heterogeneous defense settings. Traditional public-key algorithms are vulnerable to quantum attacks.
DEF-CRYPT-Q: a quantum-enhanced hybrid encryption framework for privacy-preserving distributed defense communications · 2026 · DOIFuture research will focus on improving the security and compression performance of cipher images, 1 3International Journal of Machine Learning and Cybernetics (2026)…
DBRA-Net: privacy-preserving cipher image retrieval via dual-branch residual attention network · 2026 · DOIMost NIZKs do not natively support proving knowledge of a secret witness that is distributed over multiple provers - Increased proof generation times - Significant increase in the number of constraints needed to encode…
Investigating the notion of composability in collaborative proofs - Constructing MPC protocols for collaborative CP-NIZKs - Evaluating the practicality of collaborative CP-NIZKs in various computational…
Investigating the construction of an adaptively secure ABE scheme in the standard model with efficient revocation and black-box traceability simultaneously, - Exploring the application of the proposed RT-CP-ABE scheme in various…
Investigating the application of the scheme in other security architectures, - Exploring the use of other cryptographic schemes to further reduce communication…
Strongly unforgeable and lightweight identity privacy scheme for the IoT-enabled 3GPP mobile networks · 2026 · DOIInvestigating the growth of zero-knowledge proofs (ZKPs)-based verification, - Developing domain-specific hybrid architectures, - Examining the efficiency of PPML systems running on edge devices with limited processing power, - Exploring the trade-off between privacy and accuracy in PPML…
Privacy-Preserving Machine Learning Techniques: Cryptographic Approaches, Challenges, and Future Directions · 2025 · DOIBidirectional authorization raises concerns - Existing ORE schemes have…
Third, Future research should focus on (1) reducing the proof size of Zero-Knowledge proofs for deep neural networks, (2) integrating hardware security modules (HSMs) optimized for lattice-based cryptography to accelerate edge authentication, and (3) developing migration strategies for legacy IoT devices that lack the computational resources for ML-DSA, potentially relying on hybrid mode where gateways perform…
Most-cited papers in Cryptography and Data Security
- How to share a secret · Communications of the ACM · 1979 · 10,601 citations
- Untraceable electronic mail, return addresses, and digital pseudonyms · Communications of the ACM · 1981 · 2,977 citations
- A survey of trust and reputation systems for online service provision · Decision Support Systems · 2005 · 2,428 citations
- Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks · IEEE Access · 2020 · 567 citations
- Computing arbitrary functions of encrypted data · Communications of the ACM · 2010 · 468 citations
- Secure attribute-based data sharing for resource-limited users in cloud computing · Computers & Security · 2017 · 403 citations
- Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network · IEEE Access · 2022 · 376 citations
- A method for obtaining digital signatures and public-key cryptosystems · Communications of the ACM · 1983 · 346 citations
- Blockchain-Assisted Secure Fine-Grained Searchable Encryption for a Cloud-Based Healthcare Cyber-Physical System · IEEE/CAA Journal of Automatica Sinica · 2021 · 271 citations
- A Traceable and Revocable Ciphertext-Policy Attribute-based Encryption Scheme Based on Privacy Protection · IEEE Transactions on Dependable and Secure Computing · 2020 · 262 citations
Most recent work
- Randomized average consensus based on additive privacy sharing · Automatica · 2026
- MK-WISE: Secure and Efficient Multi-Keyword Wildcard ABSE With Keyword-Level Revocation for Device–Edge–Cloud EHRs Data Sharing · IEEE Transactions on Network and Service Management · 2026
- Traceable and Revocable Multi-Authority Attribute-Based Encryption With Cloud and Fog Computing Feasible for IoV · IEEE Transactions on Dependable and Secure Computing · 2026
- Quantum-Resistant Security for Blockchain-Enabled 6G Networks: A Comprehensive Review · IEEE Open Journal of the Communications Society · 2026
- Secure Aggregation With an Oblivious Server · IEEE Transactions on Information Theory · 2026
- PQ-ABS: Post-Quantum Aggregate Blind Signature-Based Anonymous Authentication for Blockchain-Enabled IoMT · IEEE Transactions on Information Forensics and Security · 2026
- PriFFT: Privacy-Preserving Federated Fine-Tuning of Large Language Models via Hybrid Secret Sharing · IEEE Transactions on Dependable and Secure Computing · 2026
- MC-ORAM: A Concurrent ORAM Scheme for Multi-User Shared Storage · IEEE Transactions on Computers · 2026
- Expressive and Fully Policy-Hidden Attribute-Based Searchable Encryption Scheme for Multi-Owner · IEEE Transactions on Information Forensics and Security · 2026
- Integrating Post Quantum Cryptography (PQC) for End-to-End Security in Edge and IoT Environments · IEEE Transactions on Consumer Electronics · 2026
Find a gap in your own Cryptography and Data Security sub-topic
This page shows what the Cryptography and Data Security literature already flags as unresolved. To narrow it to your specific question, search the Research Gap Finder: the search is free with a free account and lists the papers closest to your topic first. Unlocking that topic (50 credits, charged once) fills the comparison table from our 7.9M-paper local library and writes the gaps from its rows.
Open the Research Gap Finder →