Signature system, signature device, signature request device, signature method, and program

The signature system employs Bloom filters to aggregate and verify signature information, addressing the communication inefficiencies in decentralized platforms by reducing data exchange, thus enhancing the efficiency of signature verification and proof of existence in decentralized systems.

WO2024247027A1PCT designated stage expired Publication Date: 2024-12-05NT T INC
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
PCT/JP2023/019870
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-29
Publication Date
2024-12-05

AI Technical Summary

Technical Problem

Conventional signature methods in decentralized data distribution platforms experience rapid increases in communication overhead as the number of users grows, leading to inefficiencies.

Method used

A signature system utilizing Bloom filters to probabilistically indicate the inclusion of signature target information, reducing communication by aggregating and transmitting only the necessary information, thereby minimizing the amount of data exchanged among signature devices and request devices.

Benefits of technology

This approach significantly reduces communication overhead while maintaining the integrity of signature verification, allowing for efficient proof of existence without relying on trusted third parties, suitable for decentralized timestamping and timestamp verification.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure JP2023019870_05122024_PF_FP_ABST
    Figure JP2023019870_05122024_PF_FP_ABST
Patent Text Reader

Abstract

Each signature device 1 includes: (1) a first transmission unit 11 that transmits signature target information to each of other signature devices and at least one signature request device; (2) an aggregation unit 12 that generates aggregate signature target information obtained by aggregating the signature target information and signature target information received from each of the other signature devices 1 and the at least one signature request device 2; (3) a Bloom filter generation unit 13 that generates a Bloom filter, which is a data structure stochastically indicating whether the signature target information and the signature target information received from each of the other signature devices and the at least one signature request device 2 are included; (4) a signature information generation unit 14 that generates signature information for the aggregate signature target information by using a secret key; and (5) a second transmission unit 15 that transmits the signature information and the Bloom filter to each of the other signature devices 1 and the at least one signature request device 2.
Need to check novelty before this filing date? Find Prior Art

Description

Signature system, signature device, signature request device, signature method and program

[0001] The disclosed technology relates to signature technology.

[0002] An important function of a data distribution platform is "proof of existence (timestamp)," which proves that data existed at a certain time. To safely and efficiently perform proof of existence in a decentralized data distribution platform, a so-called random signature has been proposed, which is a method of performing proof of existence by participants who randomly join the decentralized platform (see, for example, Non-Patent Document 1). In joint signatures using client resources such as this technology, in order to avoid synchronization issues caused by asynchronous communication, a method can be considered in which a complete set of information about the signer and the subject of signature is sent to all users who will receive the signature.

[0003] Morinori Ohashi, Yifan Zhang, Takuro Hosoi, and Kanta Matsuura, "Study on DAG-based Distributed Timestamp Methods," Research Report Computer Security (CSEC), 2023-CSEC-100, Vol. 67, pp. 1-7, 2023.

[0004] However, with such a simple method, there was a problem that the amount of communication traffic increased rapidly as the number of users increased, because each signer had to transmit the object of signature to the signature recipient, and the object of signature had to be sent.

[0005] The disclosed technology aims to provide a signature system, a signature device, a signature request device, a signature method, and a program that reduce communication traffic compared to conventional systems.

[0006] One aspect of the disclosed technology is a signature system including at least one signature device and at least one signature request device, wherein each of the at least one signature device includes: (1) a first transmission unit that transmits signature target information to each of the other signature devices and the at least one signature request device; (2) an aggregation unit that generates aggregate signature target information that aggregates the signature target information and signature target information received from each of the other signature devices and the at least one signature request device; (3) a Bloom filter generation unit that generates a Bloom filter, which is a data structure that probabilistically indicates whether the signature target information and the signature target information received from each of the other signature devices and the at least one signature request device are included; and (4) a signature unit that generates signature information for the aggregate signature target information using a private key. and (5) a second transmitting unit that transmits the signature information and the Bloom filter to each of the other signing devices and at least one signature requesting device, each of which includes: (1) a first receiving unit that receives the signature information and the Bloom filter from each of the at least one signing device; (2) a second receiving unit that receives signature target information from each of the at least one signing device and the other signature requesting devices; and (3) an aggregate signature information generating unit that generates aggregate signature target information that aggregates the signature information using the received Bloom filter, determines whether the received signature information is as expected using the generated aggregate signature target information, and generates aggregate signature information that aggregates the signature information that is determined to be as expected.

