Attribute Based Signature Architecture for Transferring Digital Document

Attribute Based Signature Architecture for Transferring Digital Document | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Attribute Based Signature Architecture for Transferring Digital Document Trishna Panse, Prashant Panse This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1761828/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Authentication and cryptosystems are two examples of methods for ensuring user identification and data confidentiality. Because of its one-way nature, hashing is used to verify the identity and accuracy of data travelling across an open medium. It detects unlawful modifications and changes made to transmissions. Digital signature, which deals with document uniqueness and creator oneness, are a well-known application of hashing. It is updated by adding more information about the users' attributes and is classified as an attribute-based signature (ABS). We investigated various past approaches to the ABS phenomena and discovered certain unsolved challenges, resulting in a solution that decreases the difficulty level, utilization, and operating expense coupled with signature creation and confirmation. For focusing the method of digital signatures using elements and their first order logic, we suggested a unique Attribute Based Signature Architecture for Transferring Digital Document. The system includes flexible primitives that give signing parties complete control over signature generation as well as policy-based access security constraints. It has a message-based first order logic and protects the secrecy of signatures. After examining the technique logically, various benefits were discovered, which will be confirmed soon by the implementation solution over the recommended framework under the specified key. Data Security Digital Signature Message Digest RSA Algorithm Attribute Based Signature Certificate X.509 Computational Complexity Figures Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7 Figure 8 Figure 9 Figure 10 Figure 11 1. Introduction Cryptosystems are data security and protection systems that are set up in an impermanent manner to handle intruded systems. All the technologically advanced models are mathematically powerful enough to handle unauthorized access and alterations. This is a computationally difficult challenge, and the intricacy of the system must be assumed, which is trackable and employed as a foremost developing part for a security approach. Cryptography systems are classified as symmetric or asymmetric depending upon the key used. DES, AES, and RSA are some examples of such cryptosystems. The cryptographic algorithms such as triple DES, RSA and MD5 together also used in secure data transmission through Bluetooth communication [ 16 ]. The implements created with these cryptography systems provide arbitrary visions for confirming a purpose's security. A random revelation responds to questions with an arbitrary response, subject matter to the requirement that the response is unique for distinct queries, but it can be same when the same thought is queried again. Pre-image resistance and collision resistance are two desirable qualities of such an oracle [ 1 – 3 ]. To understand the basic concept of digital signature generation and verification one must adopt some interesting teaching learning methodology so that the practical approach towards the problem solving will be improved [ 17 ]. Signatures have been used for authentication for centuries. Depending on the application, it uses different forms. Until then, document signing intended to categorize someone. It is proven that the Signatures are extremely useful in the creation of approved documents, but it has traditionally had to be dependent on outside proof that the people endorsing the document have the proper experience. This is the danger of today. Two keys public and private keys are used by Signers: The public key which is known to every user and was used as an input for the authentication process, and the private key that was only known to the signer and was used in the process of signing. The technique is then shown to be safe under the random oracle assumption. Finally, a powerful hash function replaces the random oracle when it comes to actually materializing the scheme. Researchers believe that showing the security of a cryptography system under the random disclosure is same as confirming the security of a technique based on misusing the message digest which is the hash value of original message. 2. Materials And Methods Internet application is getting denser due to their heavy infrastructure and client through its services and hyper-visor virtualization technologies. It offers the solutions to users’ problem as a service model in which each computation paradigm can be used based on a tenancy model. But the concern is that how such security services are delivered to end user in utility manner and hence the solution proposed in [ 7 ]. But as the advancement of Internet based applications also changing user expectation is also increasing like it cannot protect the confidentiality of users' data from Internet based applications service providers One of the other aspects of data security is the need to assess before embarking on creating a security scheme for data stored in the Internet based applications systems is the levels of need; that is, how secure do you want that data to be? The levels of security of any data object should be thought of as concentric layers of increasingly pervasive security impact, which I have divided here into their parts to show the increasing granularity of this pervasiveness: Phase 1: Transfer of the file using encrypted protocols and standards Phase 2: Access control of the file itself, but without encryption of the content Phase 3: Access control methods (including encryption of the content of a data object) Phase 4: Access control methods (including encryption of the data and files) also including rights management options (for example, no copying content without authentication, no printing content without authorization, date restrictions, etc.) We have number of security areas that are frequently overlooked by numerous IT associations, and that can be significantly increase the possibility of threat of spreading protection breach. The above-mentioned conditions require unambiguous attention and correction, that involves [ 4 ]: 2.1 Problem in existing system 2.1.1 Insufficient User Authentication The typical username/password validation techniques are grossly poor to protect against security breach, particularly with the creative social engineering attacks that have been used recently. Strong authentication is required and must, and different methods should be used based on a number of background factors. Hardware tokens have been commonly used, but the recent breach of Secure ID tokens, as well as the cost and strength associated with hardware tokens make this an unappealing option. 2.1.2 Insufficient Regular User Access Validation As a user undergoes role changes, promotions, etc., their access privileges are often no longer tailored to their current task. Although many businesses occasionally or occasionally authenticate access rights of user, it should be done formally, routinely, and it would be computerized so that this could be performed instantly and clearly. Absence of routine authorization can increase the risk of separation of function violations and other irregularities. [ 5 ]. 2.1.3 Absence of Privileged User System Controls A leading trigger of security infringements and problems, confidential users frequently have additional access than their jobs require. The mentioned users require extensive access rights to perform their jobs. [ 1 ]. 2.1.4 Lack of Information Use Control Controlling access to information is not enough protection or remedy. One must control use of information also in order to help ensure that it isn’t disclosed or stolen. These weaknesses have been contributing cause to some of the most visible security breaches of the recent past. 2.1.5 Lack of Continuous User Monitoring Apparently in the WikiLeaks breach, nobody noticed that someone was copying thousands of sensitive documents from military systems over a short period of time. Many security breaches could be identified with a comprehensive method to monitoring user activity for suspicious activities. As a result, the lack of effective and nonstop monitoring of user movement is also one of the most important contributors to a high risk of security breach [ 13 , 14 ]. 2.2 Proposed Work Decipherers would notice an application requiring attribute signatures and has specific qualities that no existing cryptosystem can supply. The user can benefit from Attribute Based Signature (ABS) by passing selected attributes from a list of attributes to generate a stronger signature. It uses the anonymity phenomenon to protect the seclusion of uniqueness of the user and their signature. In this, key overturning is linked to generation of attribute, which would help ABS operate better. However, the signature verifier faced a difficult scenario because he was unaware of the user's choice of properties, so the substantiation process was not exactly what I needed. This study presents a revolutionary attribute-based signature architecture that addresses all the issues while also being simple to implement. For dealing with user-selected qualities, it exhibits an enhancement over key overturning using a defined influence. The designed mandate acts as a conduit between the verifier and the user, facilitating attribute negotiation. The user requests the intermediate's secret key share, as well as a reversal check for its uniqueness and the appropriate properties, to generate the signature. The RSA algorithms are used to conduct key exchanges here. 2.2.1 Architecture The procedure begins with the formation of a group of users interested in creating digital signature-based documents. Each user has a unique group of attributes connected with their characteristics and system usage patterns. They were referred to as attributes. These user attributes are extracted and stored in the attribute collection. Next, the user's data fragment, which included all the user's information in the form of an attribute, was used to verify the identity of documents in the form of a signature. The digest is calculated by the hash algorithm using this predicate logic. Using the signer's private key, the digest is now encrypted with the RSA cryptosystem. Along with the user's attributes, this private key will verify the user's identity. After encryption is applied, the X.509 certificate is included to store user verification information. As part of an identity check, the authentication server checks this authentication information. All temporary data made by the system are signed and kept in the depository. It is used to make the signature over again. if the user generates another document with the same signature request. It also includes the signature generation predicate logic. Now, the document's signed message is transmitted over an open channel. Next, the second stage of the suggested Architecture is the process of verification. This segment begins with the origin of the digest associated with each fragment of data. Before extracting the digest, it must be decrypted using the private key of signer which is stored in the register of public key. As soon as the digest has been decrypted, the correlated hash with the data is extracted, and the original data is given as input to the MD5 algorithm to recalculate the message digest. We compare this recalculated message digest to the obtained message digest alongside the authentication of the user's attributes. If the attributes match those connected with user's identity, then the signature and sender's validity are proved. At last, the message is available to the recipient along with a certificate containing its confirmation. 2.2 Components Need to be Develop 2.2.1 Attribute Extractor 2.2.2 Signature Predicate Logic Generator 2.2.3 MD5 Hash Algorithm 2.2.4 RSA Cryptosystems 2.2.5 Certificate Manager 2.2.6 Hash Matching 2.2.7 Messaging System 2.3 Implementation 2.3.1 First form of the developed tool requires authentication as security primitive as shown in Fig. 3 . Thus, here the user’s needs to login into the system using its defined credential, once the id and password are verified the welcome message will be displayed. 2.3.2 This interface requires file selection for secure sharing between the different users of the system as shown in Fig. 4 . Initially after the file selection attribute-based signature framework will generate a set of user attributes passed for proving the user’s identity on the basis of its behavior. These attributes are passed to the MD5 hash algorithm for generating the digest. The user attributes will also be passed into RSA encryption mechanism for generating the key. The system generates two sets of keys out of which one is used either public key of full key pair. 2.3.3 Once the key is generated then the X.509 certificate will be displayed. This certificate will contain the information related with user, profile, file, and system. If the system and its selected attributes are correct, then a successful message is displayed for file. After all the process the system is ready to share the file securely as shown in Fig. 5 . If the process and the generated file are correct, then proceeds for sending the file. 2.3.4 The Fig. 6 will contain the different set of quantitative values such as hash generation time, key generation time, encryption time, file sending time and overall process time. 2.3.5 As shown in Fig. 7 after clicking on Send File for Authentication, File successfully sent. 2.3. 6 Fig. 8 shows the receiving of file from the different users. This will work as reverse process for verification of securely transmitted file. This panel will show the list of files received from different users. The verifier selects any file form the list and the verifier will apply the reverse process and verifies the sender. By this mechanism integrity, authentication and confidentiality was assured. 2.3.7 As shown in Figure 9 once the file gets verified then the verifier will forward to designated receiver. 2.3.8 The receiver will download the file and the file will get saved with the local disk space and can be viewed by the user. The process is based on the activities assessment of the administrator. This interface as shown in Fig. 10 also displays the result attributes for capturing the quantitative values during different stages of data retrieval. Mainly it verifies the attributes, digest, encryption, hash, certificates, and decryption time used by the system to get the accuracy, efficiency, and reliability analysis. 3. Result We have collected the application’s data about different users, files, sizes, platforms, etc., so that we can use a variety of statistics to study the benefits of the intended method. as shown in the table below. These statistics will serve as user attribute records. Table 1 illustrates the various attributes utilized by the algorithm to implement the proposed solution. This table contains a variety of users, each of whom utilizes the application for file variations based on their file type and sizing. We have also written down other useful things, like the IP address, the platform, and the system attributes. In this Table 1 the initial input, the attributes will be further managed for message digest calculation, encryption, and digital signature part of the algorithm. Table 1 User Attributes Records User Name (Attribute Value 1) File Name (Attribute Value 2) Size Attribute Value 3 Bytes System Name (Attribute Value 4) Platform (Attribute Value 5) IP (Attribute Value 6) User1 User_File_Logs.txt 292 Medi-Caps Windows7 and above 127.0.0.1 User2 Administration.docx 14715 Medi-Caps Windows7 and above 127.0.15.6 User3 licence_4.jpg 38002 Medi-Caps Windows7 and above 127.63.23.54 User4 Publication (Main)- 1.docx 124871 Medi-Caps Windows7 and above 127.45.68.95 User5 Data Mining.docx 39310 Medi-Caps Windows7 and above 127.86.32.47 In Table 2 , we've compiled the statistics obtained by applying Attribute-Based Signature to the application. This table displays the amount of time (in milliseconds) the proposed algorithm required to complete each phase as well as the total duration of the process. We have applied Attribute Based Signature to the users and attributes listed in Table 1 . The recommended algorithm Attribute Based Signature Architecture consists of the steps outlined in the suggested architecture of the methodology, such as message digest calculation, generation of key, encryption using RSA, and at last upload the processed document. The preceding table demonstrates the variation in time required by the proposed Attribute Based Signature Architecture for different file types and sizes. The durations of time that we measured for various heads are expressed in milliseconds (ms). Table 2 Secure Transmission Statistics File Name File Size (Bytes) File ID MD5 RSA PuK RSA PrK Digital Signature Generation File Sending Data Mining.docx 39310 1045 34.451 2.089 1.063 2402.153 2298.020 3rd sem syllabus.pdf 15982 1046 36.991 2.259 1.181 5259.561 2190.814 Paper85695- 700.pdf 173616 1047 0.779 1.295 1.062 2254.592 2033.666 Networking questions.docx 37038 1048 0.382 1.540 1.144 2034.081 1660.554 Paper85695- 700.pdf 173616 1049 0.757 1.530 1.052 2396.672 1631.66 In Table 3 , we attempt to depict the algorithm's extraction time. Using Hash, RSA, and digital signatures, we have anticipated a data integrity and authenticity mechanism in this system. According to the approach, we have to calculate the message digest again and compare this to the message digest which was calculated earlier to ensure data integrity. Then, as the next step, we will determine the file's authentication key. This table indicates the recalculation time of the message digest and decipher the file to recover its initial form. This table displays the type of file and size that were displayed in former tables. Table 3 Secure Extraction Statistics File Name File Size (Bytes) File ID MD5 Extract RSA PuK Check Digital Signature Verification File Download Data Mining.docx 39310 1045 7.158 9.384 2.283 9.514 3rd sem syllabus.pdf 15982 1034 36.110 111.386 91.785 48.683 Paper85695- 700.pdf 897738 1028 19.650 17.650 2.862 38.277 Networking questions.docx 124871 1040 18.999 24.571 5.985 77.236 Paper85695- 700.pdf 120233 1032 20.285 24.171 6.164 64.118 The Table 4 shows the qualitative analysis of proposed Attribute Based Signature Architecture algorithm in addition to the individual approaches already in place. The table illustrates the system's execution behavior for different types of files, their size, and time required in signature design and verification. This table evidently demonstrates the proposed method sets the bar for future security research. Currently, fusion methods are not robustly analyzed, it could be possible along with additional instances and coequality testing and obtain an accurate analysis. Table 4 Qualitative Analysis Comparison with Existing Approach Approach Name Feature Difference Time Size Complexity Efficiency MD5 (Existing) Single High Variable High High RSA (Existing) Single Optimal Variable Low High Digital Signature (Existing) Single Low Fixed Low Low Certificate Generation (Existing) Single Optimal Fixed High Low Proposed Architecture Multiple Optimal Variable Low High 4. Conclusion The security of data depends on the mechanism used to exchange information between parties. After receiving documents which is digitally certified, we must verify the sender and the document in order to validate their authenticity. The file relates to it. Is digital signature. A new field employs a mechanism known as attribute-based signature to provide the user with greater data security flexibility and assurance. We analyzed the working capabilities of various attribute-based signature mechanisms in order to identify some outstanding issues. Generally speaking, the computational complexity and resource consumption of these algorithms [ 5 , 11 ] are quite high. Thus, a novel strategy is required to address the problems. To address these issues, we have proposed a novel Attribute-Based Signature Architecture. In the systematic stage of evaluation, we are obtaining results that will be validated by its prototypical implementation, which will be developed in the near future. Declarations Acknowledgements This work supported by the Department of Information Technology and Computer Science & Engineering of Medi-Caps University, Indore, India. Conflicts of interest The Authors Dr. Prashant Panse and Ms. Trishna Panse declare that there is no conflict of interest. References Digital signing of original reports, By ALS Laboratories, Version 1 Published in 2010 James H. Davenport and Dalia Khader, “Digital signatures: What you are versus \Who you are", in IACR Technical Review, 2010. S Sharmila Deva Selvi, Subhashini Venugopalan and C. Pandu Rangan, “A New Approach to Threshold Attribute Based Signatures”, in Theoretical Computer Science Laboratory Department of Computer Science and Engineering Indian Institute of Technology, Madras, 2010. Hemanta K. Maji, Manoj Prabhakaran and Mike Rosulek, Attribute-Based Signatures”, in Department of Computer Science, University of Illinois, Urbana-Champaign, 2010. Piyi Yang , Tanveer A. Zia , Zhenfu Cao and Xiaolei Dong , “Efficient and expressive fully secure attribute-based signature in the standard model”, Australian Information Security Management Conference, Edith Cowan University, Dec 2011. Javier Herranz, Fabien Laguillaumie, Benoit Libert and Carla Rafols, “Short Attribute- Based Signatures for Threshold Predicates”, in RSA Conference, San Francisco, United States, Springer, 2012. Fugeng ZENG, Chunxiang XU, Qinyi LI and Xiujie ZHANG, “Attribute-based Signature Scheme with Constant Size Signature”, in Journal of Computational Information Systems, ISSN: 2875–2882, Vol 8, Issue 7, 2012. Rupesh Vaishnav, “Attribute Based Signature Scheme For Attribute Based Encrypted Data In Cloud”, in International Journal of Engineering Research & Technology (IJERT),ISSN: 2278-0181, Vol. 1 Issue 10, Dec 2012 Feng Cai, Wangmei Guo and Ximeng Liu,“Threshold attribute based universal designated verifier signature scheme in the standard model”, in WSEAS Transaction on Communications, ISSN: 2224-2864, Vol. 13, 2012. Kefeng Wang, Yi Mu and Fuchun Guo, “Attribute-based signature with message recovery”, in Research Online Lecture Notes in Computer Science, University of Wollongong, 2014. Brinda Hampiholi, Gergely Alpaar, Fabian van den Broek, and Bart Jacobs, Towards Practical Attribute-Based Signatures””, in Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands, 2015 Essam Ghadafi, ”Decentralised Traceable Attribute Based Encryption”, Presentation in University College London, April 2015 Nigel Mc Kelvey , Kevin Curran and Nadarajah Subaginy , “The Internet of Things”, in IGI Global Journals, Category of Mobile and Wireless Computing, DOI: 10.4018/978-1- 4666-5888-2.ch570, 2005 S. Sicari, A. Rizzardi, L.A. Grieco and A. Coen-Porisini, “Security, Privacy & Trust in Internet of Things: the road ahead”, in Preprint submitted to Elsevier, Feb 2015. Xiaofeng Chen, Jin Li, Xinyi Huang, Jingwei Li and Yang Xiang, Secure Outsourced Attribute-Based Signatures””, in IEEE Transaction on Parallel and Distributed Systems, ISSN: 1045-9219, VOL. 25, NO. 12, Dec 2014. Vivek Kapoor et al.” An Integrated Scheme based on Triple DES, RSA and MD5 to Enhance the Security in Bluetooth Communication” International Journal of Computer Applications 50(7):45-50, July 2012. Panse, P., Panse, T., Verma, R., Bhayal, D.K., Agrawal, A. (2019). An Edutainment Approach to Enhance Teaching–Learning Process. In: Kamal, R., Henshaw, M., Nair, P. (eds) International Conference on Advanced Computing Networking and Informatics. Advances in Intelligent Systems and Computing, vol 870. Springer, Singapore. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-1761828","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":116968056,"identity":"e77d862f-e3c7-47dc-9f96-917ba0612a67","order_by":0,"name":"Trishna Panse","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA8UlEQVRIiWNgGAWjYFACxgZmOPsDELOxE9DAg6yFcQZICzMe5RAtDAxwNcw8DMhcHMBe+nDz58Iddnn8s9sfPrb5tU2ej5mB8cPHHDy28CW2Sc88k1wsceeMsXFu323DNmYGZsmZ2/Bo4WFsY+ZtY05suJHDJp3bcxvIBXqHF7+W5s+8bfWJ82+kP/9t2XPbnhgtDdK8bYcTN9xIMGNm+HE7kbCWM4xtQC3Hiw1v5BhL9jbcTm5jZmzG6xf2HvbHQIdV58ndSH/44cef27bz25sPfviIRwsMJIBJxjYw2UBYPVwLwx+iFI+CUTAKRsEIAwBS8Ux6EghwkQAAAABJRU5ErkJggg==","orcid":"https://orcid.org/0000-0001-5639-0632","institution":"Medi-Caps University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Trishna","middleName":"","lastName":"Panse","suffix":""},{"id":116968057,"identity":"b27f31ca-7e13-4917-b437-9d057513e936","order_by":1,"name":"Prashant Panse","email":"","orcid":"","institution":"Medi-Caps University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Prashant","middleName":"","lastName":"Panse","suffix":""}],"badges":[],"createdAt":"2022-06-15 15:13:17","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1761828/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1761828/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":23528937,"identity":"79b5af53-c678-4824-b6cd-971f73d6632d","added_by":"auto","created_at":"2022-07-06 14:53:03","extension":"png","order_by":1,"title":"Figure 1","display":"","copyAsset":false,"role":"figure","size":42085,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eDigital Signature Generation Process\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"1.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/8b45e4d6d817c733aa6cfa58.png"},{"id":23526632,"identity":"1c7cd3df-f9eb-4914-903c-1091dc85c940","added_by":"auto","created_at":"2022-07-06 14:43:03","extension":"png","order_by":2,"title":"Figure 2","display":"","copyAsset":false,"role":"figure","size":53027,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eDigital Signature Verification Process\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"2.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/590238253a07e402970c3713.png"},{"id":23526629,"identity":"c3d7547b-0669-4cec-a35a-38e93b64bed0","added_by":"auto","created_at":"2022-07-06 14:43:03","extension":"png","order_by":3,"title":"Figure 3","display":"","copyAsset":false,"role":"figure","size":160807,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eLogin Screen\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"3.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/3cedd85133619c539b7b6d05.png"},{"id":23526636,"identity":"da4e0a1b-32ec-4021-b635-625ce3064303","added_by":"auto","created_at":"2022-07-06 14:43:03","extension":"png","order_by":4,"title":"Figure 4","display":"","copyAsset":false,"role":"figure","size":47908,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eMain Panel of Attribute Signature\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"4.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/131939823a3fb1d8ecaa87d3.png"},{"id":23526634,"identity":"3d8f2019-43e9-4905-8109-d0f0d9ec9584","added_by":"auto","created_at":"2022-07-06 14:43:03","extension":"png","order_by":5,"title":"Figure 5","display":"","copyAsset":false,"role":"figure","size":64320,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eMain Panel of Successfully Signature Applied\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"5.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/259af8f1f80abb7c09f8d2bd.png"},{"id":23527882,"identity":"ef195f05-7474-428b-8243-e8380ab7f6b7","added_by":"auto","created_at":"2022-07-06 14:48:03","extension":"png","order_by":6,"title":"Figure 6","display":"","copyAsset":false,"role":"figure","size":86912,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eSuccessfully Signature Applied on File\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"6.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/bdb2cd847be8639058faade1.png"},{"id":23526630,"identity":"15f282a1-1511-43ca-861b-babbf98ce884","added_by":"auto","created_at":"2022-07-06 14:43:03","extension":"png","order_by":7,"title":"Figure 7","display":"","copyAsset":false,"role":"figure","size":98549,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eFile successfully sent for Authentication Message\u003c/strong\u003e\u003c/p\u003e\u003cp\u003e\u003cbr\u003e\u003c/p\u003e","description":"","filename":"7.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/9b52aa768b4feff6dcfbff4a.png"},{"id":23527886,"identity":"036d64a3-389c-41cf-9484-a65e07b9eaa6","added_by":"auto","created_at":"2022-07-06 14:48:03","extension":"png","order_by":8,"title":"Figure 8","display":"","copyAsset":false,"role":"figure","size":82220,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eThird Party Verification Panel\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"8.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/45f155a0532951ad5ec861ea.png"},{"id":23527887,"identity":"5dc5aef2-0639-4d7e-a86d-fdd459b53933","added_by":"auto","created_at":"2022-07-06 14:48:03","extension":"png","order_by":9,"title":"Figure 9","display":"","copyAsset":false,"role":"figure","size":95885,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eReceived Files of Third Party Verifier\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"9.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/4e0d4063ade622a7ba9bf0d0.png"},{"id":23526637,"identity":"57c51420-b539-48d5-a21a-c998be18ca45","added_by":"auto","created_at":"2022-07-06 14:43:03","extension":"png","order_by":10,"title":"Figure 10","display":"","copyAsset":false,"role":"figure","size":118804,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eReceiver's Panel\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"10.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/f8ff5aa83b827fec0fa2182e.png"},{"id":23528951,"identity":"a0d79ac6-59a9-46ef-8d2a-6724995cc3c6","added_by":"auto","created_at":"2022-07-06 14:53:03","extension":"png","order_by":11,"title":"Figure 11","display":"","copyAsset":false,"role":"figure","size":168097,"visible":true,"origin":"","legend":"\u003cp\u003e\u003cstrong\u003eReceiver's File\u003c/strong\u003e\u003c/p\u003e","description":"","filename":"11.png","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/be1f4fa2794221c37b623915.png"},{"id":33050993,"identity":"9c779ecc-c7b6-4a59-b2d0-806552396831","added_by":"auto","created_at":"2023-02-16 21:04:33","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1381485,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-1761828/v1/e3ffeb74-253a-4aa7-a202-db6ed53d2aa5.pdf"}],"financialInterests":"","formattedTitle":"Attribute Based Signature Architecture for Transferring Digital Document","fulltext":[{"header":"1. Introduction","content":"\u003cp\u003e \u003cdiv class=\"BlockQuote\"\u003e \u003cp\u003eCryptosystems are data security and protection systems that are set up in an impermanent manner to handle intruded systems. All the technologically advanced models are mathematically powerful enough to handle unauthorized access and alterations. This is a computationally difficult challenge, and the intricacy of the system must be assumed, which is trackable and employed as a foremost developing part for a security approach. Cryptography systems are classified as symmetric or asymmetric depending upon the key used. DES, AES, and RSA are some examples of such cryptosystems. The cryptographic algorithms such as triple DES, RSA and MD5 together also used in secure data transmission through Bluetooth communication [\u003cspan citationid=\"CR16\" class=\"CitationRef\"\u003e16\u003c/span\u003e]. The implements created with these cryptography systems provide arbitrary visions for confirming a purpose's security. A random revelation responds to questions with an arbitrary response, subject matter to the requirement that the response is unique for distinct queries, but it can be same when the same thought is queried again. Pre-image resistance and collision resistance are two desirable qualities of such an oracle [\u003cspan additionalcitationids=\"CR2\" citationid=\"CR1\" class=\"CitationRef\"\u003e1\u003c/span\u003e\u0026ndash;\u003cspan citationid=\"CR3\" class=\"CitationRef\"\u003e3\u003c/span\u003e]. To understand the basic concept of digital signature generation and verification one must adopt some interesting teaching learning methodology so that the practical approach towards the problem solving will be improved [\u003cspan citationid=\"CR17\" class=\"CitationRef\"\u003e17\u003c/span\u003e].\u003c/p\u003e \u003cp\u003eSignatures have been used for authentication for centuries. Depending on the application, it uses different forms. Until then, document signing intended to categorize someone. It is proven that the Signatures are extremely useful in the creation of approved documents, but it has traditionally had to be dependent on outside proof that the people endorsing the document have the proper experience. This is the danger of today. Two keys public and private keys are used by Signers: The public key which is known to every user and was used as an input for the authentication process, and the private key that was only known to the signer and was used in the process of signing. The technique is then shown to be safe under the random oracle assumption. Finally, a powerful hash function replaces the random oracle when it comes to actually materializing the scheme. Researchers believe that showing the security of a cryptography system under the random disclosure is same as confirming the security of a technique based on misusing the message digest which is the hash value of original message.\u003c/p\u003e \u003c/div\u003e \u003c/p\u003e"},{"header":"2. Materials And Methods","content":"\u003cp\u003eInternet application is getting denser due to their heavy infrastructure and client through its services and hyper-visor virtualization technologies. It offers the solutions to users\u0026rsquo; problem as a service model in which each computation paradigm can be used based on a tenancy model. But the concern is that how such security services are delivered to end user in utility manner and hence the solution proposed in [\u003cspan class=\"CitationRef\"\u003e7\u003c/span\u003e]. But as the advancement of Internet based applications also changing user expectation is also increasing like it cannot protect the confidentiality of users\u0026apos; data from Internet based applications service providers One of the other aspects of data security is the need to assess before embarking on creating a security scheme for data stored in the Internet based applications systems is the levels of need; that is, how secure do you want that data to be? The levels of security of any data object should be thought of as concentric layers of increasingly pervasive security impact, which I have divided here into their parts to show the increasing granularity of this pervasiveness:\u003c/p\u003e\n\u003cp\u003ePhase 1: Transfer of the file using encrypted protocols and standards\u003c/p\u003e\n\u003cp\u003ePhase 2: Access control of the file itself, but without encryption of the content\u003c/p\u003e\n\u003cp\u003ePhase 3: Access control methods (including encryption of the content of a data object)\u003c/p\u003e\n\u003cp\u003ePhase 4: Access control methods (including encryption of the data and files) also including rights management options (for example, no copying content without authentication, no printing content without authorization, date restrictions, etc.)\u003c/p\u003e\n\u003cp\u003eWe have number of security areas that are frequently overlooked by numerous IT associations, and that can be significantly increase the possibility of threat of spreading protection breach. The above-mentioned conditions require unambiguous attention and correction, that involves [\u003cspan class=\"CitationRef\"\u003e4\u003c/span\u003e]:\u003c/p\u003e\n\u003cdiv class=\"Section2\" id=\"Sec3\"\u003e\n \u003ch2\u003e2.1 Problem in existing system\u003c/h2\u003e\n \u003cdiv class=\"Section3\" id=\"Sec4\"\u003e\n \u003ch2\u003e2.1.1 Insufficient User Authentication\u003c/h2\u003e\n \u003cp\u003eThe typical username/password validation techniques are grossly poor to protect against security breach, particularly with the creative social engineering attacks that have been used recently. Strong authentication is required and must, and different methods should be used based on a number of background factors. Hardware tokens have been commonly used, but the recent breach of Secure ID tokens, as well as the cost and strength associated with hardware tokens make this an unappealing option.\u003c/p\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec5\"\u003e\n \u003ch2\u003e2.1.2 Insufficient Regular User Access Validation\u003c/h2\u003e\n \u003cp\u003eAs a user undergoes role changes, promotions, etc., their access privileges are often no longer tailored to their current task. Although many businesses occasionally or occasionally authenticate access rights of user, it should be done formally, routinely, and it would be computerized so that this could be performed instantly and clearly. Absence of routine authorization can increase the risk of separation of function violations and other irregularities. [\u003cspan class=\"CitationRef\"\u003e5\u003c/span\u003e].\u003c/p\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec6\"\u003e\n \u003ch2\u003e2.1.3 Absence of Privileged User System Controls\u003c/h2\u003e\n \u003cp\u003eA leading trigger of security infringements and problems, confidential users frequently have additional access than their jobs require. The mentioned users require extensive access rights to perform their jobs. [\u003cspan class=\"CitationRef\"\u003e1\u003c/span\u003e].\u003c/p\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec7\"\u003e\n \u003ch2\u003e2.1.4 Lack of Information Use Control\u003c/h2\u003e\n \u003cp\u003eControlling access to information is not enough protection or remedy. One must control use of information also in order to help ensure that it isn\u0026rsquo;t disclosed or stolen. These weaknesses have been contributing cause to some of the most visible security breaches of the recent past.\u003c/p\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec8\"\u003e\n \u003ch2\u003e2.1.5 Lack of Continuous User Monitoring\u003c/h2\u003e\n \u003cp\u003eApparently in the WikiLeaks breach, nobody noticed that someone was copying thousands of sensitive documents from military systems over a short period of time. Many security breaches could be identified with a comprehensive method to monitoring user activity for suspicious activities. As a result, the lack of effective and nonstop monitoring of user movement is also one of the most important contributors to a high risk of security breach [\u003cspan class=\"CitationRef\"\u003e13\u003c/span\u003e, \u003cspan class=\"CitationRef\"\u003e14\u003c/span\u003e].\u003c/p\u003e\n \u003c/div\u003e\n\u003c/div\u003e\n\u003cdiv class=\"Section2\" id=\"Sec9\"\u003e\n \u003ch2\u003e2.2 Proposed Work\u003c/h2\u003e\n \u003cp\u003eDecipherers would notice an application requiring attribute signatures and has specific qualities that no existing cryptosystem can supply. The user can benefit from Attribute Based Signature (ABS) by passing selected attributes from a list of attributes to generate a stronger signature. It uses the anonymity phenomenon to protect the seclusion of uniqueness of the user and their signature. In this, key overturning is linked to generation of attribute, which would help ABS operate better. However, the signature verifier faced a difficult scenario because he was unaware of the user\u0026apos;s choice of properties, so the substantiation process was not exactly what I needed. This study presents a revolutionary attribute-based signature architecture that addresses all the issues while also being simple to implement. For dealing with user-selected qualities, it exhibits an enhancement over key overturning using a defined influence. The designed mandate acts as a conduit between the verifier and the user, facilitating attribute negotiation. The user requests the intermediate\u0026apos;s secret key share, as well as a reversal check for its uniqueness and the appropriate properties, to generate the signature. The RSA algorithms are used to conduct key exchanges here.\u003c/p\u003e\n \u003cdiv class=\"Section3\" id=\"Sec10\"\u003e\n \u003ch2\u003e2.2.1 Architecture\u003c/h2\u003e\n \u003cp\u003eThe procedure begins with the formation of a group of users interested in creating digital signature-based documents. Each user has a unique group of attributes connected with their characteristics and system usage patterns. They were referred to as attributes. These user attributes are extracted and stored in the attribute collection. Next, the user\u0026apos;s data fragment, which included all the user\u0026apos;s information in the form of an attribute, was used to verify the identity of documents in the form of a signature. The digest is calculated by the hash algorithm using this predicate logic. Using the signer\u0026apos;s private key, the digest is now encrypted with the RSA cryptosystem. Along with the user\u0026apos;s attributes, this private key will verify the user\u0026apos;s identity. After encryption is applied, the X.509 certificate is included to store user verification information. As part of an identity check, the authentication server checks this authentication information. All temporary data made by the system are signed and kept in the depository. It is used to make the signature over again. if the user generates another document with the same signature request. It also includes the signature generation predicate logic. Now, the document\u0026apos;s signed message is transmitted over an open channel.\u003c/p\u003e\n \u003cdiv class=\"BlockQuote\"\u003e\n \u003cp\u003eNext, the second stage of the suggested Architecture is the process of verification. This segment begins with the origin of the digest associated with each fragment of data. Before extracting the digest, it must be decrypted using the private key of signer which is stored in the register of public key. As soon as the digest has been decrypted, the correlated hash with the data is extracted, and the original data is given as input to the MD5 algorithm to recalculate the message digest. We compare this recalculated message digest to the obtained message digest alongside the authentication of the user\u0026apos;s attributes. If the attributes match those connected with user\u0026apos;s identity, then the signature and sender\u0026apos;s validity are proved. At last, the message is available to the recipient along with a certificate containing its confirmation.\u003c/p\u003e\n \u003c/div\u003e\n \u003c/div\u003e\n\u003c/div\u003e\n\u003cdiv class=\"Section2\" id=\"Sec11\"\u003e\n \u003ch2\u003e2.2 Components Need to be Develop\u003c/h2\u003e\n \u003cdiv class=\"Section3\" id=\"Sec12\"\u003e\n \u003ch2\u003e2.2.1 Attribute Extractor\u003c/h2\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec13\"\u003e\n \u003ch2\u003e2.2.2 Signature Predicate Logic Generator\u003c/h2\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec14\"\u003e\n \u003ch2\u003e2.2.3 MD5 Hash Algorithm\u003c/h2\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec15\"\u003e\n \u003ch2\u003e2.2.4 RSA Cryptosystems\u003c/h2\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec16\"\u003e\n \u003ch2\u003e2.2.5 Certificate Manager\u003c/h2\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec17\"\u003e\n \u003ch2\u003e2.2.6 Hash Matching\u003c/h2\u003e\n \u003c/div\u003e\n \u003cdiv class=\"Section3\" id=\"Sec18\"\u003e\n \u003ch2\u003e2.2.7 Messaging System\u003c/h2\u003e\n \u003c/div\u003e\n\u003c/div\u003e\n\u003cdiv class=\"Section2\" id=\"Sec19\"\u003e\n \u003ch2\u003e2.3 Implementation\u003c/h2\u003e\n \u003cp\u003e\u003cem\u003e2.3.1\u003c/em\u003e First form of the developed tool requires authentication as security primitive as shown in Fig. \u003cspan class=\"InternalRef\"\u003e3\u003c/span\u003e. Thus, here the user\u0026rsquo;s needs to login into the system using its defined credential, once the id and password are verified the welcome message will be displayed.\u003c/p\u003e\n \u003cdiv class=\"BlockQuote\"\u003e\n \u003cp\u003e\u003cem\u003e2.3.2\u003c/em\u003e This interface requires file selection for secure sharing between the different users of the system as shown in \u003cstrong\u003eFig.\u0026nbsp;4\u003c/strong\u003e. Initially after the file selection attribute-based signature framework will generate a set of user attributes passed for proving the user\u0026rsquo;s identity on the basis of its behavior. These attributes are passed to the MD5 hash algorithm for generating the digest. The user attributes will also be passed into RSA encryption mechanism for generating the key. The system generates two sets of keys out of which one is used either public key of full key pair.\u003c/p\u003e\n \u003c/div\u003e\n \u003cp\u003e\u003cem\u003e2.3.3\u003c/em\u003e Once the key is generated then the X.509 certificate will be displayed. This certificate will contain the information related with user, profile, file, and system. If the system and its selected attributes are correct, then a successful message is displayed for file. After all the process the system is ready to share the file securely as shown in Fig. \u003cspan class=\"InternalRef\"\u003e5\u003c/span\u003e. If the process and the generated file are correct, then proceeds for sending the file.\u003c/p\u003e\n \u003cp\u003e2.3.4 The \u003cstrong\u003eFig.\u0026nbsp;6\u003c/strong\u003e will contain the different set of quantitative values such as hash generation time, key generation time, encryption time, file sending time and overall process time.\u003c/p\u003e\n \u003cdiv class=\"Section3\" id=\"Sec20\"\u003e\n \u003cp\u003e2.3.5 As shown in Fig. \u003cspan class=\"InternalRef\"\u003e7\u003c/span\u003e after clicking on Send File for Authentication, File successfully sent.\u003c/p\u003e\n \u003cp\u003e\u003c/p\u003e\n \u003cp\u003e\u003cem\u003e2.3.\u003c/em\u003e6 Fig. \u003cspan class=\"InternalRef\"\u003e8\u003c/span\u003e shows the receiving of file from the different users. This will work as reverse process for verification of securely transmitted file. This panel will show the list of files received from different users. The verifier selects any file form the list and the verifier will apply the reverse process and verifies the sender. By this mechanism integrity, authentication and confidentiality was assured.\u003c/p\u003e\n \u003cp\u003e\u003cem\u003e2.3.7\u003c/em\u003e As shown in \u003cstrong\u003eFigure 9\u003c/strong\u003e once the file gets verified then the verifier will forward to designated receiver.\u003c/p\u003e\n \u003cp\u003e\u003cem\u003e2.3.8\u003c/em\u003e The receiver will download the file and the file will get saved with the local disk space and can be viewed by the user. The process is based on the activities assessment of the administrator. This interface as shown in \u003cstrong\u003eFig.\u0026nbsp;10\u003c/strong\u003e also displays the result attributes for capturing the quantitative values during different stages of data retrieval. Mainly it verifies the attributes, digest, encryption, hash, certificates, and decryption time used by the system to get the accuracy, efficiency, and reliability analysis.\u003c/p\u003e\n \u003c/div\u003e\n\u003c/div\u003e"},{"header":"3. Result","content":"\u003cp\u003eWe have collected the application\u0026rsquo;s data about different users, files, sizes, platforms, etc., so that we can use a variety of statistics to study the benefits of the intended method. as shown in the table below. These statistics will serve as user attribute records. Table\u0026nbsp;\u003cspan refid=\"Tab1\" class=\"InternalRef\"\u003e1\u003c/span\u003e illustrates the various attributes utilized by the algorithm to implement the proposed solution. This table contains a variety of users, each of whom utilizes the application for file variations based on their file type and sizing. We have also written down other useful things, like the IP address, the platform, and the system attributes. In this Table\u0026nbsp;\u003cspan refid=\"Tab1\" class=\"InternalRef\"\u003e1\u003c/span\u003e the initial input, the attributes will be further managed for message digest calculation, encryption, and digital signature part of the algorithm.\u003c/p\u003e \u003cp\u003e \u003cdiv class=\"gridtable\"\u003e\u003ctable float=\"Yes\" id=\"Tab1\" border=\"1\"\u003e \u003ccaption language=\"En\"\u003e \u003cdiv class=\"CaptionNumber\"\u003eTable 1\u003c/div\u003e \u003cdiv class=\"CaptionContent\"\u003e \u003cp\u003eUser Attributes Records\u003c/p\u003e \u003c/div\u003e \u003c/caption\u003e \u003ccolgroup cols=\"6\"\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c1\" colnum=\"1\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c2\" colnum=\"2\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c3\" colnum=\"3\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c4\" colnum=\"4\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c5\" colnum=\"5\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c6\" colnum=\"6\"\u003e\u003c/div\u003e \u003cthead\u003e \u003ctr\u003e \u003cth align=\"left\" colname=\"c1\"\u003e \u003cp\u003eUser Name (Attribute Value 1)\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c2\"\u003e \u003cp\u003eFile Name\u003c/p\u003e \u003cp\u003e(Attribute Value 2)\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c3\"\u003e \u003cp\u003eSize Attribute Value 3 Bytes\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c4\"\u003e \u003cp\u003eSystem Name (Attribute Value 4)\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c5\"\u003e \u003cp\u003ePlatform\u003c/p\u003e \u003cp\u003e(Attribute Value 5)\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c6\"\u003e \u003cp\u003eIP (Attribute Value 6)\u003c/p\u003e \u003c/th\u003e \u003c/tr\u003e \u003c/thead\u003e \u003ctbody\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eUser1\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eUser_File_Logs.txt\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003e292\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eMedi-Caps\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eWindows7\u003c/p\u003e \u003cp\u003eand above\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003e127.0.0.1\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eUser2\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eAdministration.docx\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003e14715\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eMedi-Caps\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eWindows7\u003c/p\u003e \u003cp\u003eand above\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003e127.0.15.6\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eUser3\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003elicence_4.jpg\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003e38002\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eMedi-Caps\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eWindows7\u003c/p\u003e \u003cp\u003eand above\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003e127.63.23.54\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eUser4\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003ePublication (Main)- 1.docx\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003e124871\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eMedi-Caps\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eWindows7\u003c/p\u003e \u003cp\u003eand above\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003e127.45.68.95\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eUser5\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eData Mining.docx\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003e39310\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eMedi-Caps\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eWindows7\u003c/p\u003e \u003cp\u003eand above\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003e127.86.32.47\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003c/tbody\u003e \u003c/colgroup\u003e \u003c/table\u003e\u003c/div\u003e \u003c/p\u003e \u003cp\u003eIn Table\u0026nbsp;\u003cspan refid=\"Tab2\" class=\"InternalRef\"\u003e2\u003c/span\u003e, we've compiled the statistics obtained by applying Attribute-Based Signature to the application. This table displays the amount of time (in milliseconds) the proposed algorithm required to complete each phase as well as the total duration of the process. We have applied Attribute Based Signature to the users and attributes listed in Table\u0026nbsp;\u003cspan refid=\"Tab1\" class=\"InternalRef\"\u003e1\u003c/span\u003e.\u003c/p\u003e \u003cp\u003eThe recommended algorithm Attribute Based Signature Architecture consists of the steps outlined in the suggested architecture of the methodology, such as message digest calculation, generation of key, encryption using RSA, and at last upload the processed document. The preceding table demonstrates the variation in time required by the proposed Attribute Based Signature Architecture for different file types and sizes. The durations of time that we measured for various heads are expressed in milliseconds (ms).\u003c/p\u003e \u003cp\u003e \u003cdiv class=\"gridtable\"\u003e\u003ctable float=\"Yes\" id=\"Tab2\" border=\"1\"\u003e \u003ccaption language=\"En\"\u003e \u003cdiv class=\"CaptionNumber\"\u003eTable 2\u003c/div\u003e \u003cdiv class=\"CaptionContent\"\u003e \u003cp\u003eSecure Transmission Statistics\u003c/p\u003e \u003c/div\u003e \u003c/caption\u003e \u003ccolgroup cols=\"8\"\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c1\" colnum=\"1\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c2\" colnum=\"2\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c3\" colnum=\"3\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c4\" colnum=\"4\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c5\" colnum=\"5\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c6\" colnum=\"6\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c7\" colnum=\"7\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c8\" colnum=\"8\"\u003e\u003c/div\u003e \u003cthead\u003e \u003ctr\u003e \u003cth align=\"left\" colname=\"c1\"\u003e \u003cp\u003eFile Name\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c2\"\u003e \u003cp\u003eFile Size (Bytes)\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c3\"\u003e \u003cp\u003eFile ID\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c4\"\u003e \u003cp\u003eMD5\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c5\"\u003e \u003cp\u003eRSA PuK\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c6\"\u003e \u003cp\u003eRSA PrK\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c7\"\u003e \u003cp\u003eDigital Signature Generation\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c8\"\u003e \u003cp\u003eFile Sending\u003c/p\u003e \u003c/th\u003e \u003c/tr\u003e \u003c/thead\u003e \u003ctbody\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eData Mining.docx\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e39310\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1045\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e34.451\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e2.089\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e1.063\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e2402.153\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c8\"\u003e \u003cp\u003e2298.020\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003e3rd sem syllabus.pdf\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e15982\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1046\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e36.991\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e2.259\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e1.181\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e5259.561\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c8\"\u003e \u003cp\u003e2190.814\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003ePaper85695- 700.pdf\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e173616\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1047\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e0.779\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e1.295\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e1.062\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e2254.592\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c8\"\u003e \u003cp\u003e2033.666\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eNetworking questions.docx\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e37038\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1048\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e0.382\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e1.540\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e1.144\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e2034.081\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c8\"\u003e \u003cp\u003e1660.554\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003ePaper85695- 700.pdf\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e173616\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1049\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e0.757\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e1.530\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e1.052\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e2396.672\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c8\"\u003e \u003cp\u003e1631.66\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003c/tbody\u003e \u003c/colgroup\u003e \u003c/table\u003e\u003c/div\u003e \u003c/p\u003e \u003cp\u003eIn Table\u0026nbsp;\u003cspan refid=\"Tab3\" class=\"InternalRef\"\u003e3\u003c/span\u003e, we attempt to depict the algorithm's extraction time. Using Hash, RSA, and digital signatures, we have anticipated a data integrity and authenticity mechanism in this system. According to the approach, we have to calculate the message digest again and compare this to the message digest which was calculated earlier to ensure data integrity. Then, as the next step, we will determine the file's authentication key. This table indicates the recalculation time of the message digest and decipher the file to recover its initial form. This table displays the type of file and size that were displayed in former tables.\u003c/p\u003e \u003cp\u003e \u003cdiv class=\"gridtable\"\u003e\u003ctable float=\"Yes\" id=\"Tab3\" border=\"1\"\u003e \u003ccaption language=\"En\"\u003e \u003cdiv class=\"CaptionNumber\"\u003eTable 3\u003c/div\u003e \u003cdiv class=\"CaptionContent\"\u003e \u003cp\u003eSecure Extraction Statistics\u003c/p\u003e \u003c/div\u003e \u003c/caption\u003e \u003ccolgroup cols=\"7\"\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c1\" colnum=\"1\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c2\" colnum=\"2\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c3\" colnum=\"3\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c4\" colnum=\"4\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c5\" colnum=\"5\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c6\" colnum=\"6\"\u003e\u003c/div\u003e \u003cdiv align=\"char\" char=\".\" class=\"colspec\" colname=\"c7\" colnum=\"7\"\u003e\u003c/div\u003e \u003cthead\u003e \u003ctr\u003e \u003cth align=\"left\" colname=\"c1\"\u003e \u003cp\u003eFile Name\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c2\"\u003e \u003cp\u003eFile Size (Bytes)\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c3\"\u003e \u003cp\u003eFile ID\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c4\"\u003e \u003cp\u003eMD5 Extract\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c5\"\u003e \u003cp\u003eRSA PuK Check\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c6\"\u003e \u003cp\u003eDigital Signature Verification\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c7\"\u003e \u003cp\u003eFile Download\u003c/p\u003e \u003c/th\u003e \u003c/tr\u003e \u003c/thead\u003e \u003ctbody\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eData Mining.docx\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e39310\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1045\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e7.158\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e9.384\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e2.283\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e9.514\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003e3rd sem syllabus.pdf\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e15982\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1034\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e36.110\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e111.386\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e91.785\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e48.683\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003ePaper85695- 700.pdf\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e897738\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1028\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e19.650\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e17.650\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e2.862\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e38.277\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eNetworking questions.docx\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e124871\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1040\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e18.999\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e24.571\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e5.985\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e77.236\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003ePaper85695- 700.pdf\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c2\"\u003e \u003cp\u003e120233\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c3\"\u003e \u003cp\u003e1032\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c4\"\u003e \u003cp\u003e20.285\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c5\"\u003e \u003cp\u003e24.171\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c6\"\u003e \u003cp\u003e6.164\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"char\" char=\".\" colname=\"c7\"\u003e \u003cp\u003e64.118\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003c/tbody\u003e \u003c/colgroup\u003e \u003c/table\u003e\u003c/div\u003e \u003c/p\u003e \u003cp\u003eThe Table\u0026nbsp;\u003cspan refid=\"Tab4\" class=\"InternalRef\"\u003e4\u003c/span\u003e shows the qualitative analysis of proposed Attribute Based Signature Architecture algorithm in addition to the individual approaches already in place. The table illustrates the system's execution behavior for different types of files, their size, and time required in signature design and verification. This table evidently demonstrates the proposed method sets the bar for future security research. Currently, fusion methods are not robustly analyzed, it could be possible along with additional instances and coequality testing and obtain an accurate analysis.\u003c/p\u003e \u003cp\u003e \u003cdiv class=\"gridtable\"\u003e\u003ctable float=\"Yes\" id=\"Tab4\" border=\"1\"\u003e \u003ccaption language=\"En\"\u003e \u003cdiv class=\"CaptionNumber\"\u003eTable 4\u003c/div\u003e \u003cdiv class=\"CaptionContent\"\u003e \u003cp\u003eQualitative Analysis Comparison with Existing Approach\u003c/p\u003e \u003c/div\u003e \u003c/caption\u003e \u003ccolgroup cols=\"6\"\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c1\" colnum=\"1\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c2\" colnum=\"2\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c3\" colnum=\"3\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c4\" colnum=\"4\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c5\" colnum=\"5\"\u003e\u003c/div\u003e \u003cdiv align=\"left\" class=\"colspec\" colname=\"c6\" colnum=\"6\"\u003e\u003c/div\u003e \u003cthead\u003e \u003ctr\u003e \u003cth align=\"left\" colname=\"c1\"\u003e \u003cp\u003eApproach Name\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c2\"\u003e \u003cp\u003eFeature\u003c/p\u003e \u003cp\u003eDifference\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c3\"\u003e \u003cp\u003eTime\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c4\"\u003e \u003cp\u003eSize\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c5\"\u003e \u003cp\u003eComplexity\u003c/p\u003e \u003c/th\u003e \u003cth align=\"left\" colname=\"c6\"\u003e \u003cp\u003eEfficiency\u003c/p\u003e \u003c/th\u003e \u003c/tr\u003e \u003c/thead\u003e \u003ctbody\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eMD5 (Existing)\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eSingle\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003eHigh\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eVariable\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eHigh\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003eHigh\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eRSA (Existing)\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eSingle\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003eOptimal\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eVariable\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eLow\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003eHigh\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eDigital Signature (Existing)\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eSingle\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003eLow\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eFixed\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eLow\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003eLow\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003eCertificate Generation\u003c/p\u003e \u003cp\u003e(Existing)\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eSingle\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003eOptimal\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eFixed\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eHigh\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003eLow\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003ctr\u003e \u003ctd align=\"left\" colname=\"c1\"\u003e \u003cp\u003e\u003cb\u003eProposed Architecture\u003c/b\u003e\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c2\"\u003e \u003cp\u003eMultiple\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c3\"\u003e \u003cp\u003eOptimal\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c4\"\u003e \u003cp\u003eVariable\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c5\"\u003e \u003cp\u003eLow\u003c/p\u003e \u003c/td\u003e \u003ctd align=\"left\" colname=\"c6\"\u003e \u003cp\u003eHigh\u003c/p\u003e \u003c/td\u003e \u003c/tr\u003e \u003c/tbody\u003e \u003c/colgroup\u003e \u003c/table\u003e\u003c/div\u003e \u003c/p\u003e"},{"header":"4. Conclusion","content":"\u003cp\u003eThe security of data depends on the mechanism used to exchange information between parties. After receiving documents which is digitally certified, we must verify the sender and the document in order to validate their authenticity. The file relates to it. Is digital signature. A new field employs a mechanism known as attribute-based signature to provide the user with greater data security flexibility and assurance. We analyzed the working capabilities of various attribute-based signature mechanisms in order to identify some outstanding issues. Generally speaking, the computational complexity and resource consumption of these algorithms [\u003cspan citationid=\"CR5\" class=\"CitationRef\"\u003e5\u003c/span\u003e, \u003cspan citationid=\"CR11\" class=\"CitationRef\"\u003e11\u003c/span\u003e] are quite high. Thus, a novel strategy is required to address the problems. To address these issues, we have proposed a novel Attribute-Based Signature Architecture. In the systematic stage of evaluation, we are obtaining results that will be validated by its prototypical implementation, which will be developed in the near future.\u003c/p\u003e"},{"header":"Declarations","content":"\u003cp\u003e\u003cstrong\u003eAcknowledgements\u003c/strong\u003e\u003c/p\u003e\n\u003cp\u003eThis work supported by the Department of Information Technology and Computer Science \u0026amp; Engineering of Medi-Caps University, Indore, India. \u0026nbsp;\u0026nbsp;\u003c/p\u003e\n\u003cp\u003e\u003cstrong\u003eConflicts of interest\u003c/strong\u003e\u003c/p\u003e\n\u003cp\u003eThe Authors Dr. Prashant Panse and Ms. Trishna Panse declare that there is no conflict of interest.\u003c/p\u003e"},{"header":"References","content":"\u003col class=\"decimal_type\"\u003e\n\u003cli\u003eDigital signing of original reports, By ALS Laboratories, Version 1 Published in 2010\u003c/li\u003e\n\u003cli\u003eJames H. Davenport and Dalia Khader, \u0026ldquo;Digital signatures: What you are versus \\Who you are\u0026quot;, in IACR Technical Review, 2010.\u003c/li\u003e\n\u003cli\u003eS Sharmila Deva Selvi, Subhashini Venugopalan and C. Pandu Rangan, \u0026ldquo;A New Approach to Threshold Attribute Based Signatures\u0026rdquo;, in Theoretical Computer Science Laboratory Department of Computer Science and Engineering Indian Institute of Technology, Madras, 2010.\u003c/li\u003e\n\u003cli\u003eHemanta K. Maji, Manoj Prabhakaran and Mike Rosulek, Attribute-Based Signatures\u0026rdquo;, in Department of Computer Science, University of Illinois, Urbana-Champaign, 2010.\u003c/li\u003e\n\u003cli\u003ePiyi Yang , Tanveer A. Zia , Zhenfu Cao and Xiaolei Dong , \u0026ldquo;Efficient and expressive fully secure attribute-based signature in the standard model\u0026rdquo;, Australian Information Security Management Conference, Edith Cowan University, Dec 2011.\u003c/li\u003e\n\u003cli\u003eJavier Herranz, Fabien Laguillaumie, Benoit Libert and Carla Rafols, \u0026ldquo;Short Attribute- Based Signatures for Threshold Predicates\u0026rdquo;, in RSA Conference, San Francisco, United States, Springer, 2012.\u003c/li\u003e\n\u003cli\u003eFugeng ZENG, Chunxiang XU, Qinyi LI and Xiujie ZHANG, \u0026ldquo;Attribute-based Signature Scheme with Constant Size Signature\u0026rdquo;, in Journal of Computational Information Systems, ISSN: 2875\u0026ndash;2882, Vol 8, Issue 7, 2012.\u003c/li\u003e\n\u003cli\u003eRupesh Vaishnav, \u0026ldquo;Attribute Based Signature Scheme For Attribute Based Encrypted Data In Cloud\u0026rdquo;, in International Journal of Engineering Research \u0026amp; Technology (IJERT),ISSN: 2278-0181, Vol. 1 Issue 10, Dec 2012\u003c/li\u003e\n\u003cli\u003eFeng Cai, Wangmei Guo and Ximeng Liu,\u0026ldquo;Threshold attribute based universal designated verifier signature scheme in the standard model\u0026rdquo;, in WSEAS Transaction on Communications, ISSN: 2224-2864, Vol. 13, 2012.\u003c/li\u003e\n\u003cli\u003eKefeng Wang, Yi Mu and Fuchun Guo, \u0026ldquo;Attribute-based signature with message recovery\u0026rdquo;, in Research Online Lecture Notes in Computer Science, University of Wollongong, 2014.\u003c/li\u003e\n\u003cli\u003eBrinda Hampiholi, Gergely Alpaar, Fabian van den Broek, and Bart Jacobs, Towards Practical Attribute-Based Signatures\u0026rdquo;\u0026rdquo;, in Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands, 2015\u003c/li\u003e\n\u003cli\u003eEssam Ghadafi, \u0026rdquo;Decentralised Traceable Attribute Based Encryption\u0026rdquo;, Presentation in University College London, April 2015\u003c/li\u003e\n\u003cli\u003eNigel Mc Kelvey , Kevin Curran and Nadarajah Subaginy , \u0026ldquo;The Internet of Things\u0026rdquo;, in IGI Global Journals, Category of Mobile and Wireless Computing, DOI: 10.4018/978-1- 4666-5888-2.ch570, 2005\u003c/li\u003e\n\u003cli\u003eS. Sicari, A. Rizzardi, L.A. Grieco and A. Coen-Porisini, \u0026ldquo;Security, Privacy \u0026amp; Trust in Internet of Things: the road ahead\u0026rdquo;, in Preprint submitted to Elsevier, Feb 2015.\u003c/li\u003e\n\u003cli\u003eXiaofeng Chen, Jin Li, Xinyi Huang, Jingwei Li and Yang Xiang, Secure Outsourced Attribute-Based Signatures\u0026rdquo;\u0026rdquo;, in IEEE Transaction on Parallel and Distributed Systems, ISSN: 1045-9219, VOL. 25, NO. 12, Dec 2014.\u003c/li\u003e\n\u003cli\u003eVivek Kapoor et al.\u0026rdquo; An Integrated Scheme based on Triple DES, RSA and MD5 to Enhance the Security in Bluetooth Communication\u0026rdquo; International Journal of Computer Applications 50(7):45-50, July 2012.\u003c/li\u003e\n\u003cli\u003ePanse, P., Panse, T., Verma, R., Bhayal, D.K., Agrawal, A. (2019). An Edutainment Approach to Enhance Teaching\u0026ndash;Learning Process. In: Kamal, R., Henshaw, M., Nair, P. (eds) International Conference on Advanced Computing Networking and Informatics. Advances in Intelligent Systems and Computing, vol 870. Springer, Singapore.\u003c/li\u003e\n\u003c/ol\u003e"}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":true,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":false,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Data Security, Digital Signature, Message Digest, RSA Algorithm, Attribute Based Signature, Certificate X.509, Computational Complexity","lastPublishedDoi":"10.21203/rs.3.rs-1761828/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1761828/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eAuthentication and cryptosystems are two examples of methods for ensuring user identification and data confidentiality. Because of its one-way nature, hashing is used to verify the identity and accuracy of data travelling across an open medium. It detects unlawful modifications and changes made to transmissions. Digital signature, which deals with document uniqueness and creator oneness, are a well-known application of hashing. It is updated by adding more information about the users' attributes and is classified as an attribute-based signature (ABS). We investigated various past approaches to the ABS phenomena and discovered certain unsolved challenges, resulting in a solution that decreases the difficulty level, utilization, and operating expense coupled with signature creation and confirmation. For focusing the method of digital signatures using elements and their first order logic, we suggested a unique Attribute Based Signature Architecture for Transferring Digital Document. The system includes flexible primitives that give signing parties complete control over signature generation as well as policy-based access security constraints. It has a message-based first order logic and protects the secrecy of signatures. After examining the technique logically, various benefits were discovered, which will be confirmed soon by the implementation solution over the recommended framework under the specified key.\u003c/p\u003e","manuscriptTitle":"Attribute Based Signature Architecture for Transferring Digital Document","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-07-06 14:43:01","doi":"10.21203/rs.3.rs-1761828/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"ef0d214f-909a-4f22-8b80-a4bd2bd6041d","owner":[],"postedDate":"July 6th, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2023-02-16T21:04:25+00:00","versionOfRecord":[],"versionCreatedAt":"2022-07-06 14:43:01","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-1761828","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1761828","identity":"rs-1761828","version":["v1"]},"buildId":"WrCJVZZCHTDjtuVLN7oU0","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}