(19)
(11)EP 2 107 711 B1

(12)EUROPEAN PATENT SPECIFICATION

(45)Mention of the grant of the patent:
24.11.2010 Bulletin 2010/47

(21)Application number: 08152220.3

(22)Date of filing:  03.03.2008
(51)Int. Cl.: 
H04L 9/32  (2006.01)
H04N 7/167  (2006.01)
G06F 21/00  (2006.01)

(54)

Method and apparatus for digital signature authentication, and computer product

Verfahren und Vorrichtung für die digitale Unterschriftenauthentifizierung, und Computerprodukt

Procédé et appareil pour authentification de signature numérique, et produit informatique


(84)Designated Contracting States:
DE FR GB

(43)Date of publication of application:
07.10.2009 Bulletin 2009/41

(73)Proprietor: Fujitsu Ltd.
Kawasaki-shi, Kanagawa 211-8588 (JP)

(72)Inventors:
  • Takenaka, Masahiko
    Kawasaki-shi, Kanagawa 211-8588 (JP)
  • Izu, Tetsuya
    Kawasaki-shi, Kanagawa 211-8588 (JP)
  • Yoshioka, Takashi
    Kawasaki-shi, Kanagawa 211-8588 (JP)

(74)Representative: Wilding, Frances Ward 
Haseltine Lake LLP Lincoln House, 5th Floor
300 High Holborn London WC1V 7JH
300 High Holborn London WC1V 7JH (GB)


(56)References cited: : 
WO-A-2005/017809
US-B1- 6 959 384
US-A1- 2001 043 616
  
  • CHUNG KEI WONG ET AL: "Digital Signatures for Flows and Multicasts" IEEE / ACM TRANSACTIONS ON NETWORKING, IEEE / ACM, NEW YORK, NY, US, vol. 7, no. 4, 1 August 1999 (1999-08-01), XP011039222 ISSN: 1063-6692
  
Note: Within nine months from the publication of the mention of the grant of the European patent, any person may give notice to the European Patent Office of opposition to the European patent granted. Notice of opposition shall be filed in a written reasoned statement. It shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention).


Description

BACKGROUND OF THE INVENTION


1. Field of the Invention



[0001] The present invention relates to a technology for digital signature authentication.

2. Description of the Related Art



[0002] It has become a common practice to install a security camera in shops, downtown areas, and apartments, or to install a drive recorder in commercial vehicles. Accordingly, moving images are increasingly used as an evidential matter. Moreover, it has also become common to keep a record of conversation between a customer and an operator to deal with troubles in telephone transactions or in a customer support operation.

[0003] Currently, when a moving image or audio data is used as an evident, a video tape, an image, or an audio file is provided as it is. However, if stored images and audio data are digitized, it becomes easy to tamper or edit such data. Therefore, third-party authentication such as a signature and a timestamp becomes necessary. A service and a product to record sound of a telephone operator are actually provided, and needs for such a technology are expected to increase.

[0004] On the other hand, protection of privacy is another problem for increasing security cameras in using a shot image, and is discussed. In addition, since Private Information Protection Law is enforced, use of private information of an individual has been strictly limited and disclosure or partial deletion of information is required if the individual requests.

[0005] To protect privacy while maintaining adequacy as an evidential matter, a signature technology is studied in which partial guaranteeing of an original content is enabled that guarantees a part of an electronic document to maintain its original content, and in which concealment of a part of the electronic document is enabled. A signature technique in which addition, alteration, concealment (sanitization), and deletion are enabled on a part of a document to which a digital signature is applied while guaranteeing that the document maintains its original content is disclosed in the third Forum of Information Technology FIT 2004, M-066, 2004, "Proposal of a Partial Integrity Assurance Technology Considering Correction and Circulation of Electronic Documents" by Takashi Yoshioka and Masahiko Takenaka, and in Japanese Patent Laid-Open Publication No. 2006-60722.

[0006] By using such a technique, signature verification of a digital-signed electronic document becomes possible even in a state where a part of the document is concealed. Furthermore, it is possible to verify that no change has been made in the document except a concealed part (also "altered part" or "added part" in the technique disclosed in "Proposal of a Partial Integrity Assurance Technology Considering Correction and Circulation of Electronic Documents") by a third party.

[0007] The signature technique disclosed in "Proposal of a Partial Integrity Assurance Technology Considering Correction and Circulation of Electronic Documents" is explained. This signature technique is a partial integrity assurance technology called PIAT, and partial integrity assurance of electronic data being a subject of signature is performed in a trilateral model of a signer, an extractor, and a verifier.

[0008] The signer is a person that digitally signs electronic data being a subject of signature, or a computer that is operated by the person. The signer guarantees a content of the electronic data by signing the data. It is necessary to sign the data under such a condition that which part is to be extracted from the subject of signature is unpredictable.

[0009] The extractor is a person that extracts (conceals or alters) a part from the electronic data being a subject of signature, or a computer that is operated by the person. The extractor extracts a part of the electronic data digitally signed by the signer and discloses the extracted part to the verifier. The extracted electronic data is referred to as extraction data. There are two kinds of extracting methods, onymous extraction and anonymous extraction. In the anonymous extraction, the extractor performs an extracting process under anonymity. In the onymous extraction, the extractor discloses information on the extractor so that who has performed the extracting process is specified.

[0010] The verifier is a person that verifies whether the extraction data is guaranteed by the signer, or a computer that is operated by the person. In the case of the anonymous extraction, it is verified whether the extraction data is a part of the electronic data signed by the signer. In the case of the onymous extraction, it is verified whether the extracting process is performed by the extractor as well as whether the extraction data is a part of the electronic data signed by the signer.

[0011] Fig. 22 is a schematic diagram showing an outline of algorithm for a signer in PIAT. The signer divides an electronic document (entire character string) 2200 into partial data (character strings of respective lines), and calculates a hash value of each partial data to create a hash value set 2201. The digital signature of the signer is given to the hash value set 2201. A combination of the hash value set 2201 and a digital signature 2202 of the signer is a PIAT signature 2203 of the signer.

[0012] Fig. 23 is a schematic diagram showing an outline of algorithm for an extractor in PIAT. The extractor extracts partial data (extraction data 2300) from the data to which the PIAT signature is given by the signer. Thereafter, the extractor performs the same operation as that performed by the signer. A combination of a hash value set 2301 thus obtained and a digital signature 2302 of the extractor is a PIAT signature 2303 of the extractor. When a deleted part is wished to be specified, a concealing process is performed, and partial data after deletion is modified to partial data, such as "XXXXXXX", that can be identified as concealment.

[0013] Fig. 24 is a schematic diagram showing an outline of algorithm for a verifier in PIAT. The verifier first verifies integrity of the hash value sets 2201 and 2301 from the PIAT signatures of the signer and the extractor. The verifier then creates a hash value set 2301 from the disclosed extraction data 2300, and verifies whether the hash value set 2301 thus created and the hash value set 2301 included in the PIAT signature 2303 of the extractor coincide with each other.

[0014] Finally, the verifier compares the hash value set 2201 of the signer and the hash value set 2301 of the extractor. It is found that a position of data at which the hash value is identical in both of the hash value sets 2201 and 2301 is a position of data extracted from the electronic document. If the hash value set 2301 of the extraction data 2300 is not included in the hash value set 2201 of the PIAT signature 2203 of the signer, it is determined that the extraction data 2300 is tampered.

[0015] In PIAT, extraction is performed basically by the onymous extraction, and therefore, it is possible to verify who has extracted which part. However, in the case of the anonymous extraction, the PIAT signature process performed by the extractor can be omitted. In this case, the verifier performs verification of the hash value set in the PIAT signature of the signer and the digital signature thereof, creation of a hash value set from the disclosed extraction data, and comparison with the hash value set in the PIAT signature of the signer.

[0016] This signature technique (PIAT) can be applied also to streaming data including a moving image file such as moving picture experts group phase 1 (MPEG-1) and an audio file.

[0017] In this case, streaming data being a subject of signature is divided into partial data. When streaming data of MPEG-1 is divided into partial data so as to be extractable, the data can be divided in an image unit or in a group of picture (GOP) unit.

[0018] However, in MPEG-1, since an interframe prediction technology is applied, P-frame and B-frame lack independency in an image unit. Therefore, extraction is considered to be limited. On the other hand, GOP is a smallest unit of a moving image in which several images are combined, and independent reproduction in this unit is possible. GOP is a structure for reproducing or editing a moving image from a middle of data. For simplicity, it is assumed that division into partial data is performed in the GOP unit.

[0019] The signer divides a moving image (for example, an MPEG-1 file) being a subject of signature in GOP units, and calculates a hash value of each GOP to create a hash value set. The signer then gives a digital signature of the signer to the created hash value set, to create a PIAT signature by combining the hash value set and the digital signature.

[0020] The extractor extracts a required partial moving image from the moving image to which the PIAT signature is given by the signer. In the case of the anonymous extraction, the extractor discloses the extracted moving image and the PIAT signature of the signer. In the case of the onymous extraction, the extractor performs the same operation as that performed by the signer, to create a PIAT signature of the extractor, and discloses the extracted moving image, the PIAT signature of the signer, and the PIAT signature of the extractor.

[0021] In the case of the onymous extraction, the verifier first verifies integrity of the hash value set from the PIAT signature of the signer and the PIAT signature of the extractor. The verifier then creates a hash value set from the disclosed extracted moving image, and verifies that the hash value set thus created coincides with the hash value set included in the PIAT signature of the extractor.

[0022] Finally, the verifier compares the hash value set of the signer and the hash value set of the extractor. It is found that a position of data at which the hash value is identical in both of the hash value sets is a position of data extracted from the moving image being the subject of signature. In the case of the anonymous extraction, the verifier performs verification of the hash value set in the PIAT signature of the signer and the digital signature thereof, creation of a hash value set from the disclosed extracted moving image, and comparison with the hash value set in the PIAT signature of the signer, to check whether it is partial information.

