The research, led by Yong Wang of Wannan Medical University together with colleagues at Anhui Normal University, Bengbu University and Zhejiang University, introduces a scheme called UDSQ, short for user-defined dynamic skyline secure query. At its heart lies a classic problem from multi-criteria database theory known as the skyline query. Given a collection of data points, each described by several attributes, a skyline query returns the set of points that are not dominated by any other point. A point dominates another if it is at least as good in every attribute and strictly better in at least one. In a medical context, imagine searching a database of patient cases for records that minimize both treatment cost and symptom severity while maximizing treatment success. The skyline consists of all cases that no other case beats across that entire combination of criteria, giving clinicians a shortlist of genuinely compelling matches rather than an arbitrary ranking.

What makes the new work distinctive is the word dynamic in its title. In conventional skyline systems, the attributes used for comparison are fixed in advance by the database designer. A patient consulting an online diagnosis service, however, may care about very different things: one might prioritize the experience level of the treating physician, another the proximity of the clinic, a third the cost of medication. UDSQ allows the user to define the region of interest, the set of dimensions and the thresholds that matter to them at query time. The system then restricts the skyline computation to that user-defined region, which has a welcome side effect: by shrinking the search space, it reduces the computational burden and the amount of data that must travel back and forth between the server and the client.

The central obstacle, of course, is that the medical records on the server are supposed to be encrypted. A skyline query appears to require exactly what encryption forbids: comparing values to determine which point dominates which. The authors resolve this tension by combining two cryptographic primitives. The first is order-revealing encryption, a technique that allows a server to compare the relative order of two ciphertexts without being able to decrypt either one. With order-revealing encryption, the server can evaluate dominance relationships among encrypted records, determining whether one encrypted case is better than another across the user’s chosen attributes, while learning nothing about the actual values of cost, severity or success rate.

The second primitive is proxy re-encryption, which addresses a different problem: how a single untrusted server can process queries from many users without each user having to share a secret key with the server. In a proxy re-encryption scheme, a data owner can generate a special transformation key that lets the server convert ciphertexts encrypted under one key into ciphertexts readable under another, without the server ever seeing the plaintext or the original key. In UDSQ, this mechanism allows the diagnosis platform to re-encrypt results so that only the querying patient can read them. Crucially, the authors show that combining proxy re-encryption with a single-server model defends against collusion attacks, scenarios in which a malicious server and a compromised user pool their information in an attempt to reconstruct other patients’ data. Because the transformation keys are structured to prevent any coalition from inverting the encryption, the scheme maintains its privacy guarantees even under this stronger adversary model.

To make the encrypted skyline computation efficient, the researchers designed two dedicated algorithms. The Rectangles Intersection Determination Algorithm, or RIDA, represents the user-defined query region geometrically and determines which candidate data points fall within its boundaries by computing intersections between rectangular regions in the attribute space. Rather than testing every record against every dimension individually, RIDA prunes the candidate set using rectangle intersection tests performed directly on encrypted representations. The Skyline Point Determination Algorithm, or SPDA, then takes the surviving candidates and establishes their dominance relationships in ciphertext, identifying which points belong to the final skyline. The division of labor matters: by separating spatial pruning from dominance testing, the pipeline avoids the quadratic comparisons that plague naive skyline implementations, and the authors report that the combination yields measurable advantages in both communication and computation overhead compared with existing approaches.

The experimental evaluation, conducted on publicly available benchmark datasets rather than real patient records, supports the efficiency claims. Because the study did not involve human participants or new human subject data, the authors note that ethics approval was not applicable, and the use of public benchmarks means the performance figures reflect the algorithms themselves rather than any particular clinical deployment. The reported results indicate that UDSQ reduces the communication cost between client and server, a critical factor for patients in areas with limited bandwidth, while also lowering the computational load on the server. In encrypted-query research, where cryptographic operations typically impose orders-of-magnitude slowdowns, achieving both security and competitive overhead is the benchmark of a practical design.

