Homomorphic one-time pad encryption

By using irrational numbers generated encryption keys and mathematical function management keys in shared data sets, the problems of data security and access control in multi-user environments are solved, and flexible and efficient key management is realized, ensuring the security of the data set and resource efficiency.

CN116982287BActive Publication Date: 2024-11-15THEON TECH LLC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202180094392.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2020-12-23
Filing Date
2021-12-21
Publication Date
2024-11-15
Estimated Expiration
2041-12-21

AI Technical Summary

Technical Problem

The prior art is difficult to securely protect data and allow users to access correctly in shared data sets, especially in multi-user environments, and existing key management solutions are resource-intensive or lack of flexibility.

Method used

Generate and distribute irrational number-based encryption keys for multiple users through a computing device, allowing users to access the corresponding parts of the data set, and using mathematical functions such as the square root of non-complete square numbers to generate and manage keys to ensure access permissions and Data security.

Benefits of technology

It realizes secure access control of shared data sets, ensures that users can only access data within their permissions, improves the flexibility of key management and resource utilization efficiency, and avoids the defects of resource-intensive key storage.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116982287B_ABST
    Figure CN116982287B_ABST
Patent Text Reader

Abstract

A system for protecting a data set includes a computing device that provides different users with access to portions of the data set and can encrypt the portions by generating an encryption key for each portion using a single mathematical function. The key is generated by applying a starting point and a length to the solution of the mathematical function. The process of generating the decryption key is provided to authorized users so that they can view and manipulate only the portions of the data set that they are authorized to access.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The field of the invention is data encryption and security. Background Art

[0002] The Background Description includes information that may be helpful in understanding the present invention. It is not an admission that any of the information provided herein is prior art or relevant to the presently claimed invention, or that any publication specifically or implicitly referenced is prior art.

[0003] Protecting shared datasets introduces problems that do not exist with single-user datasets. For shared datasets, the system must be able to protect the data while being flexible enough to allow users to access the data correctly. Unfortunately, this creates complexity, and the system must handle many separate keys for all users and constantly update each key.

[0004] It is well known that one-time pads are completely secure. However, the use of a one-time pad requires that both parties share a key in advance, and that the key can only be used once. This means that both parties must store many keys in advance for many exchanges. The difficulties associated with these requirements lead to public key cryptography schemes being preferred over one-time pad schemes.

[0005] Others have tried to address this problem.

[0006] Bryant's WO 20190110955 discusses the use of a one-time pad for password generation. However, Bryant's solution requires storing all passwords in a large pad, which is resource intensive.

[0007] WO 00 / 65768 to Persson discusses determining a maximum key length. However, Persson's approach to generating shortened keys is such that a function can still only be used once.

[0008] Therefore, there remains a need for a system that securely protects shared datasets while expertly providing correct access to its users. Summary of the invention

[0009] The present subject matter provides apparatus, systems, and methods in which a computing device grants access to multiple users to add or modify data within a data set without allowing any user to access data beyond their authority.

[0010] The system of the subject invention includes a computing device that controls access to a data set. The data set is encrypted.

[0011] Based on a request from an authorized first user, the computing device may grant access to a corresponding first portion of the data set to the first user. At some point, based on a request from an authorized second user, the computing device may grant access to a corresponding second portion of the data set to the second user. The first portion accessible to the first user and the second portion accessible to the second user share an overlapping portion of the data file. In other words, there is a portion of the data file that both the first user and the second user can access.

[0012] To control access to the various data portions, the computing device encrypts the first portion (minus the overlapping portion) using a first encryption key. The computing device encrypts the second portion (minus the overlapping portion) using a second encryption key, and then encrypts the overlapping portion using a third key. In this case, the first user is then provided with the first key and the third key (or provided with a method of how to derive these keys), and the second user is provided with the second key and the third key (or provided with a method of how to derive these keys), so that they can access and modify or add to their corresponding data portions accordingly.

[0013] In embodiments where users derive their keys, each user must derive the key corresponding to their respective portion as well as any keys that apply to any shared portions.

[0014] In an embodiment of the inventive subject matter, each of the first key, the second key, and the third key is derived from an irrational number.

[0015] In variations of these embodiments, the irrational number is derived from a mathematical function known to the first user and the second user and the computing device. In these embodiments, the key can be derived by solving the mathematical function to obtain the irrational number and then applying the starting point and length to the decimal of the mathematical function.

