Abstract: Hierarchical cryptography expressed in a general semiordered structure other than a tree structure is implemented. In information generation, random numbers ?v and (?vj)j?w(v)?Zq are generated; main information kv=?v?i?{1, . . . , N-1}\w(v)vibi*+bN* is calculated; and derivation information kvj=?vj?i?{1, . . . , N-1}\w(v)vibi*+bj* is calculated for each j?w(v). In information derivation, random numbers ?u and (?uj)j?w(u)?Zq are generated; main information ku=?u?i?w(v)\w(u)uikvi+kv is calculated; and derivation information kuj=?uj?i?w(v)\w(u)uikvi+kvj is calculated for each j?w(v).

Abstract: Security against CCA is improved without providing space for just improving the security against CCA in a ciphertext space. In encryption processing, a first ciphertext C1 is calculated from a plaintext M and a symmetric key K; a value containing a value corresponding to the symmetric key K and a value corresponding to the first ciphertext C1 is put into a collision-resistant function H to calculate a function value of the function H; and r corresponding to the function value is used to calculate second ciphertext C2=r·(??=1nv?·b?)+?·bn+1?G1n+1. In decryption processing, the second ciphertext C2?G1n+1 and key information D1*=?·(??=1nw?·b?*)+bn+1*?G2n+1 are put into a bilinear function e to calculate a function value S˜=e(C2, D1*)?GT; a value corresponding to the function value S˜ and the first ciphertext C1 are put into the collision-resistant function H to calculate a function value of the function H; and it is judged whether r˜ corresponding to the function value satisfies C2=r˜·(??=1nv?·b?)+?˜·bn+1?G1n+1.

Abstract: A securing structure for securing a measuring member having a sensor element and a lead elongated from the sensor element to a subject to be measured, the securing structure includes the measuring member including a measuring section having a covered portion in which a part of the lead elongated from the sensor element and having a predetermined length is covered by a material having a rigidity larger than that of the lead, the covered portion being folded toward the side of the lead elongated from the covered portion to produce a folded end portion; and the subject to be measured having an insertion section through which the measuring section is inserted from the side of the folded end portion, a container section which contains the measuring section inserted through the insertion section, and a contact section with which the head portion of the covered portion comes into contact and by which the measuring section is prevented from falling out, when the lead is pulled.