[0023] Next, the signature technique disclosed in Japanese Patent Laid-Open Publication No. 2006-60722 is explained. In this signature technique, an amount of data related to signature can be reduced by managing hash values, which are a part of the data related to signature, in a binary tree, and data to be a subject of signature includes not only electronic documents but also streaming data such as a moving image and audio data, similarly to PIAT described above. Herein, an example in which the subject of signature is streaming data of a moving image is explained.

[0024] Fig. 25 is a schematic diagram for explaining a signing process performed by a signer in the signature technique disclosed in Japanese Patent Laid-Open Publication No. 2006-60722 in which streaming data of a moving image is the subject of signature. In this technique, hash values h1 to h5 of partial moving images f1 to f5 obtained by dividing a moving image file F being a subject of the signature by GOP units are managed in a complete binary tree. This requires addition of dummy data D.

[0025] The signer first adds the dummy data D at the end of the moving image file F, and calculates hash values h1 to h8 for each GOP as a process of the first level. As a process of the second level, the signer then connects the end of a hash value hx and the head of hy to calculate a new hash value hx,y. The hash value hx and the hash value hy are adjacent values.

[0026] The same process is repeated in the third level and later until a single hash value is obtained. Thus, a hash-value binary tree T is created. The single hash value is referred to as root Ra. In the example shown in Fig. 25, the root Ra is obtained in the fourth level. The signer gives a digital signature Sa of the signer to the root Ra.

[0027] Disclosure information A that is stored at this time includes the original moving image file F, the dummy data D (or a root hash value string {h6, h7,8} having hash values of the partial moving images f6 to f8 of the dummy data D as leaves), and the root Ra to which the digital signature Sa is given.

[0028] Fig. 26 is a schematic diagram for explaining an extracting process performed by an extractor in the signature technique disclosed in Japanese Patent Laid-Open Publication No. 2006-60722 in which streaming data of a moving image is the subject of signature. The extractor extracts the partial moving images f3 and f4 from the moving image file F being a subject of signature, and calculates the hash values h1 to h8 of the partial moving images f1 to f8 of the moving image file F and the dummy data D as a process of the first level. The extractor then deletes all partial moving images f1, f2, and f5 to f8 except the extracted partial moving images f3 and f4.

[0029] Thereafter, the extractor connects the end of the hash value hx and the head of the hash value hy to create a new hash value hx,y, and repeats the same process in the second level and later until a single hash value is obtained. Thus, the hash-value binary tree T is created. In the example shown in Fig. 26, a root Rb is created with the hash value obtained in the fourth level. The extractor gives a digital signature Sb of the extractor to the root Rb.

[0030] Signature related data B disclosed at this time includes the extracted moving images f3 and f4, root hash values h1,2 and h5,8 that are obtained from the hash values of the deleted partial moving images f1, f2, and f5 to f8, and the root Rb to which the digital signature Sb is given.

[0031] However, in the signature technique described above, when a part of large streaming data such as a moving image file and an audio file is extracted, it is necessary to store all of hash values of moving images other than the extracted moving image. Therefore, an amount of data related to signature is enormous.

[0032] Moreover, in the signature technique disclosed in Japanese Patent Laid-Open Publication No. 2006-60722, although it is possible to reduce an amount of data related to signature by managing hash values, which are a part of the data related to signature, in a binary tree, addition of dummy data is required to manage the hash values in a complete binary tree.

[0033] Accordingly, an amount of data to be stored increases due to added dummy data D (the dummy data D or a hash value group of a hash tree T constituted only of the dummy data D).

[0034] Furthermore, since the dummy data D is added, calculation of hash values therefor is required, and as a result, a processing time also increases. In addition, falsification (curtailment) of the moving image file being the subject of signature is possible by replacing data at the end of the moving image file with the dummy data.

[0035] Moreover, random numbers that are included in the signature related data required to guarantee uniqueness of the extracted partial moving images f3 and f4 are also required to be stored as they are. Fig. 27 is a schematic diagram for showing random numbers that are added to the partial moving images f1 to f5. As shown in Fig. 27, although it is possible to unify the hash values h1 to h5 of the respective partial moving images f1 to f5 in units of GOP into a single hash value h, the same number of random numbers r1 to r5 as the number of the partial moving images f1 to f5 are required. As a result, an amount of the signature related data becomes enormous.

[0036] As described above, if PIAT is simply applied to streaming data such as a moving image file, even if a part of the data is extracted, the data can be guaranteed as a part of the moving image file being the subject of signature.

[0037] However, as described above, when the moving image file being the subject of signature is a moving image file with a long recording time or a moving image file having a high frame rate, the number of frames or GOP becomes large. As a result, an amount of data of a hash value set included in the PIAT signature increases.

[0038] Furthermore, when a content of the moving image file being the subject of signature is an animation, the same frame or GOP appears repeatedly. In PIAT, if the same image appears in partial data, a moving image corresponding to the deleted part can be restored based on a hash value set. To guarantee uniqueness of the partial data, if the same image appears in the partial data, a random number is required to be added for each of original partial data.

[0039] Fig. 28 is a schematic diagram showing a moving image file of an animation. As shown in Fig. 28, even if images E1 and E2 are deleted, when the hash values h1 to h3 of images E1 to E3 are the same, the deleted image E1 and E2 can be restored based on the hash value of the image E3 since the deleted images E1 and E2 are identical to the image E3. To prevent such restoration, it is necessary to add a random number to each of the images E1 and E4.

[0040] However, when random numbers are added, data of the number of GOP×random number length are further required to be stored. Therefore, data other than the moving images to be stored further increases. For example, when a PIAT signature is given to a moving image of one hour long having a frame rate equivalent to that of television, the signature data requires several hundred kilobytes to several megabytes. The amount of data is small compared to that of the image data, however, the amount of signature related data increases.

[0041] WO 2005/017809 discloses a method and apparatus for authentication of a data stream. The data stream is broken up into blocks. A Merkle tree is created for the data stream and the root of the tree is signed. An intermediary may remove one or more of the blocks. In this case, the intermediary creates another Merkle tree and updates the signature accordingly.

SUMMARY OF THE INVENTION



[0042] It is an object of the present invention to at least solve the problems in the conventional technologies.

[0043] A computer-readable recording medium according to one aspect of the present invention stores therein a computer program for digital signature authentication having the features of claim 1 below. The computer program causes a computer to execute dividing streaming data into plural pieces of partial data in a predetermined unit; creating a hash value string including plural hash values corresponding to the pieces of partial data; creating a first binary tree using the hash value string; and creating a digital signature of a signer using a root value of the first binary tree.

[0044] An apparatus according to another aspect of the present invention is for digital signature authentication having the features of claim 7 below. The apparatus includes a dividing unit that divides streaming data into plural pieces of partial data in a predetermined unit; a first creating unit that creates a hash value string including plural hash values corresponding to the pieces of partial data; a second creating unit that creates a first binary tree using the hash value string; and a third creating unit that creates a digital signature of a signer using a root value of the first binary tree.

[0045] A method according to still another aspect of the present invention is of digital signature authentication having the features of claim 8 below. The method includes dividing streaming data into plural pieces of partial data in a predetermined unit; creating a hash value string including plural hash values corresponding to the pieces of partial data; creating a first binary tree using the hash value string; and creating a digital signature of a signer using a root value of the first binary tree.

[0046] The other objects, features, and advantages of the present invention are specifically set forth in or will become apparent from the following detailed description of the invention when read in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS



[0047] 

Fig. 1 is a schematic diagram showing a hardware configuration of an apparatus for digital signature authentication according to an embodiment of the present invention;

Fig. 2 is a block diagram showing a functional configuration of the apparatus at the time of signature;

Fig. 3 is a block diagram showing a functional configuration of the apparatus at the time of extraction;

Fig. 4 is a block diagram showing a functional configuration of the apparatus at the time of verification;

Fig. 5 is a block diagram of a functional configuration of a binary-tree creating unit at the time of signature and extraction;

Fig. 6 is a schematic diagram of a hash-value binary tree that is created when the number of partial data n is an odd number (n=5);

Fig. 7 is a schematic diagram of a hash-value binary tree that is created when the number of partial data n is an odd number (n=7);

Fig. 8 is a schematic diagram for explaining creation of a deletion hash-value binary tree;

Fig. 9 is a schematic diagram of a random-number binary tree Tr that is created when the number of partial data n=5;

Fig. 10 is a schematic diagram of a random-number binary tree Tr that is created when the number of partial data n=7;

Fig. 11 is a schematic diagram for explaining creation of an extraction random-number binary tree;

Fig. 12 is a block diagram of a functional configuration of the binary-tree creating unit at the time of verification;

Fig. 13 is a schematic diagram showing restoration of a hash-value binary tree Th;

Fig. 14 is a schematic diagram showing restoration of the hash-value binary tree Th;

Fig. 15 is a flowchart of a signature process performed by the apparatus;

Fig. 16 is a flowchart of a random-number binary-tree creating process (step S1503) shown in Fig. 15;

Fig. 17 is a flowchart of a branch-destination random-number calculating process (step S1607) shown in Fig. 16;

Fig. 18 is a flowchart of a hash-value-string creating process (step S1504) shown in Fig. 15;

Fig. 19 is a flowchart of a hash-value string creating process (step S1505) shown in Fig. 15;

Fig. 20 is a flowchart of a data extraction process performed by the apparatus;

Fig. 21 is a flowchart of a data verification process performed by the apparatus;

Fig. 22 is a schematic diagram showing an outline of algorithm for a signer in PIAT;

Fig. 23 is a schematic diagram showing an outline of algorithm for an extractor in PIAT;

Fig. 24 is a schematic diagram showing an outline of algorithm for a verifier in PIAT;

Fig. 25 is a schematic diagram for explaining a signing process performed by a signer in a conventional signature technique in which streaming data of a moving image is a subject of signature;

Fig. 26 is a schematic diagram for explaining an extracting process performed by an extractor in the conventional signature technique;

Fig. 27 is a schematic diagram for showing random numbers that are added to partial moving images;

