The notion of Multi-Authority Anonymous Credentials with Epoch-Based Weights with Epoch-Based Weights (MA-ACEW), the first Multi-Authority Anonymous Credential (MA-AC) model that considers authorities'weight distribution in credential issuance, is proposed.
Abstract
Anonymous credentials (ACs) are fundamental to privacy-preserving authentication, allowing users to prove possession of attributes without revealing their identities. State-of-the-art ACs distribute credential issuance across multiple authorities, typically employing techniques such as Shamir's secret sharing or aggregate signatures. While this approach enhances system robustness and eliminates a single point of failure, it treats all authorities equally in the credential issuance phase. This uniform treatment disregards the varying levels of trustworthiness or stake held by different authorities. Such a limitation has become particularly problematic in modern decentralized systems like Proof-of-Stake networks, where the inherent trust differentiation among nodes cannot be leveraged in the credential issuance process. To address this limitation, we propose the notion of Multi-Authority Anonymous Credentials with Epoch-Based Weights (MA-ACEW), the first Multi-Authority Anonymous Credential (MA-AC) model that considers authorities'weight distribution in credential issuance. Crucially, MA-ACEW enables efficient credential updates when authority weight distributions change across epochs. The core of MA-ACEW is our novel Epoch-Bound Pointcheval-Sanders Signature (EB-PS) primitive, which binds signatures to specific time epochs. This temporal binding enables both weight-based credential issuance within epochs and efficient non-interactive credential updates across epochs. We formalize the EUF-eCMA unforgeability requirement for EB-PS and prove our construction satisfies it under a novel STB-GPS assumption. We then prove that our MA-ACEW construction achieves unforgeability, anonymity, and blindness. Finally, we present benchmarks demonstrating the efficiency of EB-PS and MA-ACEW. Remarkably, presenting a credential aggregated from 128 partial ones takes only 10.68 ms on average.
A two-dimensional taxonomy ofAttribute-Based Credentials is developed consisting of a construction dimension and an extension dimension and shows that these categories exhibit different trade-offs in verifier openness, proof flexibility, privacy guarantees, trust requirements, lifecycle support, and practical deploymen...
The Explainable Adaptive Zero Trust Framework (EAZTF) is introduced, a cloud-native security layer that continuously reevaluates the legitimacy of API actions throughout a session and is evaluated against four adversarial evasion strategies.
O. Singh, Yagyaraj Pandey, Nandini Pathak· 0 citations
The Internet of Vehicles (IoV) enables seamless Vehicle-to-Everything (V2X) communication among connected vehicles, infrastructure, and cloud services, supporting Intelligent Transportation Systems (ITS) through real-time information exchange. However, the dynamic and decentralized nature of IoV environments introduc...
Abdul Malik, Saeed Mian Qaisar, Syed Shayan Ali Shah et al.· Scientific Reports· 0 citations
It is argued that agent security must be evaluated under an untrusted-model assumption: a correct system is one in which a fully prompt-injected agent still cannot exceed the authority explicitly delegated to it, and an authorization broker is implemented that closes the gap.
Panduranga Sai Varma Dantuluri, Jyotirmoy Sundi· 0 citations
An Adaptive ZKP Selection Framework (AZSF) is proposed for privacy-preserving decentralized identity using DIDs and Verifiable Credentials and dynamically selects an appropriate proof mechanism according to the privacy sensitivity of requested attributes, disclosure requirements, verifier trust conditions, computationa...
Sanchita Shukla· International Journal of Cre...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.