Abstract: A bid-opening device 20 receives from each bidding device 10m a bidding price index ?m=g(hk(IVm)) (where IVm is an initial value, hk indicates k-times processing with a one-way function h and g is a one-way function) and its identifier IDm. The received information is stored on a common bulletin board 25. Dm=hk(IVm) (where Dm=g(Dm) is generated with k set as the upper limit value K of the bidding price. The bulletin board 25 is checked for ?m which matches this Dm. If no match is found, m is incremented by one, and the check for ?m-Dm matching is made for each of m bidding devices. Upon completion of the matching for all the bidding devices, k is decremented by one, and a check is made for for ?m which matches Dm=g(hk(IVm)), and the index k for which they match is determined as the highest price bid. The bid-opening device 20 outputs that k and the identifier IDm of ?m.

Abstract: A bid-opening device 20 receives from each bidding device 10m a bidding price index ?m=g(hk(IVm)) (where IVm is an initial value, hk indicates k-times processing with a one-way function h and g is a one-way function) and its identifier IDm. The received information is stored on a common bulletin board 25. Dm=hk(IVm) (where Dm=g(Dm) is generated with k set as the upper limit value K of the bidding price. The bulletin board 25 is checked for ?m which matches this Dm. If no match is found, m is incremented by one, and the check for ?m?Dm matching is made for each of m bidding devices. Upon completion of the matching for all the bidding devices, k is decremented by one, and a check is made for ?m which matches Dm=g(hk(IVm)), and the index k for which they match is determined as the highest price bid. The bid-opening device 20 outputs that k and the identifier IDm of ?m.

Abstract: A signature is generated by a scheme in which x denotes a secret key of a signature generating apparatus, mrec ? {0, 1}M denotes a recovery message, k denotes an arbitrary value, g denotes a generator of a cyclic group G of order q, R represents gk ? G, H1 represents a hash function H1: {0, 1}*?{0, 1}L, H2 represents a hash function H2: {0, 1}*?{0, 1}M that has a variable output length, H3 represents a hash function H3: {0, 1}*?Zq, r=H1(R, mrec)|mrec(+)H2(R, H1(R, mrec)), where (+) represents an exclusive-OR operator, t is defined for ?, which depends on r, as t=H3(?), s is defined as s=k?t·x ? Z, and a signature is ?=(r, s).

Abstract: A securing structure for securing a measuring member having a sensor element and a lead elongated from the sensor element to a subject to be measured, the securing structure includes the measuring member including a measuring section having a covered portion in which a part of the lead elongated from the sensor element and having a predetermined length is covered by a material having a rigidity larger than that of the lead, the covered portion being folded toward the side of the lead elongated from the covered portion to produce a folded end portion; and the subject to be measured having an insertion section through which the measuring section is inserted from the side of the folded end portion, a container section which contains the measuring section inserted through the insertion section, and a contact section with which the head portion of the covered portion comes into contact and by which the measuring section is prevented from falling out, when the lead is pulled.

Abstract: A tag device causes a second calculator to read a confidential value from a confidential value memory and to apply a second function F2 which disturbs a relationship between elements of a definition domain and a mapping thereof to generate tag output information. The tag device delivers the tag output information to a backend apparatus. Subsequently, a first calculator reads out at least part of elements of the confidential value from the confidential value memory, and applies a first function F1, an inverse image of which is difficult to obtain, and a result of such calculation is used to update a confidential value in the confidential value memory by overwriting.

Abstract: A bid-opening device 20 receives from each bidding device 10m a bidding price index ?m=g(hk(IVm)) (where IVm is an initial value, hk indicates k-times processing with a one-way function h and g is a one-way function) and its identifier IDm. The received information is stored on a common bulletin board 25. Dm=hk(IVm) (where Dm=g(Dm) is generated with k set as the upper limit value K of the bidding price. The bulletin board 25 is checked for ?m which matches this Dm. If no match is found, m is incremented by one, and the check for ?m-Dm matching is made for each of m bidding devices. Upon completion of the matching for all the bidding devices, k is decremented by one, and a check is made for ?m which matches Dm=g(hk(IVm)), and the index k for which they match is determined as the highest price bid. The bid-opening device 20 outputs that k and the identifier IDm of ?m.

Abstract: A bid-opening device 20 receives from each bidding device 10m a bidding price index ?m=g(hk(IVm)) (where IVm is an initial value, hk indicates k-times processing with a one-way function h and g is a one-way function) and its identifier IDm. The received information is stored on a common bulletin board 25. Dm=hk(IVm) (where Dm=g(Dm) is generated with k set as the upper limit value K of the bidding price. The bulletin board 25 is checked for ?m which matches this Dm. If no match is found, m is incremented by one, and the check for ?m?Dm matching is made for each of m bidding devices. Upon completion of the matching for all the bidding devices, k is decremented by one, and a check is made for ?m which matches Dm=g(hk(IVm)), and the index k for which they match is determined as the highest price bid. The bid-opening device 20 outputs that k and the identifier IDm of ?m.

Abstract: The present invention is to provide a resin composition excellent in mechanical properties and solvent resistance, and the resin composition (C) of the present invention comprises an polyolefin (A1) and an olefinic block polymer (A2), wherein the olefinic block polymer (A2) comprises, as a constitutional unit, a block (a) which is a polyolefin component and a block (b) which is a polymer unit composed of a vinyl monomer having a solubility parameter of from 18 to 25 J/m and the block (a) and the block (b) are bonded each other by a covalent bond. Moreover, another invention of the present invention is to provide a laminated structure having a laminated configuration in which a layer comprising an olefinic polymer layer and a layer comprising other synthetic resins, a metal and the like are strongly bonded through an adhesive layer, wherein the adhesive layer comprises the resin composition (C).

Abstract: According to a first invention, in response to an access from a reader, a tag device causes its second calculator to read a confidential value from a confidential value memory and to apply a second function F2 which disturbs a relationship between elements of a definition domain and a mapping thereof to generate tag output information. The tag output information is fed to an output section, which then delivers it to a backend apparatus. Subsequently, a first calculator reads out at least part of elements of the confidential value from the confidential value memory, and applies a first function F1, an inverse image of which is difficult to obtain, and a result of such calculation is used to update a confidential value in the confidential value memory by overwriting.

Abstract: An epoxy resin composition comprising an epoxy resin (A), a curing agent (B) and a curing accelerator (C), wherein the curing agent (B) is a phenol compound having two or more hydroxyl functional groups or a compound obtained by esterification of the phenol compound or a mixture of these compounds, and the curing accelerator (C) is a salt of a phosphazenium compound represented by a formula (I): (wherein R1s each represent a hydrogen atom, a linear, branched or cyclic alkyl group having 1 to 10 carbon atoms or an aryl or aralkyl group having 6 to 10 carbon atoms and may be all the same or different from one another; and Z? represents a halogen anion, hydroxy anion, alkoxy anion, aryloxy anion or carboxy anion).

Abstract: An epoxy resin composition comprising an epoxy resin (A), a curing agent (B) and a curing accelerator (C), wherein the curing agent (B) is a phenol compound having two or more functional groups or a compound obtained by esterification of the phenol compound or a mixture of these compounds, and the curing accelerator (C) is a salt of a phosphazenium compound represented by a formula (I): 1

Abstract: A glass-fiber reinforced polypropylene composition having superior adhesion of glass fibers therein, stiffness, high-impact properties and molding properties is provided, which composition comprises a graft polypropylene resin obtained by graft-polymerizing a radically polymerizable unsaturated compound onto a crystalline polypropylene resin with an organic peroxide catalyst in a hydrocarbon solvent or a blend of the graft polypropylene with a crystalline polypropylene resin, glass fibers treated with an organic silane or titanium compound, Ca stearate and an alkaline earth metal compound, the respective quantities of the above components being specified.