The implications extend beyond medicine. Skyline queries arise wherever users must choose among multi-attribute alternatives: hotel bookings balancing price, location and rating; investment portfolios balancing risk and return; sensor networks balancing energy consumption and data fidelity. Any of these domains could adopt the user-defined, encrypted paradigm that UDSQ demonstrates. But medicine is the most urgent case, because the stakes of disclosure are highest. A patient’s diagnostic history, once leaked, cannot be changed the way a compromised password can. Regulatory frameworks around the world increasingly demand that health data be protected not only in transit but also during computation, and techniques like order-revealing encryption represent one of the few viable paths to computing on data that remains sealed throughout the process.

Still, the scheme is not a panacea, and honest reporting requires acknowledging the boundaries of what the study demonstrates. Order-revealing encryption, while powerful, leaks the ordering of values by design, and the cryptographic community continues to study what auxiliary information an adversarial server might infer from such leakage when combined with background knowledge. The single-server model simplifies deployment but concentrates trust in one infrastructure provider, even if that provider cannot read the data. And the user-defined nature of the query, while empowering, means that the privacy profile can shift with each new query configuration, a dynamic that future work will need to characterize formally. The authors’ contribution is best understood as a well-engineered point in the design space, one that balances these tensions more favorably than prior schemes while leaving open questions that the field is actively pursuing.

What the study ultimately signals is a maturing of privacy-preserving computation from theoretical curiosity toward deployable infrastructure. The researchers, funded by the doctoral research foundation of Wannan Medical College and the Anhui Province Intelligent Robot Information Fusion and Control Engineering Research Center, have published their work open access, allowing clinicians, cryptographers and system builders to scrutinize and extend it. As online diagnosis platforms expand into regions where they can do the most good, the demand for systems that never force patients to choose between accurate answers and protected data will only grow. UDSQ offers a concrete demonstration that this choice is not inevitable: with the right combination of user control, geometric pruning and modern encryption, the skyline of the best possible medical matches can be computed entirely in the dark, and delivered intact to the one person who holds the key.

Subject of Research: Secure user-defined dynamic skyline queries for privacy-preserving online medical diagnosis

Article Title: UDSQ: a secure and efficient user-defined dynamic skyline query in online medical diagnosis

Article References: Wang, Y., Xu, X., Nie, X., & Peng, G. (2026). UDSQ: a secure and efficient user-defined dynamic skyline query in online medical diagnosis. Journal of Big Data. https://doi.org/10.1186/s40537-026-01581-8

Image Credits: AI Generated

DOI: 10.1186/s40537-026-01581-8

Keywords: skyline query, data security, privacy protection, online medical diagnosis, order-revealing encryption, proxy re-encryption, encrypted queries, cloud computing, database management, collusion attacks, health informatics, cryptography

Anonymous credentials have become one of the most promising tools for protecting user privacy in modern identity management. In an anonymous credential system, a user obtains a digitally signed set of attributes from an issuer — for example, a government agency confirming age or residency, or a university confirming student status. Later, the user can authenticate to a verifier in a manner that is both anonymous and unlinkable, disclosing only the specific attributes that are necessary for the transaction at hand. The verifier learns that the claim is legitimate without learning the user’s identity, and presentations made at different times cannot be linked back to the same person.

The scheme under scrutiny was proposed by Mir and colleagues at the 2023 ACM SIGSAC Conference on Computer and Communications Security, a flagship venue for computer security research. Their construction introduced an aggregate signature scheme with randomizable tags and public keys, enabling a powerful feature known as issuer hiding. In a multi-authority setting, where credentials may come from many different issuers, issuer hiding allows a user to present a credential without revealing which organization actually issued it. This matters in practice because knowledge of the issuer can itself be identifying: a credential from a specific clinic, shelter, or government program can leak sensitive information even when the user’s name remains hidden.

The scheme’s authors claimed that their aggregate signature was unforgeable in the random oracle model, a standard proof framework in which cryptographic hash functions are modeled as idealized random functions. Unforgeability of an aggregate signature means that no efficient adversary should be able to produce a compact aggregated signature that verifies correctly unless they genuinely possess valid signatures for every component. Aggregate signatures are attractive for anonymous credentials because they allow many individual signatures — one per credential attribute or per issuing authority — to be compressed into a single, constant-size object that can be verified efficiently.