[0016] In variations of these embodiments, the mathematical function involves calculating, by the computing device, a square root of a non-perfect square number.

[0017] It is contemplated that the data set may be any data set in which multiple users may contribute data to the data set and / or modify some of the data stored in the data set. Examples of contemplated data sets include voter registration databases, collaborative work data, shared documents, and the like.

[0018] Various objects, features, aspects, and advantages of the inventive subject matter will become more apparent from the following detailed description of preferred embodiments and the accompanying drawings, in which like reference numerals represent like components.

[0019] All publications identified herein are incorporated by reference to the same extent as if each individual publication or patent application was specifically and individually indicated to be incorporated by reference. If a definition or use of a term in an incorporated reference is inconsistent or contrary to the definition of that term provided herein, the definition of that term provided herein applies and the definition of that term in the reference does not apply.

[0020] The following description includes information that may be helpful in understanding the present invention. It is not an admission that any of the information provided herein is prior art or relevant to the presently claimed invention, or that any publication specifically or implicitly referenced is prior art.

[0021] In some embodiments, the numerals representing the number of components, properties (such as concentration, reaction conditions, etc.) used to describe and claim certain embodiments of the present invention are understood to be modified with the term "about" in some cases. Therefore, in some embodiments, the numerical parameters proposed in the written description and the appended claims are approximate values, which can be varied according to the desired properties sought to be obtained in a particular embodiment. In some embodiments, the numerical parameters should be interpreted according to the number of significant figures reported and by applying common rounding techniques. Although the numerical ranges and parameters of the wide range of some embodiments of the present invention are approximate values, the numerical values ​​set forth in the specific examples are reported as accurately as possible. The numerical values ​​presented in some embodiments of the present invention may contain certain errors, which are necessarily caused by the standard deviation found in their respective test measurements.

[0022] Unless the context dictates otherwise, all ranges set forth herein should be interpreted as including their endpoints, and open-ended ranges should be understood to include only commercially practical values. Likewise, unless the context dictates otherwise, all lists of values ​​should be interpreted as including intermediate values.

[0023] As used in this specification and throughout the claims that follow, the meanings of “a,” “an,” and “the” include plural references unless the context clearly dictates otherwise. Also, as used in this specification, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.

[0024] The description of the range of values ​​herein is intended only as a shorthand method for quoting each individual value falling within the range individually. Unless otherwise indicated herein, each individual value is incorporated into the specification as if it were individually narrated herein. Unless otherwise indicated herein or clearly contradictory to the context, all methods described herein can be performed in any suitable order. The use of any and all examples or exemplary language (e.g., "such as") provided with respect to some embodiments herein is intended only to better illustrate the present invention, without limiting the scope of the present invention otherwise claimed. Any language in the specification should not be interpreted as indicating any unclaimed element that is essential to the practice of the present invention.

[0025] The grouping of the alternative elements or embodiments of the present invention disclosed herein should not be construed as limiting. Each group member can be referred to and claimed individually or in any combination with other members of the group or other elements found herein. For convenience and / or patentability reasons, one or more members of a group can be included in a group, or deleted from a group. When any such inclusion or deletion occurs, the specification is deemed to include the modified group in this article, thereby satisfying the written description of all Markush groups used in the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 is a diagrammatic overview of a system according to an embodiment of the inventive subject matter.

[0027] Figure 2 is a flow diagram of a process performed by a system according to an embodiment of the inventive subject matter.

[0028] Figure 3 are examples of parts of the dataset, including overlapping parts.

[0029] Figure 4 is a detailed flow chart of a process for generating encryption keys according to an embodiment of the present subject matter.

[0030] Figure 5 Provides a simplified illustrative example of the starting point and length applied to the original key to generate the shortened key. DETAILED DESCRIPTION

