Group Authorization Using Chinese Remainder Theorem

Tomasz Krokosz , Jarogniew Rykowski

Abstract

The paper presents a new way of group authorization for a population of users of a given IT system. Group authorization is highly desirable in applications where the submission of individual rights is not sufficient: service support (service-owner relationship), anonymous verification of belonging to a particular group (e.g., disabled persons, city inhabitants), mutual authentication of unknown-in-advance persons, discounts for groups (e.g., family travelling), etc. The solution uses the Chinese Remainder Theorem, which for any congruence system (with a collection of pairwise relatively prime moduli for the whole set) allows determining one number, which is its solution. After assigning a congruence (or their collection) to a given person, one can use such a connection to dynamically calculate the congruence system for all group members at a given place and time. The correct result for each member means the successful verification of the rights of the group as a whole. Calculations are repeated after each change in group composition. The proposed solution not only increases the functionality of the authorization system but also increases the degree of anonymity in the authentication process, as the user identification is replaced by the identification of the group of which they are members.
Author Tomasz Krokosz (WIiGE / KTI)
Tomasz Krokosz,,
- Department of Information Technology
, Jarogniew Rykowski (WIiGE / KTI)
Jarogniew Rykowski,,
- Department of Information Technology
Pages389-399
Publication size in sheets0.5
Book Zamojski Wojciech , Mazurkiewicz Jacek, Sugier Jarosław, Walkowiak Tomasz, Kacprzyk Janusz (eds.): Theory and Applications of Dependable Computer Systems : Proceedings of the Fifteenth International Conference on Dependability of Computer Systems DepCoS-RELCOMEX, June 29 – July 3, 2020, Brunów, Poland, Advances in Intelligent Systems and Computing, vol. 1173, 2020, Springer, ISBN 978-3-030-48255-8, [978-3-030-48256-5], 713 p., DOI:10.1007/978-3-030-48256-5
Keywords in EnglishGroup users authorization, Authorization set of users, Authorization using Chinese Remainder, Theorem Common authorization
DOIDOI:10.1007/978-3-030-48256-5_38
URL https://link.springer.com/chapter/10.1007/978-3-030-48256-5_38
Languageen angielski
Score (nominal)40
Score sourceconferenceList
ScoreMinisterial score = 40.0, 06-07-2020, ChapterFromConference
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?