The new analysis, conducted by Qiu Zhang, Yinxia Sun, Ge Wu, and Yang Lu, demonstrates that this security claim does not hold against a class of adversaries the original designers apparently overlooked: malicious issuers acting in coalition. In the attack, several corrupt issuers collude to produce individual signatures that are, in fact, invalid. Individually, these malformed signatures would fail verification if a user checked each one. But when combined, the invalid components aggregate into a signature that passes the aggregate verification check. In other words, the aggregation process can mask the invalidity of its parts, allowing a forged aggregate to be accepted by verifiers.

The implications for anonymous credential systems are significant. A user of the original scheme could be tricked into holding credentials that appear valid in aggregate form but rest on fraudulent underlying signatures. In a deployed system, malicious issuers exploiting this coalition attack could undermine the integrity guarantees that verifiers depend on — for instance, allowing improperly issued or manipulated credentials to circulate and be accepted at face value. Because the attack requires collusion among issuers rather than a break by an outside attacker, it sits squarely within the multi-authority threat model that issuer-hiding credentials are specifically designed to address.

Having identified the vulnerability, the researchers did not stop at criticism. They developed a targeted countermeasure: an improved aggregate signature scheme that mitigates coalition attacks by closing the loophole that allowed invalid components to combine into a valid aggregate. The improvement preserves the core functionality that made the original construction appealing — versatile randomization of tags and public keys, and support for issuer-hiding multi-authority credentials — while restoring the unforgeability guarantee that the coalition attack had broken.

Beyond repairing security, the improved scheme delivers a meaningful efficiency gain for users. In credential systems built on the original construction, a user had to verify each individual credential before aggregating them during a presentation, an expensive process of multiple independent verification computations. With the improved scheme, users can skip the verification of individual credentials entirely and aggregate them directly during the presentation phase. Because credential presentation is typically performed on resource-constrained devices such as smartphones, and because users may need to present several credentials simultaneously in multi-authority scenarios, this reduction in computational overhead on the user side is a substantial practical advantage.

The work fits into a broader and rapidly evolving research landscape on anonymous credentials and aggregate signatures. The bibliography of the new paper traces a lineage running from structure-preserving signatures on equivalence classes and constant-size anonymous credentials published in the Journal of Cryptology, through traceable constant-size multi-authority credentials, to issuer-hiding attribute-based credentials and recent delegatable attribute-based anonymous credential schemes with fine-grained delegation management. Applications cited in the surrounding literature range from privacy-enhanced traceable blockchain transactions to anonymous authentication protocols for vehicular networks and wireless medical sensor systems, underscoring how widely these cryptographic primitives are expected to be deployed.

For the privacy engineering community, the lesson of this study is a familiar but important one: security proofs must account for adversaries that match the real deployment model. In systems explicitly designed to tolerate many, potentially untrustworthy, issuing authorities, the possibility of issuer collusion is not an exotic assumption but a central case that any sound construction must withstand. By demonstrating a concrete coalition attack and providing a repair that also lightens the computational load on users, the Nanjing-based team has strengthened the foundations of issuer-hiding anonymous credentials at a moment when interest in privacy-preserving identity infrastructure — from digital identity wallets to anonymous access tokens — is accelerating across both industry and academia. The research was supported by the National Natural Science Foundation of China under grant number 62372177.

Subject of Research: Security analysis and improvement of aggregate signature schemes for issuer-hiding multi-authority anonymous credentials

Article Title: Improved Aggregate Signature With Versatile Randomization For Issuer-Hiding Multi-Authority Anonymous Credentials

Article References: Zhang, Q., Sun, Y., Wu, G., & Lu, Y. (2026). Improved Aggregate Signature With Versatile Randomization For Issuer-Hiding Multi-Authority Anonymous Credentials. Mobile Networks and Applications. https://doi.org/10.1007/s11036-026-02555-z

Image Credits: AI Generated

DOI: 10.1007/s11036-026-02555-z

Keywords: aggregate signature, anonymous credentials, coalition attack, issuer-hiding, multi-authority credentials, privacy protection, cryptography, identity management, randomizable tags, unforgeability, credential presentation, digital identity