Fig. 28 is a schematic diagram showing a moving image file of an animation; and

Fig. 29 is a table showing effects when a PIAT signature is given to streaming data of a moving image.


DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS



[0048] Exemplary embodiments according to the present invention are explained in detail below with reference to the accompanying drawings.

[0049] Fig. 1 is a schematic diagram showing a hardware configuration of an apparatus for digital signature authentication according to an embodiment of the present invention. An apparatus for digital signature authentication 100 includes a computer main unit 110, an input unit device 120, and an output device 130. The apparatus can be connected to a network 140 such as a local area network (LAN), a wide area network (WAN), and the internet through a router or a modem not shown.

[0050] The computer main unit 110 includes a central processing unit (CPU), a memory, and an interface. The CPU controls the entire apparatus 100. The memory is structured with a read only memory (ROM), a random access memory (RAM), a hard disk (HD), an optical disk 111, and a flash memory. The memory is used as a work area of the CPU.

[0051] Various kinds of programs are store in the memory, and are loaded according to a command from the CPU. Reading and writing of data from the HD and the optical disk 111 are controlled by a disk drive. The optical disk 111 and the flash memory are detachable to the computer main unit 110. The interface controls input from the input device 120, output to the output device 130, and communication with the network 140.

[0052] The input device 120 includes a keyboard 121, a mouse 122, and a scanner 123. The keyboard 121 has keys to input characters, numerals, and various instructions. Data is input using the keyboard 121. The keyboard can be a touch panel. The mouse 122 enables to move a cursor, to select a range, to move a window, and to change the size of the window. The scanner 123 optically reads an image. The read image is captured as image data and stored in a memory of the computer main unit 110. The scanner 123 can be provided with an optical character recognition (OCR) function.

[0053] The output device 130 includes a display 131, a printer 132, and a speaker 133. The display 131 displays a cursor, an icon, and data such as a document, an image, and functional information. The printer 132 prints image data and document data. The speaker 133 outputs sound such as a sound effect and reading sound.

[0054] The apparatus 100 performs a signature process, an extraction process, and a verification process. Functional configurations are explained for the respective processes herein.

[0055] Fig. 2 is a block diagram showing a functional configuration of the apparatus 100 at the time of signature. The apparatus 100 includes a binary-tree creating unit 201 and a digital-signature processing unit 202. To the binary-tree creating unit 201, streaming data ST such as a moving image and audio data being disclosure data is input. Moreover, in a random number mode, the binary-tree creating unit 201 accepts a request to create a root random number rR. In the random number mode, a hash value is calculated using a random number.

[0056] When the streaming data ST is input, the binary-tree creating unit 201 creates a hash-value binary tree in which a tree structure is formed using hash values as nodes, and outputs a root hash value hR to be the root thereof to the digital-signature processing unit 202. Moreover, when the request to create the root random number rR is received, the binary-tree creating unit 201 creates a random-number binary tree in which a tree structure is formed using random numbers as nodes, and outputs the root random number rR to be the root thereof as disclosure information.

[0057] The digital-signature processing unit 202 creates a digital signature SA of a signer using the root hash value that is output from the binary-tree creating unit 201. Creation of the digital signature by the digital-signature processing unit 202 is performed by a conventional digital signature technique.

[0058] Fig. 3 is a block diagram showing a functional configuration of the apparatus 100 at the time of extraction. The apparatus 100 includes an extracting unit 301, the binary-tree creating unit 201, and the digital-signature processing unit 202. The extracting unit 301 receives extraction information. The extraction information indicates a range of the streaming data ST an extractor is to extract therefrom.

[0059] Upon receiving the extraction information, the extracting unit 301 extracts a data string (hereinafter, "extraction data string Lde") corresponding to the range indicated by the extraction information. The extraction data string Lde is constituted of one or more of sequential partial data (hereinafter "extraction data"), and is output as disclosure information. In the case of the anonymous extraction, this extraction data string Lde and the digital signature SA of the signer are output as the disclosure information.

[0060] The binary-tree creating unit 201, upon receiving the extraction information, outputs a root hash value string LnRD to verify the extraction data string Lde as disclosure information. In the random number mode, upon receiving the root random number rR obtained at the time of signature, the binary-tree creating unit 201 outputs a root random number string LrRE corresponding to the extraction data string Lde as the disclosure information.

[0061] In the case of the onymous extraction, the digital-signature processing unit 202 creates a digital signature SB of the extractor using the hash-value binary tree created by the binary-tree creating unit 201. In the random number mode, the digital-signature processing unit 202 creates the digital signature SB of the extractor further using a random-number binary tree. In the case of the onymous extraction, the created digital signature SB of the extractor is output as the disclosure information together with the extraction data string Lde and the digital signature SA.

[0062] Fig. 4 is a block diagram showing a functional configuration of the apparatus 100 at the time of verification. The apparatus 100 includes the binary-tree creating unit 201 and the digital-signature processing unit 202. The binary-tree creating unit 201 receives the extraction data string Lde and the root hash value string LhRD, creates a hash-value binary tree, and outputs the root hash value string LhRD of the hash-value binary tree to the digital-signature processing unit 202. In the random number mode, the binary-tree creating unit 201 receives the root random value string LrRE, to create a random-number binary tree. The binary-tree creating unit 201 then creates (restores) a hash-value binary tree using leaves being random numbers corresponding to respective extraction data of the extraction data string Lde.

[0063] In the case of the anonymous extraction, the digital-signature processing unit 202 receives the digital signature SA of the signer, and verifies validity of the digital signature SA based on the root hash value of the restored hash-value binary tree. In the case of the onymous extraction, the digital-signature processing unit 202 further receives the digital signature SB of the extractor, and verifies validity of the digital signature SB based on the root random number string LrRE and the root hash value string LhRD. Verification (confirmation) of a digital signature by the digital-signature processing unit 202 is performed by a conventional digital signature technique.

[0064] The function of the binary-tree creating unit 201 varies in each of cases of signature, extraction, and verification. Therefore, the function is explained for each case.

[0065] Fig. 5 is a block diagram of a functional configuration of the binary-tree creating unit 201 at the time of signature and extraction. The binary-tree creating unit 201 creates various kinds of binary trees such as a hash-value binary tree Th and a random-number binary tree Tr of the streaming data ST.

[0066] The binary-tree creating unit 201 includes a dividing unit 501, a hash-value calculating unit 502, a hash-value-string creating unit 503, a hash-value binary-tree creating unit 504, a deletion hash-value binary-tree creating unit 505, a random-number creating unit 506, a switch 507, a random-number binary-tree creating unit 508, and an extraction random-number binary-tree creating unit 509.

[0067] Upon receiving the streaming data ST, the dividing unit 501 divides the streaming data ST into partial data in a predetermined unit. A set of the partial data is to be a partial data string. The unit of division can be arbitrarily determined. For example, when the streaming data ST is in MPEG-1, the streaming data ST can be divided in an image unit or in a GOP unit.

[0068] When a numeric value is input, the hash-value calculating unit 502 calculates a hash value by applying the numeric value to a hash value function, and returns the hash value to a source of the numeric value. In the present embodiment, a hash function is used as an example of a one-way function. However, it is not limited to the hash function as long as the function is a one-way function.

[0069] The hash-value-string creating unit 503 creates a hash value string constituted of hash values of the respective partial data, which is a unit of division, in cooperation with the hash-value calculating unit 502. Specifically, the partial data is digitalized by a conventional digital signature technique to be provided to the hash-value calculating unit 502. By receiving a hash value that is calculated by the hash-value calculating unit 502, the hash-value-string creating unit 503 creates a hash value string. The number of hash values of the hash value string to be created is n.

[0070] When a hash value of partial data di is hi, and a hash parameter of the partial data di to be created by a conventional digital signature technique is ei, the hash value hi of the partial data di is expressed by Equation (1) below.


H() is a hash function. Furthermore, when it is assumed that a random number ri is provided for the partial data di, the hash value hi of the partial data di is expressed by Equation (2) below.


x∥y indicates connection of the end of a numeric value x and the head of a numeric value y. For example, when x=123 and y=456, x∥y=123456.

[0071] The hash-value binary-tree creating unit 504 creates the hash-value binary tree Th having the hash value string created by the hash-value-string creating unit 503 as a leaf group, in cooperation with the hash-value calculating unit 502. The number of leaves is the same as the number of hash values n.

[0072] In the hash-value binary tree Th, nodes (including leaves and roots) are hierarchically structured. Specifically, when the hash values indicating nodes at branch destinations at a low level are ha and hb, the hash value ha,b of a node at a root of the branch is expressed by Equation (3) below.



[0073] The hash-value binary-tree creating unit 504 provides the hash values ha and hb expressing the nodes at the branch destinations at a low level to the hash-value calculating unit 502. The hash-value calculating unit 502 calculates the hash value ha,b and sends the hash value ha,b to the binary-tree creating unit 201. The hash values ha and hb are hash values expressing adjacent nodes in the same level. In the present embodiment, a suffix of a hash value is positional information to identify a position of the hash value in a binary tree. When extraction or restoration is performed, this positional information is to be a clue.

[0074] In the hash-value binary-tree creating unit 504, a creating method varies depending on the number of partial data n, specifically, depending on whether the number of leaves n is an odd number or an even number. Fig. 6 is a schematic diagram of the hash-value binary tree Th that is created when the number of partial data n is an odd number (n=5).

[0075] Respective partial data d1 to d5 shown in Fig. 6 are data obtained by dividing the streaming data ST in GOP units by the dividing unit 501. Hash values h1 to h5 correspond to the partial data d1 to d5, respectively, and is created as a hash value string {h1, h2, h3, h4, h5} by the hash-value-string creating unit 503. This hash value string {h1, h2, h3, h4, h5} becomes a leaf group of the hash-value binary tree Th.

[0076] The hash-value binary-tree creating unit 504 pairs adjacent hash values from the hash value at the top. A pair cannot be made with a hash value belonging to another pair. In the example shown in Fig. 6, the hash values h1 and h2 are paired, and the hash values h3 and h4 are paired. The hash values h2 and h3 cannot be paired. Since the number of partial data n is an odd number, the hash value h5 is left alone.