[0007] According to the disclosed technology, communication volume can be reduced.

[0008] Fig. 1 is a diagram showing an example of the functional configuration of a signature system. Fig. 2 is a diagram showing an example of the functional configuration of a signature device. Fig. 3 is a diagram showing an example of the functional configuration of a signature request device system. Fig. 4 is a diagram showing an example of a processing procedure of a signature method. Fig. 5 is a diagram showing an example of an algorithm. Fig. 6 is a diagram showing an example of the functional configuration of a computer.

[0009] Hereinafter, embodiments of the disclosed technology will be described with reference to the drawings. Note that components having the same functions in the drawings are given the same reference numerals, and redundant description will be omitted.

[0010] 1, the signature system is composed of at least one signature device 1 and at least one signature request device 2. For example, in a system consisting of multiple terminal devices, at least one signature device 1 is selected probabilistically from these multiple terminal devices. The signature system may include devices other than the at least one signature device 1 and the at least one signature request device 2.

[0011] As shown in FIG. 2, the signature device 1 includes, for example, a first transmission unit 11, an aggregation unit 12, a Bloom filter generation unit 13, a signature information generation unit 14, and a second transmission unit 15.

[0012] As shown in FIG. 3, the signature requesting device 2 includes, for example, a first receiving unit 21, a second receiving unit 22, and an aggregate signature information generating unit 23.

[0013] The signature method is realized by the signature system performing the processes of steps S11 to S15 and steps S21 to S23 shown in FIG.

[0014] At least one signature device 1 performs signing in cooperation with other signature devices 1. An example of the processing of each signature device 1 is described below. Each signature device 1 performs the processing of the function SIGNING defined, for example, from "1:" to "14:" in the algorithm of FIG. 5.

[0015] <Step S11> The first transmission unit 11 of the signature device 1 transmits the signature target information to each of the other signature devices 1 and at least one signature request device 2 (step S11).

[0016] The process of step S11 corresponds to "3:" in the algorithm of Fig. 5. In the algorithm, m local is its own signature target information, and BroadcastTarget means that it is transmitted to each of the other signature devices 1 and at least one signature request device 2.

[0017] In the example algorithm, the signature target information m local Not only that, but also your own public key pk local also transmits the signature request information to each of the other signature devices 1 and at least one signature request device 2.

[0018] Signature target information m local An example of H(h l +h l-1 +r) or h l Of course, the signature target information m local refers to the final state of the local signature chain, and if this information can be used to verify the chain structure, then H(h l +h l-1 +r) or h l It doesn't have to be.

[0019] H is a given hash function, and h l is the aggregate signature information σ previously added to the local chain. Agg is a value based on h l-1 is the aggregate signature information σ added to the local chain two times before. Agg where r is a predetermined random number.

[0020] For example, let H1 be a given hash function, and let σ be the aggregate signature information previously added to the local chain. Agg When input to H1, the output value is h l The aggregate signature information σ Agg Not only that, but also the output value when at least one of ms and PubKeys previously added to the local chain is input. l Details of ms and PubKeys will be described later.

[0021] Similarly, for example, if H1 is a predetermined hash function, and the aggregate signature information σ Agg When input to H1, the output value is h l-1 The aggregate signature information σ added to the local chain two times before is Agg Instead, the output value when at least one of the ms and PubKeys added twice before to the local chain is input is h l-1 It may also be possible to use the following.

[0022] <Step S12> The aggregation unit 12 generates aggregated signature target information by aggregating the signature target information and the signature target information received from the other signature devices 1 and at least one signature request device 2 (step S12).

[0023] An example of the process in step S12 is the process from "4:" to "7:" in the algorithm.

[0024] In "4:" of the algorithm, the aggregation unit 12 performs the process req←sort(ms, PubKeys←ReceiveTarget). ReceiveTarget means receiving signature target information and public keys from each of the other signature devices 1 and at least one signature request device 2. ms is a set of received signature target information, and PubKeys is a set of received public keys. The signature device 1 receives a set of signature target information and public keys (m local , pk local ), but sort can sort these multiple pairs (m local , pk local ) is a predefined sort that rearranges the order of the sets (m local , pk local ) is the sorted result.

[0025] In the algorithm "5:", the aggregation unit 12 aggregates its own signature target information m local is set as hs.