[0031] Throughout the following discussion, there will be a lot of references to servers, services, interfaces, engines, modules, clients, peers, portals, platforms, or other systems formed by computing devices. It should be understood that the use of these terms is considered to represent one or more computing devices, which have at least one processor (e.g., Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Digital Signal Processor (DSP), x86, ARM, ColdFire, Central Processing Unit (GPU), multi-core processor, etc.), which is programmed to execute software instructions stored on a computer-readable tangible non-temporary medium (e.g., hard drive, solid-state drive, Random Access Memory (RAM), flash memory, Read-Only Memory (ROM), etc.). For example, a server may include one or more computers that operate as a network server, database server, or other type of computer server in a manner that performs the described roles, responsibilities, or functions. It should be further understood that the disclosed computer-based algorithms, processes, methods or other types of instruction sets may be embodied as computer program products, which include non-temporary, tangible computer-readable media storing instructions that cause a processor to perform the disclosed steps. Various servers, systems, databases or interfaces may use standardized protocols or algorithms to exchange data, which may be based on HTTP, HTTPS, AES, public-private key exchange, network service application programming interface (Application Programming Interface, API), known financial transaction protocols or other electronic information exchange methods. Data exchange can be carried out through a packet switching network, the Internet, a local area network (Local Area Network, LAN), a wide area network (Wide Area Network, WAN), a virtual private network (Virtual Private Network, VPN) or other types of packet switching networks.

[0032] The following discussion provides many example embodiments of the subject matter of the present invention. Although each embodiment represents a single combination of elements of the present invention, the subject matter of the present invention is considered to include all possible combinations of the disclosed elements. Therefore, if one embodiment includes elements A, B, and C, and a second embodiment includes elements B and D, the subject matter of the present invention is also considered to include other remaining combinations of A, B, C, or D, even if not explicitly disclosed.

[0033] As used herein, unless the context dictates otherwise, the term "coupled to" is intended to include direct coupling (where two elements being coupled to each other are in contact with each other) and indirect coupling (where at least one additional element is located between the two elements). Therefore, the terms "coupled to" and "coupled with..." are synonymous.

[0034] Figure 1 is a diagrammatic overview of a system 100 according to an embodiment of the inventive subject matter.

[0035] like Figure 1 As shown, system 100 includes computing device 110 communicatively coupled to database 120. Database 120 may be housed within computing device 110 and / or in a separate computing device communicatively coupled to computing device 110. Database 120 stores one or more data sets 122 that are accessible to users.

[0036] exist Figure 1 , computing device 110 is described as a single computing device. However, it should be understood that in embodiments, computing device 110 may be comprised of multiple computing devices that collectively perform the functions associated with computing device 110 discussed herein.

[0037] System 100 also includes a plurality of user computing devices 130A-130x corresponding to users who may access some or all of the data in data set 122 as permitted by computing device 110. Figure 1 As shown, user computing device 130 may be able to connect to database 120 directly and / or via computing device 110 .

[0038] Contemplated types of data sets 122 include, but are not limited to, voter registration databases, shared documents, confidential records data sets, government data sets, or financial data sets.

[0039] Figure 2 A flow chart of a process performed by system 100 according to an embodiment of the inventive subject matter is provided.

[0040] At step 210A, computing device 110 receives a request to grant access to data in data set 122 to first user computing device 130A. The request may include a designation of a portion or subset of data set 122 that a user of first user computing device 130A is authorized to access. Based on the request and the permission, computing device 110 establishes access to the requested portion of data set 122 to first user computing device 130A. "Access" may include, but is not limited to, the ability to view the authorized portion of data set 122, add to the authorized portion of data set 122, change / modify the authorized portion of data set 122, and / or delete from the authorized portion of data set 122.

[0041] At step 210B (which may be sometime before, simultaneously with, or after the request at step 210A), computing device 110 receives a request to authorize a second user computing device 130B (corresponding to a second user) to access data in data set 122. The request may include a designation of a portion or subset of data set 122 to which a second user of second user computing device 130B is authorized to access. The second subset of data from the data set is different from the first subset of data, but has an overlapping portion. This Figure 3 Based on the request and permission, computing device 110 establishes access to the second user computing device to access the corresponding portion of data set 122 .

[0042] Figure 3 An overview of the overlap between the portions of the dataset 122 that different users may access is provided. Continuing with the example above, the first user computing device 130A is given access to a corresponding first portion 322A of the dataset 122. The second user computing device 130B is given access to a corresponding second portion 322B of the dataset 122. However, if Figure 3 As shown, there is an overlap 322C between the first portion 322A and the second portion 322B. The overlap 322C corresponds to data that both the first user and the second user (via computing devices 130A and 130B) can access.

[0043] After establishing permissions at steps 210A and 210B, but before providing computing devices 130A, 130B with the information needed to actually access their respective portions of the data set, computing device 110 generates encryption keys for each of portion 322A, portion 322B, and overlapping portion 322C at step 220. At step 230, computing device 110 encrypts first portion 322A using a first encryption key, encrypts second portion 322B using a second encryption key, and encrypts overlapping portion 322C using a third encryption key.