[0077] When the hash values at the first level are leaves, hash values in the second level are to be a root of the branch in a higher level, and are created using Equation (3) above. A hash value h1,2 to be the root of the hash values h1 and h2 and a hash value h3,4 to be the root of the hash values h3 and h4 are created by Equation (3). A hash value h1,4 in the third level is also created similarly using the hash values h1,2 and h3,4 by Equation (3) above.

[0078] Since a hash value indicating a node of a branch destination is only the hash value h1,4, a hash value h1,5 that expresses a branch root node is created from the hash value h1,4 and the hash value h5 that is left alone at the leaf by Equation (3). A root (hash value) hR is extracted from this hash-value binary tree Th and is output to the digital-signature processing unit 202. Thus, the digital signature SA of the signer is created.

[0079] A case where the number of partial data n is an even number (n=4) corresponds to a case in which the partial data h5 is not present in the example shown in Fig. 6. Specifically, the hash value string to be the leaf group is {h1, h2, h3, h4}, and therefore, the hash value h1,4 is to be the root hash value hR. The root (hash value) hR is extracted from this hash-value binary tree Th, and is output to the digital-signature processing unit 202. Thus, the digital signature SA of the signer is created.

[0080] Fig. 7 is a schematic diagram of the hash-value binary tree Th that is created when the number of partial data n is an odd number (n=7). In the second level, the number of hash values is an odd number (three). In this case, the hash values h1,2 and h3,4 are paired, and the hash value h5,6 is also left alone besides the hash value h; in the first level. Therefore, in the third level, from the hash values h5,6 and h7 left alone, a hash value h5,7 to be a branch root node is created using Equation (3).

[0081] Finally, in the fourth level, from the hash value h1,4 and h5,7, a hash value h1,7 to be a branch root node is created by Equation (3). The hash value h1,7 is to be the root (hash value) hR. The root (hash value) hR is extracted from this hash-value binary tree Th, and is output to the digital-signature processing unit 202. Thus, the digital signature SA of the signer is created.

[0082] A case where the number of partial data n is an even number (n=6) corresponds to a case in which the partial data d7 is not present in the example shown in Fig. 7. Specifically, the hash value string to be the leaf group is {h1, h2, h3, h4, h5, h6}, the hash value h7 of a leaf is not present, and the hash value h5,7 in the third level is not created.

[0083] Therefore, by connecting the hash value h5,6 left alone in the second level with the hash value h1,4 in the third level, a hash value h1,5 to be a branch root node is created using Equation 3. This hash value h1,6 is to be the root hash value hR. The root (hash value) hR is extracted from this hash-value binary tree Th, and is output to the digital-signature processing unit 202. Thus, the digital signature SA of the signer is created.

[0084] As described, an amount of data to be created at the time of signature can be reduced to an amount of data of the digital signature SA of a signer, independent of a reproduction time of the streaming data ST since a hash value set is not used as in the conventional technique.

[0085] The deletion hash-value binary-tree creating unit 505 shown in Fig. 5 functions at the time of extraction, and creates a binary tree (hereinafter, "deletion hash-value binary tree Td") having only hash values of deletion data in the streaming data ST as leaves. The deletion data corresponds to partial data other than the extraction data in the streaming data ST.

[0086] The deletion hash-value binary-tree creating unit 505 extracts a root hash value string LhRD to be a root of the deletion hash-value binary tree Td, and outputs as disclosure information. When the number of extraction data is c, the upper limit of the maximum value of the number of the root hash value hR included in the root hash value string LhRD is 2·log2{(n/c)/2}.

[0087] Fig. 8 is a schematic diagram for explaining creation of a deletion hash-value binary tree Td. The example shown in Fig. 8 is explained using the streaming data ST shown in Fig. 5. When the deletion hash-value binary tree Td is created, leaves of the extraction data is not used and only leaves of the deletion data are used. First, in the first level, hash values h1, h2, and h5 expressing the leaves are selected.

[0088] Next, in the second level, similarly to the hash-value binary-tree creating unit 504, the deletion hash-value binary-tree creating unit 505 performs a binary tree process in cooperation with the hash-value calculating unit 502. Specifically, the hash value h1,2 to be a branch root node of the hash values h1 and h2 is created by Equation (3).

[0089] The hash value h1,2 in the second level stands alone since a hash value to be connected therewith is originally not present, and is not changed any further to a hash value in a higher level. Thus, a root hash-value binary tree Td1 having the hash values h1 and h2 as leaves and the hash value h1,2 as a root hash value HRD1 is created.

[0090] Furthermore, the hash value h5 also stands alone, and the hash value h5 is not changed any further to a hash value in a higher level. Therefore, a root hash-value binary tree Td2 constituted of only the hash value h5 is created. In other words, in the root hash value binary tree Td2, the hash value h5 is to be a root hash value hRD2. A root hash value string LhRD constituted of the root hash values h1,2 and h5 is output as disclosure information.

[0091] The random-number creating unit 506 shown in Fig. 5 is structured with a conventional random number generator, and creates a random number. The switch 507 selects a random number from an existing random number and a random number newly created by the random-number creating unit 506. The selected random number is output to the random-number binary-tree creating unit 508 and the extraction random-number binary-tree creating unit 509 as the root random number rR. The root random number rR itself is also output as disclosure information. The root random number rR is a random number that is positioned at a root in the random-number binary tree Tr described later. The root random number rR can be obtained by the random-number creating unit 506 and the switch 507.

[0092] Moreover, the random-number binary-tree creating unit 508 creates the random-number binary tree Tr in cooperation with the hash-value calculating unit 502. The random number to be used is required to have a property that another random number cannot be estimated from a subset of the random number to be used. Therefore, the random-number binary tree Tr is created using the hash function from the root random number rR to a leaf random number inversely to the reduction of an amount of data of hash values.

[0093] While the hash-value binary tree Th is not a complete binary tree, in the random number creation, a complete binary tree having random numbers exceeding required number of random numbers is created. In the present embodiment, a suffix of a random number is positional information to identify a position of the random number in a binary tree. When extraction or restoration is performed, this positional information is to be a clue.

[0094] The random-number binary-tree creating unit 508 calculates random numbers to be leaves (leaf random number) using the root random number rR output from the switch 507 as an origin to create the random-number binary tree Tr that is hierarchically structured. The number of leaf random numbers coincides with the number of partial data n.

[0095] Creation of the random-number binary tree Tr is explained herein. Suppose a random number to be a branch root of hash values expressing two nodes of branch destinations is ri,j. Two random numbers expressing the nodes at the branch destinations are expressed by Equations (4) and (5) below.

└a┘ means that fractions after the decimal point are rounded off.

(Example) └3.6┘=3



[0096] L represents a numeric string to be an origin in creating one of the branch destination random numbers ri,└(i+j)/2┘.

[a] means that fractions after the decimal point are rounded up.

(Example) ┌3. 6┐=4



[0097] R represents a numeric string to be an origin in creating the other one of the branch destination random numbers r┌(i+j)/2┐j, and L#R.

[0098] When the random-number binary tree Tr is created, the root random number rR is ri,j. When ri,j=rR, i coincides with an ascending number of partial data at the top (i=1).

[0099] On the other hand, j is calculated from the number of partial data n. Specifically, it is expressed by Equation (6) below.



[0100] When a following condition A is satisfied, one of the branch destination random number expressed in Equation (4) is to be a leaf random number rj.

<Condition A>



[0101] When └(i+j)/2┘=i in Equation (4),
one of the branch destination random numbers ri,└(i+j)/2┘ is to be a leaf random number ri.

[0102] Furthermore, when a following condition B is satisfied, the other one of the branch destination random number expressed in Equation 5 is to be the leaf random number rj.

<Condition B>



[0103] When ┌(i+j)/2┐=j in Equation (5),
the other one of the branch destination random numbers rj(i+j)/2,j is to be a leaf random number rj.

[0104] Moreover, when the branch destination random number r┌(i+j)/2┐,j is ┌(i+j)/2┐>n, the branch destination random number r┌(i+j)/2┐,j is not created.

[0105] A case where the number of partial data n=5 is explained. Fig. 9 is a schematic diagram of the random-number binary tree Tr that is created when the number of partial data n=5. Explanation is given using the streaming data ST shown in Fig. 5. As shown in Fig. 9, j is expressed as Equation (7) below, and the root random number rR=r1,8 is set in the first level.



[0106] Next, in the second level, two branch destination random numbers r1,4 and r5,8 whose branch root random number rR=r1,8 are created. In the third level, two branch destination random numbers r1,2 and r3,4 whose branch root random number is the random number r1,4 are created. As for the random number r5,8, since the random number r5,8 corresponds to ri,j=rn,n+3, only a random number r5,6 to be one of the branch destination random numbers is created.

[0107] Thereafter, in the fourth level, two branch destination random numbers r1,1=r1 and r2,2=r2 whose branch root random number is the random number r1,2 are created. Similarly for the random number r3,4, two branch destination random numbers r3,3=r3 and r4,4=r4 whose branch root random number is the random number r3,4 are created.

[0108] As for the random number r5,6, since the random number r5,6 corresponds to ri,j=rn,n+1, only a random number r5,5=r5 to be one of the branch destination random numbers ri, ((i+j)/2) is created. Thus, only with the root random number rR, all other random numbers can be created. Thereafter, by using Equation (2), the hash-value-string creating unit 503 can create the hash value hi considering the random number ri for each of the partial data di.

[0109] A case where the number of partial data n=4 corresponds to a case in which the partial data d5 is not present in the example shown in Fig. 9. Specifically, the root random number rR is the random number r1,4, and the random numbers r1,8, r5,6, and r5 are not created.

[0110] A case where the number of partial data n=7 is explained. Fig. 10 is a schematic diagram of the random-number binary tree Tr that is created when the number of partial data n=7. Explanation is given using the streaming data ST shown in Fig. 5. Only parts different from the example shown in Fig. 9 are explained.

