Anonymous Authentication System Research Articles

Digital Platform for Confidential Complaint Resolution: Empowering Anonymity in Online Reporting

This report explores an innovative anonymous authentication system designed for academic services within the university environment. The primary objective of this proposed system is to safeguard students' identities when reporting instances of academic misconduct within the university system. The system comprises two fundamental sub- systems: one dedicated to user management and the other focusing on file management for feedback submitted by students. The "User Management" system facilitates tasks such as new enrollment, registration verification, and key distribution to system users. Meanwhile, the "Student Feedback" system assists users in providing feedback, encrypting and describing files, and submitting feedback. The file encryption process employs the Attribute-Based Encryption (ABE) algorithm. Both systems are interconnected through a confidential API. In the testing phase of this study, data from Pune University's community service participants in the year 2023 were utilized. The tests covered processes such as anonymous authentication, encryption, file description, key distribution, feedback submission, and feedback status. The evaluation produced positive results, indicating that the user authentication process takes only 4.6 seconds, while sending feedback requires 6.4 seconds. Key Words: Anonymous Authentication, Student Feedback, Academic Service, Distributed System,MD5, online , complaint , management , respond.

An efficient blockchain-based anonymous authentication and supervision system

An efficient blockchain-based anonymous authentication and supervision system

Zero-Cerd: A Self-Blindable Anonymous Authentication System Based on Blockchain

Zero-Cerd: A Self-Blindable Anonymous Authentication System Based on Blockchain

Authentication Technology in Internet of Things and Privacy Security Issues in Typical Application Scenarios

This paper mainly summarizes three aspects of information security: Internet of Things (IoT) authentication technology, Internet of Vehicles (IoV) trust management, and IoV privacy protection. Firstly, in an industrial IoT environment, when a user wants to securely access data from IoT sensors in real-time, they may face network attacks due to the data being transmitted through an open channel. In order to solve this problem, we innovatively propose a user and device authentication model integrated with cloud computing, introduce an algorithm related to protocol design, and summarize the research direction of developing a more lightweight algorithm when designing security protocols in the future. Secondly, for mobile IoT applications, such as IoV, information collection and distribution is realized by establishing a network between vehicles and infrastructure. IoV will face security threats such as information insecurity and privacy disclosure. We introduce a typical trust management model for the IoV, which solves the problem of information unreliability by storing vehicle trust values. In the future, we are committed to making the process of computing node credibility using a trust model more robust. Finally, aiming at the privacy protection of the IoV, we propose a cross-domain anonymous authentication system model based on blockchain. The user’s auxiliary authentication information is stored in the blockchain, and the auxiliary authentication information of any registered user can be obtained from the blockchain. The privacy protection of cross-domain authentication can be realized through anonymous authentication, which greatly saves the communication cost of cross-domain authentication. In the future, we will try to use deep learning or federated learning to integrate with blockchain for actual deployment.

Retraction Note: A trust based security framework with anonymous authentication system using multiple attributes in decentralized cloud

Retraction Note: A trust based security framework with anonymous authentication system using multiple attributes in decentralized cloud

Optimized and Efficient Authentication in VANET using Blockchain

Vehicle ad hoc networks (VANETs) are the most exciting area of research in smart transport systems as they provide convenience and safety information to drivers. However, VANET's unique features make security, privacy, and trust management promising issues in the design of VANETs. It is a challenging problem to provide an effective anonymous authentication system in ad hoc vehicle networks (VANETs) with low computational cost. Blockchain technology in VANET offers a decentralized, secure, and reliable database, which is maintained by the network node. Earlier, vehicle authentication is performed whenever the vehicle enters the RSU range. In this paper, authentication will be done if a vehicle fails to travel a certain distance. This decreased number of authentications and time required for it leads to an increase in the efficiency of the system.

Robust Revocable Anonymous Authentication for Vehicle to Grid Communications

Electric vehicles can place a significant load on the power grid due to their unscheduled charging events. One way of improving power grid stability is to schedule electric vehicle charging in advance. Before a charging visit, the electric vehicle provides necessary information to request for charging at a charging station, which prepares and reserves the energy before the visit. However, the reported information can cause privacy leakage of the electric vehicle user. Anonymous information reporting can protect user privacy, but also enables attacks on the charging station by unauthorized users. An anonymous authentication system can address these issues, but cannot detect misbehaviors by authenticated users. One remedy to this is revocable anonymity-based authentication, which can revoke the anonymity of malicious users after their misbehaviors. However, we show that such a system is still vulnerable to application-level Denial of Service attacks, where a malicious user requests for large amounts of energy simultaneously from many charging stations, preventing these stations from serving other users. To address this, we improve upon an existing revocable anonymity-based authentication framework. We propose a permit-based mechanism, where each electric vehicle is only issued with one blind signature-based permit at a time. A request is valid only if it contains a valid and unused permit, which protects the system from the application-level Denial of Service attacks. Security analysis and experiments demonstrate that our framework, while ensuring user anonymity and being robust to the aforementioned attack, is also scalable and lightweight.