[0044] In embodiments of the inventive subject matter, the first encryption key, the second encryption key, and the third encryption key are derived based on irrational numbers. In variations of these embodiments, the irrational numbers are derived from mathematical functions known to a computing device having access to the data file. In this example, the mathematical functions are known to computing device 110 and provided by computing device 110 to first user computing device 130A and second user computing device 130B.

[0045] In further variations of these embodiments, the mathematical function is a function that includes calculating a square root of a non-perfect square number.

[0046] Computing device 110 may access one or more mathematical functions stored on a memory (either stored within computing device 110 or stored on an external database communicatively coupled to computing device 110). Preferably, the system stores a plurality of suitable mathematical functions.

[0047] For each user, computing device 110 generates encryption and decryption keys in these embodiments as follows:

[0048] Figure 4 The processes associated with generating the encryption key and the encryption data in steps 220 and 230 according to an embodiment of the present subject matter are described in more detail.

[0049] At step 410, computing device 110 selects a mathematical function to be used to obtain the original key. In embodiments where multiple mathematical functions are stored, the function may be a mathematical function or algorithm as further discussed herein. The function may be selected according to a predetermined order or schedule. Alternatively, the function may be randomly selected or user selected. The sending computing device 110 obtains the selected function from the functions stored in memory (e.g., from a dedicated function database).

[0050] In step 420, computing device 110 solves the function to obtain the original key. The original key is either an irrational number or a transcendental number with an infinite or nearly infinite number of decimal places. Therefore, the function is a function whose output is an irrational number and / or a transcendental number. By using irrational numbers or transcendental numbers, the system and method of the subject of the present invention have the flexibility of obtaining many encryption keys from the same function without repeating some or all of the encryption keys. Because irrational numbers do not have patterns, the system and method of the subject of the present invention can ensure true randomness in the generation of cryptographic keys. For example, a function can take the square root of a non-perfect square number. This produces an irrational number. In an illustrative example, the function to be solved can be the square root of 20.

[0051] At step 430, computing device 110 selects a starting point and a length. The starting point specifies the starting digit in the decimal of the original key. The length specifies the number of digits following the starting digit. The starting digit and the length are preferably integer values ​​so that they identify an exact digit position and an exact length.

[0052] At step 440, computing device 110 applies the starting point and length to the decimal of the original key to generate a shortened key. Thus, the shortened key is a key starting from the starting number and including the numbers after the starting number according to the length.

[0053] Figure 5 Provides a simplified illustrative example of the starting point and length applied to the original key to generate the shortened key. Figure 5An example of includes the original key 510 (which in this simplified example is the square root of 2). The starting point 520 "4" indicates that the starting number is the fourth digit in the decimal of the original key. In this example, the starting point 520 "4" indicates that the starting number is "2". The length 530, which in this case is 7 characters, specifies the length of the shortened key. Therefore, in this case, the shortened key is "2135623". It should be noted that Figure 5 The starting point and length of are for illustration purposes only. The starting point can be any point along the decimal of the original key, and the length can be any suitable length. In some embodiments, the length can correspond to the length of the data to be encrypted.

[0054] Computing device 110 may then encrypt the data set or portion using the shortened key at step 450. A shortened key is a key used for both encryption and decryption.

[0055] At step 460 , computing device 110 may then store the selected function (or an indicator of the selected function), starting point, and length in memory for future reference.

[0056] Techniques for generating and using encryption / decryption keys using a single shared mathematical function are described in more detail in the inventor's own pending U.S. patent application US17 / 018,582, entitled “Method of Storing and Distributing Large Keys,” filed on September 11, 2020, which is incorporated herein by reference in its entirety.

[0057] For the process of the inventive subject matter discussed herein, computing device 110 selects a mathematical function to be used with a particular data set and then generates a key for each portion of the data set based on the mathematical function. Thus, for first portion 322A of the data set, computing device 110 performs the mathematical function using the first starting point (and, if the key can have different lengths, the first length) Figure 4 and Figure 5 Similarly, for the second portion 322B of the data set, the computing device 110 performs the same mathematical function but using a second starting point (and, if the key can have a different length, using the second length) to generate the first key. Figure 4 and Figure 5 To generate a third key for the third portion 322C of the data set, computing device 110 solves the same mathematical function and applies a third starting point (and, if the key can have a different length, a third length).