[0111] In the third level, two branch destination random numbers r5,6 and r7,8 whose branch root random number is r5,8 are created. In the fourth level, two branch destination random numbers r5, 5=r5 and r6,6=r6 whose branch root random number is r5,6 are created. As for the random number r7,8, since one of the branch destination random numbers is expressed as in Equation (8), for the other one of the branch destination random numbers, only a random number r7,7=r7 is created as Equation (9) below.

[0112] In one of the branch destination random numbers

random number r7,7=r7 to be the other one of the branch destination random numbers



[0113] Thus, only with the root random number rR, all other random numbers can be created. Thereafter, by using Equation (2), the hash-value-string creating unit 503 can create the hash value hi considering the random number ri for each of the partial data di.

[0114] A case where the number of partial data n=6 is same as a case in which the partial data d7 is not present in the example shown in Fig. 10. Specifically, since the random numbers r7,8 is not created from the random number r5,8, the random number r7 is not created.

[0115] The extraction random-number binary-tree creating unit 509 shown in Fig. 5 functions at the time of extraction, and creates a random-number binary tree Tr (hereinafter, "extraction random-number binary tree Tre") having only random numbers corresponding to the extraction data as leaves in the random-number binary trees Tr. The extraction random-number binary-tree creating unit 509 outputs a rood random number string LrRE that is constituted of only a root random number rRE, of the extraction random-number binary tree Tre as disclosure information.

[0116] Fig. 11 is a schematic diagram for explaining creation of the extraction random-number binary tree Tre. Explanation is given using the streaming data ST shown in Fig. 5. In the example shown in Fig. 11, leaf random numbers corresponding to the extraction data d3 and d4 are the random numbers r3 and r4. Therefore, a random-number binary tree Tr whose leaves are only the random numbers r3 and r4 and the root random number rR is r3,4 is extracted from the random-number binary tree Tr. Only with this root random number rRE, the leaf random number r3 and r4 required for the extraction data d3 and d4 can be created even without a random-number binary tree Tr larger than that.

[0117] Fig. 12 is a block diagram of a functional configuration of the binary-tree creating unit 201 at the time of verification. The dividing unit 501 functions in the same manner as at the time of signature and extraction shown in Fig. 5. Specifically, when the extraction data string Lde is input, the dividing unit 501 divides the extraction data string Lde into partial data in a predetermined unit. The unit of division is the same as that in the case of signature and extraction. The hash-value calculating unit 502 calculates a hash value, when a numeric value is input, by applying the numeric value to the hash function, and returns the hash value to a source of the numeric value.

[0118] The hash-value-string creating unit 503 creates a hash value string constituted of hash values of the respective partial data, which is a unit of division, in cooperation with the hash-value calculating unit 502. Specifically, the partial data is digitalized by a conventional digital signature technique to be provided to the hash-value calculating unit 502. By receiving a hash value that is calculated by the hash-value calculating unit 502, the hash-value-string creating unit 503 creates a hash value string. A specific method of creating a hash value is same as that described in Fig. 5.

[0119] The random-number binary-tree creating unit 508 obtains the root random number string LrRE of the extraction random-number binary tree Tre by the same method as that described in Fig. 5, and creates the random-number binary tree Tr. Since a root random number structuring the root random number string LrRE is usually just one, this root random number is used as an origin to create the random-number binary tree Tr. A leaf random number string of the created random-number binary tree Tr is output to the hash-value-string creating unit 503.

[0120] The hash-value binary-tree creating unit 504 restores the hash-value binary tree Th of the streaming data ST in cooperation with the hash-value calculating unit 502. Specifically, the hash-value binary-tree creating unit 504 restores the original hash-value binary tree Th using the hash value string created by the hash-value-string creating unit 503 and the root hash value string LRD of the deletion hash-value binary tree Td being the disclosure information.

[0121] Fig. 13 is a schematic diagram showing restoration of the hash-value binary tree Th. Explanation is given using the streaming data ST shown in Fig. 5. As shown in Fig. 13, when the hash-value binary tree Th is to be restored, the hash values h3 and h4 of the respective extraction data d3 and d4 constituting the extraction data string Lde are created. From the hash values h3 and h4, the hash value h3,4 can be created.

[0122] Furthermore, the root hash values h1,2 and h5 constituting the root hash value string LhRD of the deletion hash-value binary tree Td being the disclosure information at the time of extraction are obtained. The root hash value h1,2 is a hash value obtained by combining the hash values h1 and h2 of the partial data d1 and d2 that are deleted from the streaming data ST.

[0123] Therefore, the root hash value h1,2 can be combined with the hash values h3 and h4 obtained by calculation, and the hash value h1,4 can be created. Further by combining the root hash value h5 standing alone and the hash value h1,4, the hash value h1,5 can be created. This hash value h1,5 is to be the root hash value hR. Thus, the original hash-value binary tree Th can be restored.

[0124] Fig. 14 is another schematic diagram showing restoration of the hash-value binary tree Th. Explanation is given using the streaming data ST shown in Fig. 7. As shown in Fig. 14, when the hash-value binary tree Th is to be restored, the hash values h3 and h4 of the respective extraction data constituting the extraction data string Lde are created. From the hash values h3 and h4, the hash value h3,4 can be created.

[0125] Furthermore, the root hash values h1,2, h5,6 and h7 constituting the root hash value string LhRD of the deletion hash-value binary tree Td being the disclosure information at the time of extraction are obtained. The root hash value h1,2 is a hash value obtained by combining the hash values h1 and h2 of the partial data d1 and d2 that are deleted from the streaming data ST. Therefore, the root hash value h1,2 can be combined with the hash values h3 and h4 obtained by calculation, and the hash value h1,4 can be created.

[0126] Moreover, the root hash value h5,6 is a hash value obtained by combining the hash values h5 and h6 of the partial data d5 and d6 that are deleted from the streaming data ST. Therefore, by combining the root hash value h5,6 with the hash value h7 standing alone, the hash value h5,7 can be created.

[0127] Thereafter, by combining the hash value h1,4 and the hash value h5,7 at the same level, the hash value h1,7 can be created. This hash value h1,7 is to be the root hash value hR. Thus, the original hash-value binary tree Th can be restored.

[0128] Fig. 15 is a flowchart of a signature process performed by the apparatus 100. First, the dividing unit 501 reads the streaming data ST and divides the streaming data ST by a predetermined unit of division (for example, GOP) (step S1501) .

[0129] The apparatus 100 then determines whether it is in the random number mode (step S1502). When it is in the random number mode (step S1502: YES), the random-number binary-tree creating process is performed by the random-number binary-tree creating unit 508 (step S1503). On the other hand, when it is not in the random number mode (step S1502: NO), the process proceeds to step S1504.

[0130] Subsequently, a hash-value-string creating process is performed by the hash-value-string creating unit 503 (step S1504). The hash-value binary-tree creating unit 504 then creates the hash-value binary tree Th (step S1505).

[0131] Thereafter, the digital-signature processing unit 202 creates the digital signature SA of a signer using the root hash value hR of the hash-value binary tree Th (step S1506). Subsequently, the disclosure information such as the digital signature SA of the signer and the root random number rR created as necessary is stored (step S1507).

[0132] Fig. 16 is a flowchart of the random-number binary-tree creating process (step S1503) shown in Fig. 15. As shown in Fig. 16, when an index i=1, and the number of partial data is n (step S1601), from the number of partial data n, a value of an index j is set (step S1602). The value of j is set based on Equations (5) to (8) described above.

[0133] The random-number creating unit 506 creates a random number ri,j to be set to the root random number rR (step S1603). Thereafter, this root random number rR is added to a random number set Sr (step S1604).

[0134] Subsequently, it is determined whether the random number set Sr is an empty set (Sr=Φ) (step S1605). When Sr±Φ (step S1605: NO), an arbitrary random number ri,j is extracted from the random number set Sr and deleted from the random number set Sr (step S1606). A branch-destination random-number calculating process is then performed (step S1607), and the process returns to step S1605. On the other hand, when Sr=Φ (step S1605: YES), the process proceeds to the hash-value-string creating process (step S1504).

[0135] Fig. 17 is a flowchart of the branch-destination random-number calculating process (step S1607) shown in Fig. 16. A random number (see Equation (10) below) corresponding to the random number ri,j is calculated as expressed in Equation (4) above (step S1701).



[0136] It is then determined whether Equation (11) below is satisfied (step S1702).



[0137] When Equation (11) is satisfied (step S1702: YES), the random number of Equation (10) is set to a leaf random number ri (step S1703), and the process proceeds to step S1706.

[0138] On the other hand, when Equation (11) is not satisfied (step S1702: NO), the random number of Equation (10) is set to a first branch destination random number of the random number ri,j (step S1704). This first branch destination random number is added to the random number set Sr (step S1705), and the process proceeds to step S1706.

[0139] It is determined whether i=n (step S1706). When it is i=n (step S1706: YES), as shown in Equation (5) above, a random number (see Equation (12) below) corresponding to the random number ri,j is calculated (step S1707). On the other hand, when it is not i=n (step S1706: NO), it is determined whether i=n+3 (step S1708).



[0140] When it is i=n+3 (step S1708: YES), the process proceeds to step S1605. For example, when the random number ri,j is the random number r5,8 shown in Fig. 9, the random number r7,8 is not to be created as in this process. On the other hand, when it is not i=n+3 (step S1708: NO), it is determined whether j=i+1 (step S1709).

[0141] When it is j=i+1 (step S1709: YES), the process proceeds to step S1605. For example, when the random number ri,j is the random number r5,6 shown in Fig. 9, the random number r6,6 is not to be created as in this process. On the other hand, when it is not j=i+1 (step S1709: NO), the process proceeds to step S1707.

[0142] Following step S1707, it is determined whether Equation (13) below is satisfied (step S1710).



[0143] When Equation (13) is satisfied (step S1710: YES), the random number expressed in Equation (12) is set to the leaf random number rj (step S1711).