A Robust user authentication protocol with privacy-preserving for roaming service in mobility environments

The authentication system plays a crucial role in the context of GLObal MObility NETwork (GLOMONET) where Mobile User (MU) often need to seamless and secure roaming service over multiple Foreign Agents (FA). However, designing a robust and anonymous authentication protocol along with a user privacy is essential and challenging task. Due to the resource constrained property of mobile terminals, the broadcast nature of a wireless channel, mobility environments are frequently exposed to several attacks. Many researchers focus their interests on designing an efficient and secure mobile user authentication protocol for mobility networks. Very recently (in 2018), Xu et al presented the novel anonymous authentication system for roaming in GLOMONET, and insisted that their protocol is more secure than existing authentication protocols. The security strength of Xu et al.’s authentication protocol is analysed and identified that the protocol is vulnerable to stolen verifier attack, privileged insider attack, impersonation attack and denial of service attack. In-fact, the protocol suffers from clock synchronization problem and cannot afford local password-verification to detect wrong passwords quickly. As a remedy, we proposed an efficient and robust anonymous authentication protocol for mobility networks. The proposed mobile user authentication protocol achieves the provable security and has the ability to resist against numerous network attacks. Besides, the correctness of the novel authentication protocol is validated using formal security tool called AVISPA (Automated Validation of Internet Security Protocols & Applications). Finally, the performance analysis and simulation results reveals that the proposed authentication protocol is computationally efficient and practically implementable in resource limited mobility environments.

A practical solution to clone problem in anonymous information system

Cloning user's identity is always a thorny problem for an information system, especially for an anonymous system. With the development of big data applications, clone behaviors sometimes even become attacks on these systems. But until now, there has been no very satisfactory anti-clone scheme in the anonymous system. After analyzing the problems in existing anti-clone schemes, without any assumptions about physical security, we provide a practical solution to the clone problem in anonymous authentication system. In our scheme, the authentication is not only related to user's private key, but also related to user's current state, which is constantly updated by the system. Therefore, the authentication trajectories of user and clone will inevitably overlap, and it results in information leakage so as to indentify clone behaviors and revoke clone user's credential. Meanwhile, we prove that honest users are truly anonymous and their login behaviors are unlinkable with complete security proofs. According to the analysis of the system function and the system efficiency, our scheme is much more efficient and has the best anti-clone properties comparing with the existing schemes.

RETRACTED ARTICLE: A trust based security framework with anonymous authentication system using multiple attributes in decentralized cloud

The cloud computing is established as the technology that provides all the need oriented and the use dependent IT resources that has been used very frequently for the business information systems. In relation to the terms of integration of all the decentralized information systems, the cloud systems have been providing an approach for stable solution. But the data security has been found to be a major challenge in the using of cloud systems and being a main reason as to why the companies avoid cloud service usage. The main question that is faced is the manner in which the cloud systems are used for the integration of such decentralized information systems that are to be designed and based on the technology and the organization to ensure privacy of law of that of the cloud user that may be guaranteed. Today there is a lot of attention that is being received from the academic as well as the perspective of the industry by means of an in depth cloud computing resource. There are several issues of security like availability, confidentiality and integrity. The experts have been studying the anonymous authentication for the data archiving to the clouds. In the conditions in which there is a communication that is achieved without penalty or fear, an anonymous authentication will be important. This has been needed by the organizations for protecting all their vital data from that of their industrial espionage. From among the techniques of authentication that has been attributed to a decentralized mechanism it may appear to be efficient. For this work, a trust-based secure and anonymous authentication for multiple attributes is make use of. The Recursive Best First Search (RBFS) algorithm will be used for finding the optimal weights from among the trust partners.

On the Efficiency of Revocation in RSA-Based Anonymous Systems