[0026] In "6:" and "7:" of the algorithm, the aggregation unit 12 aggregates each request included in the request. j For f(hs, m j ) is processed as the new hs. j is a set of multiple pairs (m local , pk local ) in the j-th pair (m local , pk local ) is (m j , pk j ) is the jth pair (m local , pk local ) f(hs, m j ) is hs and m jis a given function that aggregates f(hs, m j ) is an example of hs||m j || means bit combination. f(hs, m j Other examples of ) are hs and m j is the exclusive OR of

[0027] <Step S13> The Bloom filter generation unit 13 generates a Bloom filter, which is a data structure that probabilistically indicates whether the signature target information and the signature target information received from each of the other signature devices and at least one signature request device are included (step S13).

[0028] The process of step S13 corresponds to "8:" in the algorithm of Fig. 5. In "8:" of the algorithm, bhs is a Bloom filter.

[0029] A Bloom filter is a space-efficient probabilistic data structure used to determine whether a piece of data is a member of a set (is contained in a set). Bloom filters can only be used to test for inclusion, and have the property that they can produce false positives (inclusions that are not) but do not produce false negatives (inclusions that are not).

[0030] The Bloom filter generation unit 13 may generate a Bloom filter so that the false positive incidence rate falls within an input range. In this case, the range of the false positive incidence rate is input to the Bloom filter generation unit 13. Generally, the nature of Bloom filters is that the false positive incidence rate can be reduced by increasing the data size.

[0031] The Bloom filter generation unit 13 generates a Bloom filter so that the false positive incidence rate falls within the input range, thereby making it possible to control the false positive incidence rate and the data size of the Bloom filter to appropriate values.

[0032] <Step S14> The signature information generation unit 14 generates signature information for the aggregate signature target information using the private key (step S14).

[0033] The process of step S14 corresponds to "10:" in the algorithm. In "10:", the signature information generation unit 14 executes σ←H(f(hs,pk local ))^(sk local ) is the signature information to be generated. local is your private key.

[0034] In this example, the signature information generation unit 14 generates a private key sk local Not just the public key pk local The signature information is generated using the following.

[0035] <Step S15> The second transmission unit 15 transmits the signature information and the Bloom filter to each of the other signature devices 1 and at least one signature request device 2 (step S15).

[0036] The process of step S15 corresponds to "11:" in the algorithm. In the algorithm, BroadcastSignature means transmitting to each of the other signature devices 1 and at least one signature request device 2.

[0037] In the example of "11:", the second transmission unit 15 transmits not only the signature information σ and the Bloom filter bhs but also the public key pk local and len. As described in "9:", len is the number of pairs (m local , pk local ) is the number of

[0038] In the algorithm of FIG. 5, the signature device 1 further performs the processes "12:" to "14:".

[0039] At "12:", Signing Device 1 receives signature information and a Bloom filter from each of at least one Signing Device 1.

[0040] In "12:", jsigs, jbhs, jpks, and lens are a set of signature information, a set of bloomfills, a set of public keys, and a set (m local , pklocal ) is the set of numbers.

[0041] In "13:", Signature Device 1 performs a process called aggreagte(jsigs, jbhs, jpks, lens) using jsigs, jbhs, jpks, and lens, and obtains aggregate signature information σ Agg , ms, PubKeys, tab are generated.

[0042] At "14:", the signature device 1 obtains the aggregate signature information σ Agg , ms, PubKeys, tab are added to the local chain.

[0043] The aggreagte is the processing of the function AGGREGATE defined in the algorithm from "15:" to "31:." The processing of this function AGGREGATE will be explained in the explanation of the signature request device 2.

[0044] In this way, signature unit 1 may perform the processes from "12:" to "14:" and the function AGGREGATE.

[0045] Next, we will explain an example of the processing performed by each signature request device 2. Each signature request device 2 performs the processing of the function AGGREGATE defined by "15:" to "31:" in FIG.

[0046] <Step S21> The first receiving unit 21 receives signature information and a Bloom filter from each of at least one signature unit 1 (step S21).