[0144] On the other hand, when Equation (13) is not satisfied (step S1710: NO), the random number expressed in Equation (12) is set to a second branch destination random number of the random number ri,j (step S1712). This second branch destination random number is added to the random number set Sr (step S1713), and the process proceeds to step S1605.

[0145] Fig. 18 is a flowchart of the hash-value-string creating process (step S1504) shown in Fig. 15. When the index i=1 and the number of partial data is n (step S1801), whether it is in the random number mode is determined (step S1802). When it is not in the random number mode (step S1802: NO), a hash parameter ei of the partial data di is calculated from Equation (1) (step S1803). On the other hand, when it is in the random number mode (step S1802: YES), the hash parameter ei is calculated from the partial data di and the random number ri by Equation (2) (step S1804).

[0146] By applying the hash parameter ei to the hash function H(), the hash value hi is calculated (step S1805). The hash value hi is added to the hash value string Lh1 (step S1806).

[0147] Thereafter, it is determined whether i>n (step S1807). When it is not i>n (step S1807: NO), i is incremented by 1 (step S1808), and the process returns to step S1802. On the other hand, when i>n (step S1807: YES), the process proceeds to step S1505.

[0148] Fig. 19 is a flowchart of the hash-value binary-tree creating process (step S1505) shown in Fig. 15. The number of levels indicating the hierarchy of the hash-value binary tree Th to be created is m=1, and the total number of hash values included in the hash value string Lhm is N (step S1901). The hash value string Lhm of the number of levels m=1 is a hash value string that is created by the hash-value-string creating process.

[0149] Subsequently, the hash value string Lhm is read (step S1902), and it is determined whether N=1 (step S1903). When it is not N=1 (step S1903: NO), two hash values are extracted from the top of the hash value string Lhm and deleted from the hash value string Lhm (step S1904).

[0150] As shown in Equation (3), the extracted two hash values are combined and applied to the hash function H() as a hash parameter. Thus, a new hash value is calculated (step S1905). The calculated hash value is added to the hash value string Lhm+1 in the next level (step S1906).

[0151] Subsequently, it is determined whether the remaining number Nh of hash values in the hash value string Lhm is Nh≥2 (step S1907). When it is Nh≥2 (step S1907: YES), the process returns to step S1904. On the other hand, when it is not Nh≥2 (step S1907: NO), it is then determined whether Nh=1 (step S1908).

[0152] When it is Nh=1 (step S1908: YES), a remaining hash value in the hash value string Lhm is stored in a memory as an isolated hash value hk (step S1909), and the process proceeds to step S1910.

[0153] On the other hand, when it is not Nh=1 (step S1908: NO), the number of levels m is incremented by 1, and the total number of hash values N of the hash value string Lhm in the next level is reduced to half (N/2) (step S1910). Then, the process returns to step S1902.

[0154] When it is N=1 (step S1903: YES), it is determined whether the isolated hash value hk is present (step S1911). When the isolated hash value hk is present (step S1911 : YES), the root hash value hR is calculated as shown in Figs. 6 and 7 using the single hash value in the hash value string Lhm and the isolated hash value (step S1912). On the other hand, when the isolated hash value hk is not present (step S1911: NO), since the hash-value binary tree Th is already completed, the process proceeds to step S1913.

[0155] Thus, the hash-value binary tree Th is created. Thereafter, the hash-value binary tree Th is stored in a memory (step S1913), and the root hash value hR is output to the digital-signature processing unit 202 (step S1914), and the process proceeds to step S1506.

[0156] Fig. 20 is a flowchart of a data extraction process performed by the apparatus 100. First, the extracting unit 301 waits for the extraction information indicating an extraction range of the streaming data ST (step S2001: NO).

[0157] When the extraction information is input (step S2001: YES), extraction data corresponding to the extraction information is extracted and other partial data is deleted (step S2002). The deletion hash-value binary-tree creating unit 505 creates the deletion hash-value binary tree Td (step S2003), and extracts the root hash value string LhRD therefrom (step S2004).

[0158] Subsequently, whether it is in the random number mode is determined (step S2005). When it is in the random number mode (step S2005: YES), the extraction random-number binary-tree creating unit 509 creates the extraction random-number binary tree Tre (step S2006), and the root random number string LrRE is extracted (step S2007). Thereafter, the process proceeds to step S2008. On the other hand, when it is not in the random number mode (step S2005: NO), the process proceeds to step S2008.

[0159] The digital-signature processing unit 202 creates the digital signature SB of an extractor (step S2008). In the normal mode, the digital signature SB of the extractor is created using the root hash value string LhRD.

[0160] On the other hand, in the random number mode, the digital signature SB of the extractor is created using the root hash value string LhRD and the root random number string LrRE. In either way, the digital signature SB can be created by a conventional signature technique. Thereafter, the disclosure information such as the extraction data string Lde, the digital signature SB of the extractor, the root hash value string LhRD, the root random number string LrRE, and the digital signature SA of the signer is stored (step S2009).

[0161] Fig. 21 is a flowchart of the data verification process performed by the apparatus 100. First, the disclosure information at the time of extraction is obtained (step S2101), and the dividing unit 501 divides the extraction data string Lde by a unit of division same as that at the time of signature (step S2102). The hash-value-string creating unit 503 creates a hash value string of each extraction data (step S2103).

[0162] The hash-value binary-tree creating unit 504 restores the hash-value binary tree Th using the root hash value string LhRD of the deletion hash-value binary tree Td and the hash value of the extraction data (step S2104). The root hash value hR of the restored hash-value binary tree Th is extracted (step S2105), and a verification process to verify validity of the digital signatures SA and SB of the signer and the extractor is performed using the extracted root hash value hR (step S2106).

[0163] As described above, according to the present embodiment, it is possible to reduce an amount of data at the time of signature and extraction by a large amount. Moreover, at the time of verification, it is possible to confirm that a part of the original streaming data ST is extracted, by the signature verification by calculating the root hash value hR of the original from the disclosed streaming data ST and the root hash value string LhRD of the deleted part. Furthermore, in the case of the onymous extraction, it is also possible to check who has performed the deletion by verifying the root hash value string LhRD and the signature thereof.

[0164] As described, according to the embodiment of the present invention, an amount of data can be reduced by a large amount while maintaining an original guaranteeing function of the streaming data (extraction data string Lde) that is extracted by PIAT.

[0165] Moreover, in the present embodiment, not a complete binary tree but a general binary tree is used. Therefore, the dummy data D is not required to be added as in the conventional technique, and falsification of the original information to the dummy data D is not possible. Furthermore, it is not necessary to store the dummy data or to calculate the hash value of the dummy data. Therefore, an amount of calculation can also be reduced.

[0166] Moreover, in the present embodiment, as long as only the root random number rR is stored, the random-number binary tree Tr can be restored. Therefore, it is not necessary to store all random numbers constituting the random-number binary tree Tr. As a result, an amount of data can be reduced.

[0167] Furthermore, in the verification process, the extraction data string Lde can be restored by using algorithm of the random-number binary tree structure from the disclosed root random number string LrRE. By calculating the root hash value rR of the original from this extraction data string Lde and the root hash value string LhRD, and by performing the signature verification, it is possible to confirm that a part of the original streaming data ST is extracted. Moreover, in the case of the onymous extraction, by checking the root hash value string LhRD and the digital signature SA of the signer, it is also possible to identify who has performed the deletion.

[0168] As described, according to the present embodiment, even when the PIAT signature is performed on the streaming data ST such as a long moving image or audio data, an amount of required signature data can be reduced by a log order of a data length, and highly useful digital signature can be achieved. Fig. 29 is a table showing effects in reducing an amount of data when a PIAT signature is given to streaming data of a moving image. In Fig. 29, calculation amount H represents the number of calculation of hash values, and R represents the number of creation of random numbers.

[0169] As described above, according to the present embodiment, it is possible to guarantee that streaming data being a subject of signature such as a moving image and audio data maintains its original content, to extract data from the subject of signature while protecting privacy, and to reduce an amount of signature-related data by a large amount.

[0170] The method of digital signature authentication explained in the present embodiment can be implemented using a computer, such as a personal computer and a work station, to execute a program that is prepared in advance. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a compact disk read-only memory (CD-ROM), a magneto optical (MO) disk, and a digital versatile disk (DVD), and is executed by being read from the recording medium. This program can be a medium that can be distributed through a network such as the Internet.

[0171] Moreover, the apparatus 100 explained in the present embodiment can also be implemented by an application-specific integrated circuit (ASIC) such as a standard cell and a structured ASIC, or a programmable logic device (PLD) such as a field programmable gate array (FPGA). For example, by defining a functional configuration of the apparatus 100 by description of a hardware description language (HDL), and by performing logical synthesis on the HDL description to be provided to ASIC or PLD, the apparatus 100 can be manufactured.


Claims

1. A computer-readable recording medium that stores therein a computer program for digital signature authentication, the computer program causing a computer to execute:

dividing streaming data (ST) into a plurality of pieces of partial data (di) in a predetermined unit;

creating a hash value string (LhRD) including a plurality of hash values (hi) corresponding to the pieces of partial data (di);

creating a first binary tree (Th) using the hash value string (LhRD);

creating a digital signature (SA) of a signer using a root value (hR) of the first binary tree (Th), wherein the signer guarantees a content of the streaming data (ST) by signing the data (ST);

extracting partial data (di) from the streaming data (ST);

deleting remaining partial data from the streaming data (ST);

creating a second binary tree (Td) using hash values corresponding to the remaining partial data; and

outputting the partial data extracted (di) and a root value (hRD) of the second binary tree (Td); characterized by:

obtaining, as a root random number (rR), a random number; and

creating a third binary tree (Tr) using the root random number (rR) as a root of the third binary tree (Tr) such that number of leaves of the third binary tree (Th) is identical to number of the pieces of partial data (n);