[0058] It should be noted that, for ease of understanding, steps 220 and 230 are discussed together with respect to the keys required for encryption of portions 322A, 322B, and 322C. However, it is not required that the generation of keys and the encryption of data be performed simultaneously. Instead, when the user computing device 130 is granted access to a portion of the data, the generation of keys and the encryption of the corresponding portion will be performed.

[0059] For example: computing device 130A is first given access to first data set portion 322A. Computing device 110 generates a corresponding encryption key for the entire data set 322A (because there is no overlapping portion yet). At a later point, second computing device 130B is given access to corresponding data set portion 322B. Because creating this access to second computing device 130B creates overlapping portion 322C, computing device 110 at this point generates an encryption key for the overlapping portion and encrypts that portion separately.

[0060] In order to allow the user computing device 130 to access the corresponding portion of the data set 122, the computing device 110 distributes the mathematical function to the computing device 110 at some time before providing the actual access information to the respective authorized portions of the data set 122. When the authorized portion of the data set is defined for each user in steps 210A and 210B, the computing device 110 performs the process of steps 220 and 230 (including Figure 4 and Figure 5 process) to encrypt those parts using the corresponding generated encryption keys.

[0061] At step 240, computing device 110 sends the starting position and length information of each corresponding key to each user computing device 130A, 130B. Each user computing device 130A and 130B can then use the provided mathematical function and generate a corresponding decryption key for the data set portion by applying the provided starting point and length, repeating Figure 4 and Figure 5 process (but choose the starting point and length provided). As parts of the dataset change (either due to changes in user access rights or because the datasets overlap, e.g. Figure 3 322A-322C) and a new key is needed, computing device 110 derives the new key and provides the new starting point and length to the corresponding user computing device. Thus, at step 240, when each corresponding user computing device 130A, 130B receives the information required to generate the decryption key, actual access to data set portions 322A-322C is effectively granted to them.

[0062] As users complete access to their respective data sets, computing device 110 continues to re-encrypt the portion of the data set accessed by the user computing device.

[0063] It will be apparent to those skilled in the art that, without departing from the inventive concepts herein, many more modifications are possible in addition to those already described. Therefore, the subject matter of the present invention is not limited except in the spirit of the appended claims. Furthermore, in interpreting both the specification and the claims, all terms should be interpreted in as broad a manner as possible consistent with the context. In particular, the terms "comprises" and "comprising" should be interpreted as referring to elements, parts or steps in a non-exclusive manner, indicating that the referenced elements, parts or steps may exist, be used or be combined with other elements, parts or steps not explicitly referenced. When the specification claims refer to at least one selected from A, B, C... and N, the text should be interpreted as requiring only one element of the group, rather than A plus N or B plus N, and so on.

Claims

1. A method for updating a secure data file using a shared one-time password between multiple users, comprising: authorizing, by a computing device, access to a first portion of a data set to a first user; authorizing, by the computing device, access to a second portion of the data set to a second user, wherein the first portion of the data file and the second portion of the data set share an overlapping portion of the data file; providing, by the computing device, the mathematical function to the first user and the second user; The first portion minus the overlapping portion is encrypted by the computing device using a first key, wherein the first key is derived by: solving the mathematical function by the computing device to obtain an irrational number; and applying, by the computing device, a first starting position and a first length to a decimal of the irrational number to obtain the first key; The second portion minus the overlapping portion is encrypted by the computing device using a second key, wherein the second key is derived by: solving the mathematical function by the computing device to obtain the irrational number; and applying, by the computing device, a second starting position and a second length to a decimal of the irrational number to obtain the second key; and The overlapping portion is encrypted by the computing device using a third key, wherein the third key is derived by: solving the mathematical function by the computing device to obtain the irrational number; and A third starting position and a third length are applied, by the computing device, to a decimal of the irrational number to obtain the third key.

2. The method according to claim 1, wherein: The mathematical function includes calculating the square root of a non-perfect square number.

3. The method according to claim 1, wherein: The data set includes a shared document.

4. The method according to claim 1, wherein: The data set includes a voter registration database.

5. The method according to claim 1, wherein: The step of authorizing access to the first user also includes: decrypting, by a first user computing device corresponding to the first user, the first portion minus the overlapping portion using a copy of the first key; decrypting, by the first user computing device, the overlapping portion using the copy of the third key; and Editing of data within the decrypted first portion is enabled via the first user computing device.