[0047] The process of step S21 corresponds to "15:" in the algorithm. In "15:", jsigs, jbhs, jpks, and lens are a set of signature information, a set of Bloomfills, a set of public keys, and a set (m local , pk local In this example, the first receiving unit 21 receives not only the signature information and the Bloom filter but also the public key, the set (m local , pk local ) from each of at least one signing device 1.

[0048] In "15:", the set {jsigs, jbhs, jpks, lens} is defined as data. In "16:", the aggregate signature information σ Agg The initial value of is set to g1. Furthermore, in "17:", the correspondence table tab is initialized.

[0049] Aggregate signature information σ Agg , g1, and the correspondence table tab will be described later.

[0050] <Step S22> The second receiving unit 22 receives signature target information from at least one signature device 1 and each of the other signature request devices 2 (step S22).

[0051] The process in step S22 is the process of "16:" in the algorithm.

[0052] In "16:", the second receiving unit 22 performs the process req←sort(ms, PubKeys←ReceiveTarget). ReceiveTarget means receiving signature target information and public keys from at least one signature device 1 and another signature request device 2. ms is a set of received signature target information, and PubKeys is a set of received public keys. The signature request device 2 receives a set of signature target information and public keys (m local , pk local ), but sort can sort these multiple pairs (m local , pk local ) is a predefined sort that rearranges the order of the sets (m local , pk local ) is a sorted result. In this example, the second receiving unit 22 receives not only the signature target information but also the public key.

[0053] <Step S23> The aggregate signature information generation unit 23 generates aggregate signature target information that aggregates the signature information using the received Bloom filter, determines whether the received signature information is as expected using the generated aggregate signature target information, and generates aggregate signature information that aggregates the signature information that is determined to be as expected (Step S23). An example of the processing in Step S23 is the processing from "19:" to "31:" in the algorithm.

[0054] In "19:", data k is the kth received signature information, Bloomfill, public key, pair (m local , pk local ) is a set of the number of signature information, Bloomfill, public key, and set (m local , pk local ) is defined as (σ k , bhs k , pk k , len k ) is written as

[0055] The aggregate signature information generation unit 23 generates each (σ k , bhs k , pk k , len k ) processes "20:" to "28:".

[0056] The aggregate signature information generation unit 23 checks whether the number of elements of the received req is a predetermined number (in this example, len k ), the currently processed (σ k , bhs k , pk k , len k ) and skip the next (σ k+1 , bhs k+1 ,pk k+1 ,len k+1 ) or process ReceiveTarget again.

[0057] The aggregate signature information generation unit 23 determines whether the number of elements in the received req is a predetermined number (in this example, len k) or more, processes "23:" to "28:" are performed.

[0058] In "23:", the aggregate signature information generation unit 23 calculates hs←m of req[pk k This process is performed by dividing the multiple pairs (m local , pk local ) in pk k This is a process in which the mlocal contained in the set containing the element is set to hs.

[0059] The aggregate signature information generation unit 23 performs the following in "24:": index←index of req[pk k This process is performed by dividing the multiple pairs (m local , pk local ) in pk k The index of the set containing the element is set as index. local , pk local ) in pk k An example of an index of a tuple containing elements is the index of multiple tuples (m local , pk local ) in pk k is an identifier indicating the signature device 1 or signature request device 2 that has transmitted the set containing the element.

[0060] In "19:", req j is the j-th pair (m local , pk local ) is the jth pair (m local , pk local ), (m j ,pk j ) is written as

[0061] The aggregate signature information generation unit 23 generates each (m j ,pk j ) processes "26:" to "28:".

[0062] The aggregate signature information generation unit 23 performs the bhs k to m j contains, and pk j ≠pk kIn the case of f(hs, m j ) is set as a new hs, and j is added to the index. In this way, the aggregate signature information generation unit 23 regenerates aggregate signature target information by aggregating signature target information using a Bloom filter.

[0063] The aggregate signature information generation unit 23 generates the signature information σ using the reconstructed aggregate signature subject information hs from “29:” to “31:”. k In "29:", the aggregate signature information generation unit 23 determines whether e(σ k ,g2)=e(H(f(hs, pk k )), pk k ) and determine whether e(σ k , g2)=e(H(f(hs, pk k )), pk k ), then the signature information σ k Here, let G1 and G2 be any groups, and let e:G1×G2 be any pairing function. g1 is a generator of G1, and g2 is a generator of G2.

[0064] Signature information σ k The determination of whether the signature is as expected is done to prevent attacks, signature errors, and false positives from Bloom filters.

[0065] Signature information σ k is the expected one, the aggregate signature information generation unit 23 generates σ Agg σ k (If σ is a point on an elliptic curve, it is an addition) Agg Then, the index is added to the tab.

[0066] For example, in this way, the aggregate signature information generation unit 23 generates the received signature information σ k is determined to be the expected one using the generated aggregate signature target information hs, and the signature information determined to be the expected one is aggregated to generate aggregate signature information σ Agg Generate.

[0067] In this way, by having the signature device 1 send a Bloom filter as information to clarify the subject of the signature, in other words, information to indicate which information has been signed, the amount of communication can be reduced compared to conventional methods.

[0068] Since a Bloom filter does not produce false negatives, when the signature requesting device 2, which is also the recipient, verifies a message that is not included in the Bloom filter, it is determined that the message has not been signed. Since a Bloom filter may produce false positives, there are cases where something that is determined to have been signed is not actually included in the signature target. Signatures that produce false positives can be confirmed by signature verification by the signature requesting device 2. Furthermore, the probability of false positives can be controlled by the design of the Bloom filter, and can be controlled to be sufficiently small.

[0069] This signature system can be used, for example, for time stamps. For example, it can be used to time stamp information (such as blogs and messages) posted by users, transaction records, and receipts, to determine who had the information at a specific time, in a decentralized manner without relying on TTP. On the receiving side, it can also verify the time stamp of the information presented by the other party in a decentralized manner without relying on TTP.

[0070] For example, to guarantee the time of data creation for messages written on a smartphone, photos taken, or the body of a transaction email, the signature request device locally attaches chain information to the signature subject and requests a random participant to sign. The signature request device realizes free electronic signatures by automatically signing using available resources such as smartphones.

[0071] Alternatively, a blockchain miner may be the signing device. In this case, the signing device may issue a signature using available mining resources.

[0072] This signature system can also be used in gossip protocols. Gossip protocols are a method for repeatedly and probabilistically exchanging information between system participants, and are used for spreading information and calculating statistics. They can be used to indicate which of a large amount of information a node has received and propagated. A simple way to present this information is to show the verifier all the information it has received, but if the verifier is also a propagator, it will eventually receive all the information. Therefore, it does not need to receive the information directly from the node; it can simply store the source of all the information in a Bloom filter and receive it.

[0073] [Modifications] The specific configurations of the embodiments of the disclosed technology are not limited to the configurations described above. The specific configurations of the embodiments of the disclosed technology can be appropriately modified in design, etc., within the scope of the spirit of the embodiments of the disclosed technology.

[0074] The various processes described in the embodiments of the disclosed technology may not only be performed chronologically in the order described, but may also be performed in parallel or individually depending on the processing capacity of the device performing the processes or as needed.

[0075] For example, data exchange between the components of the signature device 1 and the signature request device 2 may be performed directly or via a storage unit (not shown).

[0076] Furthermore, if the public keys of the devices have already been made public and shared, there is no need to transmit the public keys.

[0077] Furthermore, the aggregate signature information generation unit 23 does not need to perform the process from "20:" to "21:". In this case, the signature unit 1 does not need to send the lens.

[0078] [Program, Recording Medium] The processing of each unit of each of the above-mentioned devices may be realized by a computer, in which case the processing content of the functions to be possessed by each device is described by a program. Then, by loading this program into storage unit 1020 of computer 1000 shown in Figure 6 and operating arithmetic processing unit 1010, input unit 1030, output unit 1040, display unit 1060, etc., various processing functions of each of the above-mentioned devices are realized on the computer.

[0079] The program describing the processing contents can be recorded on a computer-readable recording medium, such as a non-transitory recording medium, specifically a magnetic recording device, an optical disk, or the like.

[0080] The program may be distributed, for example, by selling, transferring, lending, etc. a portable recording medium such as a DVD or CD-ROM on which the program is recorded. Furthermore, the program may be stored in a storage device of a server computer, and then transferred from the server computer to another computer via a network, thereby distributing the program.

[0081] A computer executing such a program, for example, first stores the program recorded on a portable recording medium or transferred from a server computer in its own non-transitory storage device, auxiliary storage unit 1050. Then, when executing a process, the computer loads the program stored in auxiliary storage unit 1050, its own non-transitory storage device, into storage unit 1020 and executes processing in accordance with the loaded program. Alternatively, as another form of execution of this program, the computer may load the program directly from a portable recording medium into storage unit 1020 and execute processing in accordance with the program. Furthermore, the computer may execute processing in accordance with the received program each time a program is transferred from a server computer to the computer. Alternatively, the server computer may not transfer the program to the computer, but may instead execute the processing function by issuing an execution instruction and obtaining the results, thereby executing the above-described processing through a so-called ASP (Application Service Provider) type service. Note that, in this embodiment, the program includes information used for processing by a computer that is equivalent to a program (e.g., data that is not a direct instruction to the computer but has properties that define computer processing).

[0082] In this embodiment, the device is configured by executing a predetermined program on a computer, but at least a part of the processing may be realized by hardware. For example, first transmission unit 11, aggregation unit 12, Bloom filter generation unit 13, signature information generation unit 14, second transmission unit 15, first reception unit 21, second reception unit 22, and aggregate signature information generation unit 23 may be configured by a processing circuit.

[0083] It goes without saying that other modifications are possible without departing from the spirit of the present invention.

[0084] All publications, patent applications, and technical standards mentioned in this specification are herein incorporated by reference to the same extent as if each individual publication, patent application, or technical standard was specifically and individually indicated to be incorporated by reference.

Claims

1. A signature system including at least one signing device and at least one signature request device, each of the at least one signing device including: (1) a first transmission unit that transmits signature target information to each of the other signing devices and the at least one signature request device; (2) an aggregation unit that generates aggregate signature target information that aggregates the signature target information and signature target information received from each of the other signing devices and the at least one signature request device; (3) a Bloom filter generation unit that generates a Bloom filter that is a data structure that probabilistically indicates whether the signature target information and the signature target information received from each of the other signing devices and the at least one signature request device are included; (4) a signature information generation unit that generates signature information for the aggregate signature target information by using a private key; and (5) a second transmission unit that transmits the signature information and the Bloom filter to each of the other signing devices and the at least one signature request device, A signature system, wherein each of the at least one signature request device includes: (1) a first receiving unit that receives signature information and a Bloom filter from each of the at least one signature device; (2) a second receiving unit that receives signature target information from each of the at least one signature device and other signature request devices; and (3) an aggregate signature information generation unit that generates aggregate signature target information that aggregates the signature information using the received Bloom filter, determines whether the received signature information is as expected using the generated aggregate signature target information, and generates aggregate signature information that aggregates signature information that is determined to be as expected.

2. The signature system according to claim 1, wherein the Bloom filter generation unit generates the Bloom filter so that the false positive occurrence rate falls within an input range.

3. A signature device of the signature system of claim 1.

4. A signature request device for the signature system of claim 1.

5. A signing method performed by at least one signing device and at least one signature request device, comprising: a signing step in which each of the at least one signing device performs: (1) a first transmission step of transmitting signature target information to each of the other signing devices and the at least one signature request device; (2) an aggregation step of generating aggregate signature target information by aggregating the signature target information and the signature target information received from each of the other signing devices and the at least one signature request device; (3) a Bloom filter generation step of generating a Bloom filter which is a data structure which probabilistically indicates whether the signature target information and the signature target information received from each of the other signing devices and the at least one signature request device are included; (4) a signature information generation unit which generates signature information for the aggregate signature target information by using a private key; and (5) a second transmission step of transmitting the signature information and the Bloom filter to each of the other signing devices and the at least one signature request device. a signature request step in which each of the at least one signature request device performs: (1) a first receiving step of receiving signature information and a Bloom filter from each of the at least one signature device; (2) a second receiving step of receiving signature target information from each of the at least one signature device and another signature request device; and (3) an aggregate signature information generation step of generating aggregate signature target information that aggregates the signature information using the received Bloom filter, determining whether the received signature information is as expected using the generated aggregate signature target information, and generating aggregate signature information that aggregates the signature information determined to be as expected.

6. A program for causing a computer to function as each part of the signature device of claim 3 or the signature request device of claim 4.

Citation Information

Patent Citations

  • Graph Indexing, Storage, and Retrieval with Cognitive Memory

    JP2018517956A

  • Deleting elements from a probabilistic data structure

    JP2018526737A

  • Plasma source and plasma processing apparatus

    KR1020230068308A

  • Electronic authentication system and method of supporting multi-signature

    US20230060347A1