wherein creating the first binary tree (Th) includes creating the first binary tree (Th) based on the leaves and the hash value string (LhRD).


 
2. The computer-readable recording medium according to claim 1, wherein the computer program further causes the computer to execute
creating a digital signature (SB) of an extractor using the root value (rR) of the second binary tree (Tr), wherein the extractor extracts a part of the streaming data (ST) signed by the signer.
 
3. The computer-readable recording medium according to claim 1, wherein the computer program further causes the computer to execute
restoring the first binary tree (Th) using a hash value (hi) corresponding to the partial data (di) extracted, and the root value (hRD) of the second binary tree (Td).
 
4. The computer-readable recording medium according to claim 1, wherein the third binary tree (Tr) is created by obtaining two random numbers expressing the nodes at branch destinations of a branch root ri,j using:


wherein L represents a numeric string to be an origin in creating one of the branch destination random numbers ri,└(i+j)/2┘; and


wherein R represents a numeric string to be an origin in creating the other one of the branch destination random numbers r┌(i+j)/2┐,j, and L≠R; and
wherein, when the root random number (rR) is ri,j, i=1 and j is calculated from:


wherein n is the number of the pieces of partial data.
 
5. The computer-readable recording medium according to claim 4, wherein the leaves includes a plurality of pairs of leaves, each pair of which is branched from a common branch-root random number, the branch-root random number being a root of a subtree of the third binary tree (Tr), and a leaf left alone.
 
6. The computer-readable recording medium according to claim 1, wherein the computer program further causes the computer to execute:

extracting, from the third binary tree (Tr), a fourth binary tree (Tre) having a leaf corresponding to the partial data (di) extracted; and

outputting the fourth binary tree (Tre) and the partial data extracted (di).


 
7. An apparatus (100) for digital signature authentication, comprising:

a dividing unit(501) that divides streaming data (ST) into a plurality of pieces of partial data (di) in a predetermined unit;

a first creating unit (503) that creates a hash value string (LhRD) including a plurality of hash values (hi) corresponding to the pieces of partial data (di);

a second creating unit (504) that creates a first binary tree (Th) using the hash value string (LhRD);

a third creating unit (202) that creates a digital signature (SA) of a signer using a root value (hR) of the first binary tree (Th), wherein the signer guarantees a content of the streaming data (ST) by signing the data (ST);

an extracting unit (301) that extracts partial data (di) from the streaming data (ST);

a deleting unit that deletes remaining partial data from the streaming data;

a fourth creating unit (505) that creates a second binary tree (Td) using hash values corresponding to the remaining partial data; and

an outputting unit that outputs the partial data extracted (di) and a root value (hRD) of the second binary tree (Td); characterized by:

an obtaining unit (506) that obtains, as a root random number (rR), a random number; and

a fifth creating unit (508) that creates a third binary tree (Tr) using the root random number (rR) as a root of the third binary tree (Tr) such that number of leaves of the third binary tree (Tr) is identical to number of the pieces of partial data (n), wherein

the second creating unit (504) creates the first binary tree (Th) based on the leaves and the hash value string (LhRD).


 
8. A method of digital signature authentication, comprising:

dividing streaming data (ST) into a plurality of pieces of partial data (di) in a predetermined unit;

creating a hash value string (LhRD) including a plurality of hash values (hi) corresponding to the pieces of partial data (di);

creating a first binary tree (Th) using the hash value string (LhHD) ;

creating a digital signature (SA) of a signer using a root value (hR) of the first binary tree (Th), wherein the signer guarantees a content of the streaming data (ST) by signing the data (ST);

extracting partial data (di) from the streaming data (ST);

deleting remaining partial data from the streaming data (ST);

creating a second binary tree (Td) using hash values corresponding to the remaining partial data; and

outputting the partial data extracted (di) and a root value (hRD) of the second binary tree (Td); characterized by:

obtaining, as a root random number (rR), a random number; and

creating a third binary tree (Tr) using the root random number (rR) as a root of the third binary tree (Tr) such that number of leaves of the third binary tree (Tr) is identical to number of the pieces of partial data (n), wherein

the creating the first binary tree (Th) includes creating the first binary tree (Th) based on the leaves and the hash value string (LhRD).


 


Ansprüche

1. Computezlesbares Aufzeichnungsmedium, das ein Computerprogramm, zur Authentifizierung mit einer digitalen Signatur, speichert, durch welches Computerprogramm ein Computer ausführt:

Teilen von Streaming-Daten (ST) in eine Vielzahl von Elementen von Partialdaten (di) in einer vorbestimmten Einheit;

Erstellen einer Hash-Wert-Kette (LhRD), die eine Vielzahl von Hash-Werten (hi) enthält, die den Elementen von Partialdaten (di) entsprechen;

Erstellen eines ersten Binärbaums (Th) unter Verwendung der Hash-Wert-Kette (LhRD);

Erstellen einer digitalen Signatur (SA) eines Signators unter Verwendung eines Wurzelwertes (hR) des ersten Binärbaums (Th), wobei der Signator einen Inhalt der Streaming-Daten (ST) durch das Signieren der Daten (ST) garantiert;

Extrahieren von Partialdaten (di) von den Streaming-Daten (ST);

Löschen von verbleibenden Partialdaten von den Streaming-Daten (ST);

Erstellen eines zweiten Binärbaums (Td) unter Verwendung von Hash-Werten, die den verbleibenden Partialdaten entsprechen; und

Ausgeben der extrahierten Partialdaten (di) und eines Wurzelwertes (hRD) des zweiten Binärbaums (Td); gekennzeichnet durch:

Erlangen, als Wurzelzufallszahl (rR), einer Zufallszahl; und

Erstellen eines dritten Binärbaums (Tr) unter Verwendung der Wurzelzufallszahl (rR) als Wurzel des dritten Binärbaums (Tr), derart, dass eine Anzahl von Blättern des dritten Binärbaums (Th) mit der Anzahl der Elemente von Partialdaten (n) identisch ist;

bei dem das Erstellen des ersten Binärbaums (Th) das Erstellen des ersten Binärbaums (Th) auf der Basis der Blätter und der Hash-Wert-Kette (LhRD) enthält.


 
2. Computerlesbares Aufzeichnungsmedium nach Anspruch 1, bei dem durch das Computerprogramm der Computer ferner ausführt:

Erstellen einer digitalen Signatur (SB) eines Extraktors unter Verwendung des Wurzelwertes (rR) des zweiten Binärbaums (Tr), wobei der Extraktor einen Teil der durch den Signator signierten Streaming-Daten (ST) extrahiert.


 
3. Computerlesbares Aufzeichnungsmedium nach Anspruch 1, bei dem durch das Computerprogramm der Computer ferner ausführt:

Wiederherstellen des ersten Binärbaums (Th) unter Verwendung eines Hash-Wertes (hi), der den extrahierten Partialdaten (di) entspricht, und des Wurzelwertes (hRD) des zweiten Binärbaums (Td).


 
4. Computerlesbares Aufzeichnungsmedium nach Anspruch 1, bei dem der dritte Binärbaum (Tr) erstellt wird durch das Erlangen zweier Zufallszahlen, welche die Knoten an Zweigzielen einer Zweigwurzel ri,j ausdrücken, unter Verwendung von:


wobei L eine numerische Kette darstellt, die ein Ursprung beim Erstellen einer der Zweigzielzufallszahlen ri,└(i+1)/2┘ sein soll; und


wobei R eine numerische Kette darstellt, die ein Ursprung beim Erstellen der anderen der Zweigzielzufallszahlen r┌(i+1)/2┐,j sein soll und bei dem L≠R ist; und
bei dem dann, wenn die Wurzelzufallszahl (rR) ri,j ist, i=1 ist und j berechnet wird von:


wobei n die Anzahl der Elemente von Partialdaten ist.
 
5. Computerlesbares Aufzeichnungsmedium nach Anspruch 4, bei dem die Blätter eine Vielzahl von Paaren von Blättern enthalten, von denen jedes Paar von einer gemeinsamen Zweigwurzelzufallszahl abzweigt, welche Zweigwurzelzufallszahl eine Wurzel eines Unterbaus des dritten Binärbaums (Tr) ist, und ein Blatt, das allein bleibt.
 
6. Computerlesbares Aufzeichnungsmedium nach Anspruch 1, bei dem durch das Camputerprogramm der Computer ferner ausführt:

Extrahieren, von dem dritten Binärbaum (Tr), eines vierten Binärbaums (Tre), der ein Blatt hat, das den extrahierten Partialdaten (di) entspricht; und

Ausgeben des vierten Binärbaums (Tre) und der extrahierten Partialdaten (di).


 
7. Vorrichtung (100) zur Authentifizierung mit einer digitalen Signatur, umfassend:

eine Teilungseinheit (501), die Streaming-Daten (ST) in eine vielzahl von Elementen von Partialdaten (di) in einer vorbestimmten Einheit teilt;

eine erste Erstellungseinheit (503), die eine Hash-Wert-Kette (ThRD) erstellt, die eine Vielzahl von Hash-Werten (hi) enthält, die den Elementen von Partialdaten (di) entsprechen;

eine zweite Erstellungseinheit (504), die einen ersten Binärbaum (Th) unter Verwendung der Hash-Wert-Kette (LhRD) erstellt;

eine dritte Erstellungseinheit (202), die eine digitale Signatur (SA) eines Signators unter Verwendung eines Wurzelwertes (hR) des ersten Binärbaums (Th) erstellt, wobei der Signator einen Inhalt der Streaming-Daten (ST) durch das Signieren der Daten (ST) garantiert;

eine Extraktionseinheit (301), die Partialdaten (di) von den Streaming-Daten (ST) extrahiert;

eine Löscheinheit, die verbleibende Partialdaten von den Streaming-Daten löscht;

eine vierte Erstellungseinheit (505), die einen zweiten Binärbaum (Td) unter Verwendung von Hash-Werten erstellt, die den verbleibenden Partialdaten entsprechen; und

eine Ausgabeeinheit, welche die extrahierten Partialdaten (di) und einen Wurzelwert (hRD) des zweiten Binärbaums (Td) ausgibt; gekennzeichnet durch:

eine Erlangungseinheit (506), die eine Zufallszahl als Wurzelzufallszahl (rR) erlangt; und

eine fünfte Erstellungseinheit (508), die einen dritten Binärbaum (Tr) unter Verwendung der Wurzelzufallszahl (rR) als Wurzel des dritten Binärbaums (Tr) erstellt, derart, dass eine Anzahl von Blättern des dritten Binärbaums (Tr) mit der Anzahl der Elemente von Partialdaten (n) identisch ist, bei der

die zweite Erstellungseinheit (504) den ersten Binärbaum (Th) auf der Basis der Blätter und der Hash-Wert-Kette (LhRD) erstellt.


 
8. Verfahren zur Authentifizierung einer digitalen Signatur, umfassend:

Teilen von Streaming-Daten (ST) in eine Vielzahl von Elementen von Partialdaten (di) in einer vorbestimmten Einheit;

Erstellen einer Hash-Wert-Kette (LhRD), die eine Vielzahl von Hash-Werten (hi) enthält, die den Elementen von Partialdaten (di) entsprechen;

Erstellen eines ersten Binärbaums (Th) unter Verwendung der Hash-Wert-Kette (LhRD);

Erstellen einer digitalen Signatur (SA) eines Signators unter Verwendung eines Wurzelwertes (hR) des ersten Binärbaums (Th), wobei der Signator einen Inhalt der Streaming-Daten (ST) durch das Signieren der Daten (ST) garantiert;

Extrahieren von Partialdaten (di) von den Streaming-Daten (ST);

Löschen von verbleibenden Partialdaten von den Streaming-Daten (ST);

Erstellen eines zweiten Binärbaums (Td) unter Verwendung von Hash-Werten, die den verbleibenden Partialdaten entsprechen; und

Ausgeben der extrahierten Partialdaten (di) und eines Wurzelwertes (hRD) des zweiten Binärbaums (Td); gekennzeichnet durch:

Erlangen, als Wurzelzufallszahl (rR), einer Zufallszahl; und

Erstellen eines dritten Binärbaums (Tr) unter Verwendung der Wurzelzufallszahl (rR) als Wurzel des dritten Binärbaums (Tr), derart, dass eine Anzahl von Blättern des dritten Binärbaums (Tr) mit der Anzahl der Elemente von Partialdaten (n) identisch ist, bei dem

das Erstellen des ersten Binärbaums (Th) das Erstellen des ersten Binärbaums (Th) auf der Basis der Blätter und der Hash-Wert-Kette (LhRD) enthält.


 


Revendications

1. Support d'enregistrement lisible par ordinateur qui stocke à l'intérieur un programme informatique pour l'authentification de signature numérique, le programme informatique amenant un ordinateur à exécuter :

la division de données de transmission en continu (ST) en une pluralité d'éléments de données partielles (di) dans une unité prédéterminée ;

la création d'une chaîne de valeurs de hachage (LhRD) incluant une pluralité de valeurs de hachage (hi) correspondant aux éléments de données partielles (di) ;

la création d'un premier arbre binaire (Th) en utilisant la chaîne de valeurs de hachage (LhRD) ;

la création d'une signature numérique (SA) d'un signataire en utilisant une valeur racine (hR) du premier arbre binaire (Th), où le signataire garantit un contenu des données de transmission en continu (ST) en signant les données (ST) ;

l'extraction de données partielles (di) des données de transmission en continu (ST) ;

la suppression de données partielles restantes des données de transmission en continu (ST) ;

la création d'un deuxième arbre binaire (Td) en utilisant des valeurs de hachage correspondant aux données partielles restantes ; et

la sortie des données partielles extraites (di) et d'une valeur racine (hRD) du deuxième arbre binaire (Td) ; caractérisé par :

l'obtention, comme un nombre aléatoire racine (rR), d'un nombre aléatoire ; et

la création d'un troisième arbre binaire (Tr) en utilisant le nombre aléatoire racine (rR) comme une racine du troisième arbre binaire (Tr) de sorte que le nombre de feuilles du troisième arbre binaire (Tr) soit identique au nombre des éléments de données partielles (n) ;

où la création du premier arbre binaire (Th) inclut la création du premier arbre binaire (Th) sur la base des feuilles et de la chaîne de valeurs de hachage (LhRD).


 
2. Support d'enregistrement lisible par ordinateur selon la revendication 1, dans lequel le programme informatique amène en outre l'ordinateur à exécuter
la création d'une signature numérique (SB) d'un extracteur en utilisant la valeur racine (rR) du deuxième arbre binaire (Tr), où l'extracteur extrait une partie des données de transmission en continu (ST) signées par le signataire.
 
3. Support d'enregistrement lisible par ordinateur selon la revendication 1, dans lequel le programme informatique amène en outre l'ordinateur à exécuter
la restauration du premier arbre binaire (Th) en utilisant une valeur de hachage (hi) correspondant aux données partielles (di) extraites, et la valeur racine (hRD) du deuxième arbre binaire (Td).
 
4. Support d'enregistrement lisible par ordinateur selon la revendication 1, dans lequel le troisième arbre binaire (Tr) est créé en obtenant deux nombres aléatoires exprimant les noeuds au niveau de destinations de branche d'une racine de branche ri,j en utilisant :


où L représente une chaîne numérique devant être une origine dans la création d'un des nombres aléatoires de destination de branche r1,└(i+j)/2┘; et


où R représente une chaîne numérique devant être une origine dans la création de l'autre des nombres aléatoires de destination de branche r┌(i+j)/2┐,j, et L≠R ; et
où, lorsque le nombre aléatoire racine (rR) est ri,j i=1 et j est calculé à partir de :


où n est le nombre des éléments de données partielles.
 
5. Support d'enregistrement lisible par ordinateur selon la revendication 4, dans lequel les feuilles incluent une pluralité de paires de feuilles, dont chaque paire fait l'objet d'un branchement depuis un nombre aléatoire de racine de branche commun, le nombre aléatoire de racine de branche étant une racine d'un sous-arbre du troisième arbre binaire (Tr), et une feuille laissée seule.
 
6. Support d'enregistrement lisible par ordinateur selon la revendication 1, dans lequel le programme informatique amène en outre l'ordinateur à exécuter :

l'extraction, du troisième arbre binaire (Tr), d'un quatrième arbre binaire (Tre) ayant une feuille correspondant aux données partielles (di) extraites ; et

la sortie du quatrième arbre binaire (Tre) et des données partielles extraites (di).


 
7. Appareil (100) pour l'authentification de signature numérique, comprenant :

une unité de division (501) qui divise des données de transmission en continu (ST) en une pluralité d'éléments de données partielles (di) dans une unité prédéterminée ;

une première unité de création (503) qui crée une chaîne de valeurs de hachage (LhRD) incluant une pluralité de valeurs de hachage (hi) correspondant aux éléments de données partielles (di) ;

une deuxième unité de création (504) qui crée un premier arbre binaire (Th) en utilisant la chaîne de valeurs de hachage (LhRD) ;

une troisième unité de création (202) qui crée une signature numérique (SA) d'un signataire en utilisant une valeur racine (hR) du premier arbre binaire (Th), où le signataire garantit un contenu des données de transmission en continu (ST) en signant les données (ST) ;

une unité d'extraction (301) qui extrait des données partielles (di) des données de transmission en continu (ST) ;

une unité de suppression qui supprime des données partielles restantes des données de transmission en continu ;

une quatrième unité de création (505) qui crée un deuxième arbre binaire (Td) en utilisant des valeurs de hachage correspondant aux données partielles restantes ; et

une unité de sortie qui sort les données partielles extraites (di) et une valeur racine (hRD) du deuxième arbre binaire (Td) ; caractérisé par :

une unité d'obtention (506) qui obtient, comme un nombre aléatoire racine (rR), un nombre aléatoire ; et

une cinquième unité de création (508) qui crée un troisième arbre binaire (Tr) en utilisant le nombre aléatoire racine (rR) comme une racine du troisième arbre binaire (Tr) de sorte que le nombre de feuilles du troisième arbre binaire (Tr) soit identique au nombre des éléments de données partielles (n), où

la deuxième unité de création (504) crée le premier arbre binaire (Th) sur la base des feuilles et de la chaîne de valeurs de hachage (LhRD).


 
8. Procédé d'authentification de signature numérique, comprenant :

la division de données de transmission en continu (ST) en une pluralité d'éléments de données partielles (di) dans une unité prédéterminée ;

la création d'une chaîne de valeurs de hachage (LhRD) incluant une pluralité de valeurs de hachage (hi) correspondant aux éléments de données partielles (di) ;

la création d'un premier arbre binaire (Th) en utilisant la chaîne de valeurs de hachage (LhRD) ;

la création d'une signature numérique (SA) d'un signataire en utilisant une valeur racine (hR) du premier arbre binaire (Th), où le signataire garantit un contenu des données de transmission en continu (ST) en signant les données (ST) ;

l'extraction de données partielles (di) des données de transmission en continu (ST) ;

la suppression de données partielles restantes des données de transmission en continu (ST) ;

la création d'un deuxième arbre binaire (Td) en utilisant des valeurs de hachage correspondant aux données partielles restantes ; et

la sortie des données partielles extraites (di) et d'une valeur racine (hRD) du deuxième arbre binaire (Td) ; caractérisé par :

l'obtention, comme un nombre aléatoire racine (rR), d'un nombre aléatoire ; et

à création d'un troisième arbre binaire (Tr) en utilisant le nombre aléatoire racine (rR) comme une racine du troisième arbre binaire (Tr) de sorte que le nombre de feuilles du troisième arbre binaire (Tr) soit identique au nombre des éléments de données partielles (n) ;

où la création du premier arbre binaire (Th) inclut la création du premier arbre binaire (Th) sur la base des feuilles et de la chaîne de valeurs de hachage (LhRD).


 




Drawing




















































































REFERENCES CITED IN THE DESCRIPTION



This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.

Patent documents cited in the description