A User Centric Group Authentication Scheme for Secure Communication

• URL: http://arxiv.org/abs/2512.03551v1
• Date: Wed, 03 Dec 2025 08:18:14 GMT
• Title: A User Centric Group Authentication Scheme for Secure Communication
• Authors: Oylum Gerenli, Gunes Karabulut-Kurt, Enver Ozdemir,
• Abstract summary: Group Authentication Schemes (GAS) are methodologies developed to verify the membership of multiple users simultaneously.<n>Gas methods can be classified into three generations based on their mathematical principles.
• Score: 5.74395663007002
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Group Authentication Schemes (GAS) are methodologies developed to verify the membership of multiple users simultaneously. These schemes enable the concurrent authentication of several users while eliminating the need for a certification authority. Numerous GAS methods have been explored in the literature, and they can be classified into three distinct generations based on their foundational mathematical principles. First-generation GASs rely on polynomial interpolation and the multiplicative subgroup of a finite field. Second-generation GASs also employ polynomial interpolation, but they distinguish themselves by incorporating elliptic curves over finite fields. While third-generation GASs present a promising solution for scalable environments, they demonstrate a limitation in certain applications. Such applications typically require the identification of users participating in the authentication process. In the third-generation GAS, users are able to verify their credentials while maintaining anonymity. However, there are various applications where the identification of participating users is necessary. In this study, we propose an improved version of third-generation GAS, utilizing inner product spaces and polynomial interpolation to resolve this limitation. We address the issue of preventing malicious actions by legitimate group members. The current third-generation scheme allows members to share group credentials, which can jeopardize group confidentiality. Our proposed scheme mitigates this risk by eliminating the ability of individual users to distribute credentials. However, a potential limitation of our scheme is its reliance on a central authority for authentication in certain scenarios.

Related papers

• Hi-SAFE: Hierarchical Secure Aggregation for Lightweight Federated Learning [16.477223151835982]
  We propose Hi-SAFE, a cryptographically secure aggregation framework for sign-based Federated learning.<n>Our core contribution is the construction of efficient majority votes for SIGNSGDMV, derived from Fermat's Little Theorem.<n>We further introduce a hierarchical subgrouping strategy that ensures constant multiplicative depth and bounded complexity.
  arXiv  Detail & Related papers  (2025-11-24T08:42:40Z)
• When Disagreements Elicit Robustness: Investigating Self-Repair Capabilities under LLM Multi-Agent Disagreements [56.29265568399648]
  We argue that disagreements prevent premature consensus and expand the explored solution space.<n>Disagreements on task-critical steps can derail collaboration depending on the topology of solution paths.
  arXiv  Detail & Related papers  (2025-02-21T02:24:43Z)
• 2FA: Navigating the Challenges and Solutions for Inclusive Access [55.2480439325792]
  Two-Factor Authentication (2FA) has emerged as a critical solution to protect online activities.<n>This paper examines the intricacies of deploying 2FA in a way that is secure and accessible to all users.<n>An analysis was conducted to examine the implementation and availability of various 2FA methods across popular online platforms.
  arXiv  Detail & Related papers  (2025-02-17T12:23:53Z)
• Order-agnostic Identifier for Large Language Model-based Generative Recommendation [94.37662915542603]
  Items are assigned identifiers for Large Language Models (LLMs) to encode user history and generate the next item.<n>Existing approaches leverage either token-sequence identifiers, representing items as discrete token sequences, or single-token identifiers, using ID or semantic embeddings.<n>We propose SETRec, which leverages semantic tokenizers to obtain order-agnostic multi-dimensional tokens.
  arXiv  Detail & Related papers  (2025-02-15T15:25:38Z)
• Towards Copyright Protection for Knowledge Bases of Retrieval-augmented Language Models via Reasoning [58.57194301645823]
  Large language models (LLMs) are increasingly integrated into real-world personalized applications.<n>The valuable and often proprietary nature of the knowledge bases used in RAG introduces the risk of unauthorized usage by adversaries.<n>Existing methods that can be generalized as watermarking techniques to protect these knowledge bases typically involve poisoning or backdoor attacks.<n>We propose name for harmless' copyright protection of knowledge bases.
  arXiv  Detail & Related papers  (2025-02-10T09:15:56Z)
• Online Clustering of Dueling Bandits [59.09590979404303]
  We introduce the first "clustering of dueling bandit algorithms" to enable collaborative decision-making based on preference feedback.<n>We propose two novel algorithms: (1) Clustering of Linear Dueling Bandits (COLDB) which models the user reward functions as linear functions of the context vectors, and (2) Clustering of Neural Dueling Bandits (CONDB) which uses a neural network to model complex, non-linear user reward functions.
  arXiv  Detail & Related papers  (2025-02-04T07:55:41Z)
• Attribute-Based Authentication in Secure Group Messaging for Distributed Environments [2.254434034390528]
  Messaging Layer security (MLS) and its underlying Continuous Group Key Agreement protocol allow a group of users to share a cryptographic secret in a dynamic manner.<n>The use of digital certificates for authentication in a group goes against the group members' privacy.<n>We provide an alternative method of authentication in which the solicitors, instead of revealing their identity, only need to prove possession of certain attributes.
  arXiv  Detail & Related papers  (2024-05-20T14:09:28Z)
• Implicit Sample Extension for Unsupervised Person Re-Identification [97.46045935897608]
  Clustering sometimes mixes different true identities together or splits the same identity into two or more sub clusters. We propose an Implicit Sample Extension (OurWholeMethod) method to generate what we call support samples around the cluster boundaries. Experiments demonstrate that the proposed method is effective and achieves state-of-the-art performance for unsupervised person Re-ID.
  arXiv  Detail & Related papers  (2022-04-14T11:41:48Z)
• Data-driven behavioural biometrics for continuous and adaptive user verification using Smartphone and Smartwatch [0.0]
  We propose an algorithm to blend behavioural biometrics with multi-factor authentication (MFA) This work proposes a two-step user verification algorithm that verifies the user's identity using motion-based biometrics.
  arXiv  Detail & Related papers  (2021-10-07T02:46:21Z)
• A Group Key Establishment Scheme [1.4091801425319967]
  Group authentication is a method of confirming that a set of users belong to a group. Unlike the standard authentication schemes where one central authority authenticates users one by one, group authentication can handle the authentication process at once for all members of the group.
  arXiv  Detail & Related papers  (2021-09-30T12:04:55Z)
• Community Detection for Access-Control Decisions: Analysing the Role of Homophily and Information Diffusion in Online Social Networks [0.0]
  Access-Control Lists (ACLs) are one of the most important privacy features of Online Social Networks (OSNs) This work investigates the use of community-detection algorithms for the automatic generation of ACLs in OSNs.
  arXiv  Detail & Related papers  (2021-04-19T08:49:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.