The problem of revocation in anonymous authentication systems is subtle and has motivated a lot of work. One of the preferable solutions consists in maintaining either a whitelist $ \mathcal {L}_{W}$ of non-revoked users or a blacklist $ \mathcal {L}_{B}$ of revoked users, and then requiring users to additionally prove, when authenticating themselves, that they are in $ \mathcal {L}_{W}$ (membership proof) or that they are not in $ \mathcal {L}_{B}$ (non-membership proof). Of course, these additional proofs must not break the anonymity properties of the system, so they must be zero-knowledge proofs, revealing nothing about the identity of the users. In this paper, we focus on the RSA-based setting, and we consider the case of non-membership proofs to blacklists $ \mathcal {L}= \mathcal {L}_{B}$ . The existing solutions for this setting rely on the use of universal dynamic accumulators; the underlying zero-knowledge proofs are bit complicated, and thus their efficiency; although being independent from the size of the blacklist $ \mathcal {L}$ , seems to be improvable. Peng and Bao already tried to propose simpler and more efficient zero-knowledge proofs for this setting, but we prove in this paper that their protocol is not secure. We fix the problem by designing a new protocol, and formally proving its security properties. We then compare the efficiency of the new zero-knowledge non-membership protocol with that of the protocol, when they are integrated with anonymous authentication systems based on RSA (notably, the IBM product Idemix for anonymous credentials). We discuss for which values of the size $k$ of the blacklist $ \mathcal {L}$ , one protocol is preferable to the other one, and we propose different ways to combine and implement the two protocols.

Periodic $K$ -Times Anonymous Authentication With Efficient Revocation of Violator’s Credential

In a periodic $\boldsymbol {K}$ -times anonymous authentication system, user can anonymously show credential at most $\boldsymbol {K}$ times in one time period. In the next time period, user can automatically get another $\boldsymbol {K}$ -times authentication permission. If a user tries to show credential beyond $\boldsymbol {K}$ times in one time period, anyone can identify the dishonest user (the violator). But identifying violators is not enough for some systems, where it is also desirable to revoke violators’ credentials for preventing them from abusing the anonymous property again. However, the problem of revoking credential without trusted third party has not been solved efficiently and practically. To solve it, we present an efficient scheme with efficient revocation of violator’s credential. In fact, our method also solves an interesting problem—leaking information in a statistic zero-knowledge way, so our solution to the revocation problem outperforms all prior solutions. For achieving it, we use the special zero-knowledge proof with special information leak for revoking the violator’s credential, but it can still be proven to be perfect statistic zero knowledge for guaranteeing the honest user’s anonymity. Comparing with existing schemes, our scheme is efficient, and moreover, our method of revoking violator’s credential is more practical with the least additional costs.

Server-aided anonymous attribute-based authentication in cloud computing

The notion of attribute-based signature is one of the important security primitives to realize anonymous authentication. In an attribute based signature (ABS), users can generate a signature on a message with their attributes. With this signature, any verifier will be convinced that such a signature is generated from a signer with these attributes. However, the identity of the signers will be hidden from the verifier. ABS are useful to design anonymous authentication and attribute-based messaging system. However, existing work of attribute-based authentication usually requires huge computation during signing, which grows linearly with the size of the attributes. Thus, these methods result in heavy computation overhead on the users and are not suitable for devices with only small computation ability.Cloud computing is an emerging computing paradigm in which resources of the computing infrastructure are provided as outsourcing services over the Internet. In this paper, we first address the challenging issue of securely outsourcing ABS, which enables users to largely eliminate the computational costs of ABS generation. The security model is formally defined to protect the privacy of users’ signing key while outsourcing the computation of signing. An efficient and secure outsourcing algorithm of ABS is also proposed. Extensive analysis shows that our scheme is secure in the proposed model and saves more than 90% computation overhead on the user side.

An efficient attribute-based signature scheme with claim-predicate mechanism

Attribute-Based Signature ABS is a promising cryptographic primitive that allows a signer to sign a message under a signing policy to convince the verifier that the signer holds a subset of attributes satisfying the signing predicate. A successful execution of ABS should leak no information about the identity of the signer or the attributes he possesses, other than the fact these attributes that the underlying signer possesses satisfy the given signing predicate. ABS has a lot of applications in real scenarios requiring both authentication and privacy properties, such as anonymous authentication and attribute-based messaging systems. In this paper, we present a new construction of ABS with claim-predicate mechanism based on Bethencourt et al.'s ciphertext-policy attribute-based encryption scheme. The proposed construction is proved to be existentially unforgeable in the random oracle model for the selective adversary and can achieve perfect privacy. Compared with existing schemes, the new construction provides better efficiency in terms of both the computational cost and signature size.