US5263085A  Fast signature scheme based on sequentially linearized equations  Google Patents
Fast signature scheme based on sequentially linearized equations Download PDFInfo
 Publication number
 US5263085A US5263085A US07974751 US97475192A US5263085A US 5263085 A US5263085 A US 5263085A US 07974751 US07974751 US 07974751 US 97475192 A US97475192 A US 97475192A US 5263085 A US5263085 A US 5263085A
 Authority
 US
 Grant status
 Grant
 Patent type
 Prior art keywords
 signature
 equations
 modulus
 scheme
 linear
 Prior art date
 Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
 Expired  Lifetime
Links
Images
Classifications

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
 H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
 H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or publickey parameters
 H04L9/302—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or publickey parameters involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
 H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
 H04L9/3093—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving Lattices or polynomial equations, e.g. NTRU scheme

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
 H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, nonrepudiation, key authentication or verification of credentials
 H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, nonrepudiation, key authentication or verification of credentials involving digital signatures
Abstract
Description
The present invention relates to a novel method and apparatus for implementing a digital signature scheme, and more particularly relates to a method and apparatus for implementing a fast signature scheme based on sequentially linearized equations.
A digital signature scheme is a method of ensuring the authenticity of digital messages which is unforgeable by its recipient and undeniable by its sender. It consists of two efficient (polynomial time) algorithms:
1. A generation algorithm G, which computes a signature S from a message M and from a random string R (i.e., S=G(M,R)). Since the algorithm is probabilistic, the same message can have many different signatures. The parameters of G are called the private key, and only the signer knows them.
2. A verification algorithm V, which decides whether a given S is a valid signature of a given message M (i.e., V(M,S)=yes or no). The parameters of V are called the public key, and everyone can find them in a public key directory.
The obvious condition which every digital signature scheme should satisfy is that: for any M and R, V(M,G(M,R))=yes. In addition, finding any S which satisfies V(M,S)=yes for a given M should be extremely difficult when the signer's private key is unknown. The precise formalization of this intuitive security requirement is quite subtle, and can be found e.g. in Goldwasser, Micali and Rivest[1988]: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks. SIAM Journal of Computing, Vol. 17, No. 2, April 1988, pp. 281308.
Almost all the practical digital signature schemes proposed so far are based on arithmetic operations modulo a large modulus n. The earliest example of such a signature scheme is the RSA scheme (Rivest, Shamir, and Adleman (1978]): A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Communications of the ACM, Vol. 21, No. 2, February 1978, pp. 120126, whose security is based on (but not known to be provably equivalent to) the difficulty of factoring the modulus n. Unfortunately, the generation of signatures in the RSA scheme requires many (≧750) modular multiplications of large (≧512 bit) numbers, and is thus quite slow. The recently introduced DSA (Digital Signature Algorithm[1991]): Specifications of a Digital Signature Algorithm, National Institute of Standards and Technology, Draft, August 1991 is based on (but not known to be equivalent to) the difficulty of computing discrete logarithms modulo large primes, and its efficiency is comparable to that of the RSA scheme. The FS scheme (Fiat and Shamir[1986]): How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Proc. Crypto 86, August 1986, pp. 186194 is considerably faster, but it still requires 30 to 60 modular multiplications. Many other variants of largemodulus schemes exist, but most of the really fast proposals (such as the OSS scheme (Ong Schnorr and Shamir[1984): An Efficient Signature Scheme Based on Quadratic Equations, Proceedings 16th ACM Symp. Theory of Computing, May 1984, pp. 208216, and the OS scheme (Okamoto and Shiraishi[1985]): A Fast Signature Scheme Based on Quadratic Inequalities, Proc. 1985 Symp. on Security and Privacy, April 1985 which require just a few modular multiplications to generate and verify signatures) were shown to be vulnerable to sophisticated numbertheoretic attacks developed by Pollard and Brickell.
The method and apparatus of the present invention implements a novel signature scheme based on a system of multivariate polynomial equations of the form: ##EQU1## where M is the message to be signed, each Hi is a hash function (based on a cryptographically strong function such as DES) mapping M into a randomlylooking number in [0,n), and each Ei is a polynomial of degree d>1in the m variables xj. Each user chooses a different system of k>1 polynomials Ei, and publishes their coefficients as his public key. The modulus n is the product of two large (≧256 bit) primes p and q. A valid signature of M is any set of values for x1, . . . ,xm which satisfies all the modular equations.
Solving general systems of equations of this type is considered a very difficult problem. When the number of variables and equations is allowed to increase, the problem is NPcomplete even when all the polynomials Ei are quadratic (d=2) and the modulus n is a small prime (e.g., n=2). When there is one quadratic equation in one unknown (k=m=1, d=2), the problem is as hard as the factorization of the modulus. On the other hand, the problem is easily solvable if d=1, if k=1and the factorization of the modulus is given, or if k=1 and d=2 (regardless of whether the factorization of n is given or not).
Any signature scheme should include a trapdoor which enables the legitimate signer to solve the system efficiently, but which is not visible to the cryptanalyst. One such trapdoor can be the factorization of the modulus n. The difficulty of factoring n will keep this trapdoor information invisible to the cryptanalyst, but the knowledge of the factorization will enable the legitimate signer to extract roots mod n during the equation solving process. Unfortunately, such rootbased schemes are quite slow (especially in software implementations on standard microprocessors) , since each root extraction requires hundreds of modular multiplications.
The novel signature scheme according to the present invention uses a different trapdoor, which requires no root extractions. According to the invention a system of polynomial equations Ei(x1, . . . ,xm)=Hi(M) (mod n) is changed by a linear transformation Y=AX (mod n) (where X is the vector of m original xj variables, Y is a vector of m new variables yj, and A is some invertible m×m matrix) into a system of polynomial equations of the form Fi(y1, . . . ,yi) in which yi occurs only linearly. Due to the triangular form of the resultant equations (in which the ith equation contains only the first i variables), the user can sequentially solve them by substituting the already computed values of y1, . . . ,yi1 into Fi, and solving the resultant equation Fi=Hi(M) (mod n) which is linear in the single remaining variable yi. The computed Y solution can be translated back into the desired X solution via the inverse linear transformation X=A^{1} Y (mod n).
The actual key generation process is carried out in reverse order: The user first chooses the triangular polynomials Fi(y1, . . . ,yi) and the matrix A, and then transforms each Fi into Ei by replacing each yj variable with the linear combination of xj variables indicated by the A transformation.
In the preferred embodiment of the scheme, each Fi is a second degree polynomial of the form:
Li(y1, . . .,yi1)*yi+Qi(y1, . . .,yi1)
where Li is a randomly chosen linear form and Qi is a randomly chosen quadratic form in the stated variables. The linear transformation Y=AX (mod n) translates such an expression into a homogeneous quadratic polynomial which is the sum of m(m+1)/2 monomials of the form cij*xi*xj.
The first equation is a special case, since L1 and Q1 do not have any arguments. Instead of publishing the resultant linear equation (which can help the cryptanalyst), the user drops the first equation during the key generation process, and assigns an arbitrary value to y1 during the message signing process. The remaining system of k=m1 quadratic equations in the m variables xj will have about n solutions (i.e., signatures) for each message M, depending on the actual choice of value for y1.
The general form of a homogeneous quadratic F2 is c1*y1*y2+c2*y1*y1, which can be rewritten as y1*(c1*y1+c2*y2). The parenthesized linear expression can be considered as the new definition of y2 under a modified definition of the matrix A. Thus, one can assume without any loss of generality that in the case of homogeneous quadratic equations F2 has the simple form y1*y2.
To further complicate the task of the cryptanalyst, the user can optionally apply a secret k×k linear transformation B to the k polynomials Ei (i.e., to their vectors of coefficients) in order to mix them and to hide their structure. This preserves the easy solvability of the modified system of equations E'i(x1, . . .,xm)=Hi(M) (mod n). Other and further objects and advantages of the present invention will be evident from the following detailed description taken in conjunction with the drawing.
The sole FIGURE of the drawing is a schematic showing the novel method and apparatus for generating and verifying a signature to a message.
Referring now to the drawing, the basic structure of the method and apparatus of the present invention implementing the novel fast signature scheme based on sequentially linearized equations will now be described in detail. The description will be by reference to the various steps of the novel method, however, the apparatus employed to effect the various steps, will be evident as a means to carry out the prescribed function and known data processing equipment for these purposes will be readily apparent to those of ordinary skill in this art from the following elaboration of the invention.
The first part involves the generation of a public key. The first step is to select a public composite modulus n, and destroy its factorization as noted in block 10. Next, the user selects k=m1 secret polynomials Fi of degree d (k>1, d>1, i=2, . . . ,m) where Fi contains the i1 variables y1, . . . ,yi1 in an arbitrary form and the variable yi in a linear form as shown in block 12. The user then selects a secret m×m matrix A with entries in [0,n) , block 14 and defines the linear transformation Y=AX (mod n), block 16. The user now replaces each yj in each Fi by the linear combination of xt variables defined by A, and simplifies the resultant polynomials Ei, block 18. Finally, the user extracts the coefficients of all the Ei polynomials and defines (publishes) them as the public key, block 20.
Signature generation is carried out in the following manner. Given the message M, block 30, the user computes its hashed forms Hi (M) for i=2, . . . ,m, block 22. The user chooses a value for y1 in [0,n), block 24 and sequentially solves the linear equations in yi derived from Fi(y1, . . . ,yi)=Hi(M) (mod n) for i=2, . . . ,m, block 26. The user, then computes X=A^{1} Y (mod n), and sends X as the signature of M, block 28.
Signature verification is carried out in the following manner. The message M, block 30, is transferred to block 32 where its hashed forms Hi(M) for i=2, . . . m are computed. The signature X is transferred from block 28 and the public key is transferred from block 20 to block 34 where, the equations Ei(x1, . . . xm)=Hi (M) (mod n) are verified as satisfied for i=2, . . . ,m in decision 36. If YES, the signature is accepted in block 38; if NO, the signature is rejected in block 40.
There are many possible generalizations and extensions of this scheme which now should be obvious to anyone skilled in the art. For example, the user can assign arbitrary values to several yi variables, can determine the values of several yj variables by solving subsystems of simultaneous linearized equations, can choose rational rather than polynomial expressions, can use a universal modulus n chosen by a trusted center, etc.
The following represents one of the simplest implementations of the present invention. As a single quadratic equation in two variables has been shown by Pollard to be solvable in polynomial time even when the factorization of the modulus is unknown, the simplest recommended implementation of the present invention is two quadratic equations in three variables. Their general form is:
F2(y1, y2=y1*y2
F3(y1,y2,y3)=(c1*y1+c2*y2)*y3+(c3*y1*y1+c4*y1*y2+c5*y2*y2)
where c1, . . . ,c5 are random secret constants according to the teachings of the present invention. It may be desirable to use a larger minimum implementation, e.g. three quadratic equations in four unknowns, and in fact it may be desirable to use a larger minimum implementation, such as three quadratic equations in four unknowns.
To solve the equations Fi=Hi (M) (mod n) , the user chooses y1, computes y2 from the first equation by a single modular division, and computes y3 from the second equation by seven modular multiplications and one modular division. The 3×3 matrix A^{1} can be assumed without loss of generality to contain a first column of 1's, and thus only six additional multiplications are required to transform the Y solution into an X solution. The total number of modular multiplications/divisions required to generate a signature is thus 15, and the size of the transmitted signature is 3×512=1536 bits.
The user's public key consists of the 2×6=12 coefficients of E2 and E3. This number can be reduced to 8 by applying an appropriate 2×2 transformation B to the two polynomials Ei which changes two of their coefficients to 0 and two of their coefficients to 1 before they are published. A further optimization can reduce the number of coefficients which should actually be retained by each verifier to 4: Instead of verifying separately the two modular equations, the verifier can choose a random linear combination of the two equations with small (say, 64 bit) coefficients, retain only the resultant linear combinations of coefficients, and check each signature X by substituting it into the combined equation. If the signer does not know which random combination of the two equations the verifier will actually check, then any attempt to send an X which does not satisfy one of the equations will succeed only with negligible (≦2^{64}) probability. As an additional benefit, the number of modular multiplications required to verify the signature is reduced to 7 (if one ignores the cheap multiplications of full size numbers by 64 bit coefficients). The implementation outlined above can be demonstrated with the (totally insecure) modulus n=7*11=77. Except for the smallness of the coefficients, this is a typical example of the key generation process with 3 variables and 2 quadratic equations.
The secret polynomials F2 and F3 are chosen as:
F2(y1,y2)=y1*y2
F3(y1,y2,y3)=(4*y1+3*y2)*y3+(9*y1*y1+21*y1*y2+4*y2*y2)
The secret linear transformation A is chosen as:
y1=x1+x2+3*x3
y2=x1+2*x2+x3
y3=x1+x2+4*x3
By substituting these linear expressions into the Fi's and simplifying, the two quadratic expressions result:
E2(x1,x2,x3)=1*x1*x1+3*x1*x2+4*x1*x3+2*x2*x2+7*x2*x3+3*x3*x3 (mod 77)
E3(x1,x2,x3)=41*x1*x1+37*x1*x2+35*x1*x3+0*x2*x2+41*x2*x3+54*x3*x3 (mod 77)
The public key is the pair of vectors of coefficients:
K2=(1, 3, 4, 2, 7, 3)
K3=(41, 37, 35, 0, 41, 54).
However, before publishing these two vectors, the user can apply any invertible 2×2 matrix B to these vectors, either in order to mix their coefficients for security reasons, or in order to eliminate some of the coefficients for efficiency reasons. After receiving the two vectors, the verifier can decide to retain only one secret linear combination such as:
K1=3*K2+2*K3=(8, 6, 5, 6, 26, 40) (mod 77).
This halves the size of the public key directory that the verifier has to store, but still enables him to check with high confidence the validity of the given signature (x1, x2, x3) by checking that the evaluation of the polynomial defined by the vector of coefficients K1 is equal to 3*H2(M)+2*H3(M) (mod 77).
There now follows a small modulus variant of the novel scheme. As stated, the security of the scheme is based on the difficulty of factoring the modulus n, and in fact there are fast techniques (based on Grobner bases) for solving small systems of multivariate polynomial equations when this factorization is known. However, the general problem of solving large systems of quadratic equations is NPcomplete even for a small prime modulus such as n=2. This can provide an alternative basis for the security of the new signature scheme, which is unrelated to the difficulty of factoring large integers.
In the small modulus variant of the new signature scheme, the modulus n is chosen as a small number (preferably smaller than 2^{32} ; a good choice can be n=251 which is the largest single byte prime). The actual construction of the public and private keys is the same, except for the following additional precautions:
1. Since F2 is easy to factor modulo the small modulus, it is essential to either drop additional equations, or to mix the published polynomials with a randomly chosen matrix B.
2. The number of variables m should be increased to at least 16, and possibly to 32, in order to foil the known equation solving techniques.
3. If the modulus n is too small, the cryptanalyst can try to exhaustively search for a solution. The number n^{m} of possible assignments of values to variables should be at least 2^{64}, and preferably over 2^{128}.
The main disadvantage of the small modulus variant of the scheme is the large size of the public key. A general homogeneous quadratic expression in 16 variables has 136 coefficients, and 15 such equations have 2040 coefficients. Even if each coefficient fits into a single byte, the total size of each public key is about 16 kilobits, which makes this variant unattractive.
Known components can be used for the apparatus of the present invention as portrayed in the sole FIGURE, the means to carry out the several steps of the process being apparent to those skilled in the art.
Although the invention has been shown and described in terms of a specific preferred embodiment and variants, changes and modifications are possible which do not depart from the spirit, scope or contemplation of the inventive concepts disclosed herein. Such are deemed to fall within the purview of the invention as claimed.
Claims (14)
Priority Applications (1)
Application Number  Priority Date  Filing Date  Title 

US07974751 US5263085A (en)  19921113  19921113  Fast signature scheme based on sequentially linearized equations 
Applications Claiming Priority (6)
Application Number  Priority Date  Filing Date  Title 

US07974751 US5263085A (en)  19921113  19921113  Fast signature scheme based on sequentially linearized equations 
US08047420 US5375170A (en)  19921113  19930419  Efficient signature scheme based on birational permutations 
EP19930118309 EP0597481B1 (en)  19921113  19931111  Efficient signature schemes based on birational permutations 
DE1993630934 DE69330934D1 (en)  19921113  19931111  based on birational permutations powerful signature method 
DE1993630934 DE69330934T2 (en)  19921113  19931111  based on birational permutations powerful signature method 
JP28522393A JPH075808A (en)  19921113  19931115  Efficient document coding mechanism based on two rational displacement 
Related Child Applications (1)
Application Number  Title  Priority Date  Filing Date 

US08047420 ContinuationInPart US5375170A (en)  19921113  19930419  Efficient signature scheme based on birational permutations 
Publications (1)
Publication Number  Publication Date 

US5263085A true US5263085A (en)  19931116 
Family
ID=25522400
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

US07974751 Expired  Lifetime US5263085A (en)  19921113  19921113  Fast signature scheme based on sequentially linearized equations 
Country Status (1)
Country  Link 

US (1)  US5263085A (en) 
Cited By (31)
Publication number  Priority date  Publication date  Assignee  Title 

US5347581A (en) *  19930915  19940913  Gemplus Developpement  Verification process for a communication system 
US5432852A (en) *  19930929  19950711  Leighton; Frank T.  Large provably fast and secure digital signature schemes based on secure hash functions 
DE19513898A1 (en) *  19950412  19961017  Deutsche Telekom Ag  Publickey method for encrypting data 
DE19513896A1 (en) *  19950412  19961017  Deutsche Telekom Ag  A method of signing a message 
US5678055A (en) *  19931122  19971014  Fujitsu Limited  Method and device for generating Grobner bases to reduce memory usage and increase computing speed 
US5841872A (en) *  19960701  19981124  Allsoft Distributing Incorporated  Encryption enhancement system 
US5932119A (en) *  19960105  19990803  Lazare Kaplan International, Inc.  Laser marking system 
US6035314A (en) *  19960717  20000307  Fujitsu Limited  Information processing method 
US6041123A (en) *  19960701  20000321  Allsoft Distributing Incorporated  Centralized secure communications system 
US6111952A (en) *  19960126  20000829  Bull Cp8  Asymmetrical cryptographic communication method and portable object therefore 
US6144740A (en) *  19980520  20001107  Network Security Technology Co.  Method for designing public key cryptosystems against faultbased attacks with an implementation 
FR2815493A1 (en) *  20000929  20020419  Bull Cp8  Internet/bank card electronic signature generation having quadratic equation generation and signature calculated using hash public function with supplementary private values preventing hacking. 
US20030051151A1 (en) *  20010807  20030313  Sony Corporation  Information processing apparatus, information processing method and program 
US20050188207A1 (en) *  20040121  20050825  Ntt Docomo, Inc.  Multi signature verification system, electronic signature attaching apparatus, data addition apparatus, and electronic signature verification apparatus 
US7036014B2 (en)  19970210  20060425  The Regents Of The University Of California  Probabilistic signature scheme 
US7080041B2 (en)  20000524  20060718  Esecuredocs, Inc.  System and method for production and authentication of original documents 
US7089420B1 (en)  20000524  20060808  Tracer Detection Technology Corp.  Authentication method and system 
US7100051B1 (en)  19990429  20060829  Nds Limited  Publickey signature methods and systems 
US7162035B1 (en)  20000524  20070109  Tracer Detection Technology Corp.  Authentication method and system 
US20090067620A1 (en) *  20060223  20090312  Matsushita Electric Industrial Co., Ltd.  Cryptographic Hashing Device and Method 
US20100008505A1 (en) *  20050513  20100114  Temple University Of The Commonwealth System Of Higher Education  Secret sharing technique with low overhead information content 
US7890763B1 (en) *  20070914  20110215  The United States Of America As Represented By The Director, National Security Agency  Method of identifying invalid digital signatures involving batch verification 
US8171567B1 (en)  20020904  20120501  Tracer Detection Technology Corp.  Authentication method and system 
US20120185946A1 (en) *  20110114  20120719  Microsoft Corporation  Secure computing in multitenant data centers 
US20120254619A1 (en) *  20110401  20121004  Cleversafe, Inc.  Generating a secure signature utilizing a plurality of key shares 
US20130046992A1 (en) *  20110817  20130221  Cleversafe, Inc.  Storage and retrieval of dispersed storage network access information 
US20130294601A9 (en) *  20100602  20131107  Nds Limited  Efficient Multivariate Signature Generation 
US20140192981A1 (en) *  20110829  20140710  Sony Corporation  Information processing apparatus, signature generation apparatus, information processing method, signature generation method, and program 
WO2015004065A1 (en) *  20130712  20150115  Koninklijke Philips N.V.  Electronic signature system 
EP2743902A4 (en) *  20110812  20150909  Sony Corp  Information processing device and information processing method 
US9280696B1 (en)  20080423  20160308  Copilot Ventures Fund Iii Llc  Authentication method and system 
Citations (5)
Publication number  Priority date  Publication date  Assignee  Title 

US4748668A (en) *  19860709  19880531  Yeda Research And Development Company Limited  Method, apparatus and article for identification and signature 
US4932056A (en) *  19890316  19900605  Yeda Research And Development Company Limited  Method and apparatus for user identification based on permuted kernels 
US4987593A (en) *  19880316  19910122  David Chaum  Oneshow blind signature systems 
US4995082A (en) *  19890224  19910219  Schnorr Claus P  Method for identifying subscribers and for generating and verifying electronic signatures in a data exchange system 
US5016274A (en) *  19881108  19910514  Silvio Micali  Online/offline digital signing 
Patent Citations (5)
Publication number  Priority date  Publication date  Assignee  Title 

US4748668A (en) *  19860709  19880531  Yeda Research And Development Company Limited  Method, apparatus and article for identification and signature 
US4987593A (en) *  19880316  19910122  David Chaum  Oneshow blind signature systems 
US5016274A (en) *  19881108  19910514  Silvio Micali  Online/offline digital signing 
US4995082A (en) *  19890224  19910219  Schnorr Claus P  Method for identifying subscribers and for generating and verifying electronic signatures in a data exchange system 
US4932056A (en) *  19890316  19900605  Yeda Research And Development Company Limited  Method and apparatus for user identification based on permuted kernels 
Cited By (55)
Publication number  Priority date  Publication date  Assignee  Title 

US5347581A (en) *  19930915  19940913  Gemplus Developpement  Verification process for a communication system 
US5432852A (en) *  19930929  19950711  Leighton; Frank T.  Large provably fast and secure digital signature schemes based on secure hash functions 
US5678055A (en) *  19931122  19971014  Fujitsu Limited  Method and device for generating Grobner bases to reduce memory usage and increase computing speed 
DE19513898A1 (en) *  19950412  19961017  Deutsche Telekom Ag  Publickey method for encrypting data 
DE19513896A1 (en) *  19950412  19961017  Deutsche Telekom Ag  A method of signing a message 
US5787178A (en) *  19950412  19980728  Deutsche Telekom Ag  Computerized method for signing a message 
DE19513898B4 (en) *  19950412  20061130  Deutsche Telekom Ag  Publickey method for encrypting data 
US5835598A (en) *  19950412  19981110  Deutsche Telekom Ag  Public key method of encoding data 
US6211484B1 (en)  19960105  20010403  Lazare Kaplan International, Inc.  Laser making system and certificate for a gemstone 
US5932119A (en) *  19960105  19990803  Lazare Kaplan International, Inc.  Laser marking system 
US6476351B1 (en)  19960105  20021105  Lazare Kaplan International, Inc.  Laser marking system 
EP2216126A2 (en)  19960105  20100811  Lazare Kaplan International Inc.  Laser marking system for gemstones and method of authenticating marking 
US6111952A (en) *  19960126  20000829  Bull Cp8  Asymmetrical cryptographic communication method and portable object therefore 
US6041123A (en) *  19960701  20000321  Allsoft Distributing Incorporated  Centralized secure communications system 
US5841872A (en) *  19960701  19981124  Allsoft Distributing Incorporated  Encryption enhancement system 
US6035314A (en) *  19960717  20000307  Fujitsu Limited  Information processing method 
US7036014B2 (en)  19970210  20060425  The Regents Of The University Of California  Probabilistic signature scheme 
US6144740A (en) *  19980520  20001107  Network Security Technology Co.  Method for designing public key cryptosystems against faultbased attacks with an implementation 
US7100051B1 (en)  19990429  20060829  Nds Limited  Publickey signature methods and systems 
US7089420B1 (en)  20000524  20060808  Tracer Detection Technology Corp.  Authentication method and system 
US7080041B2 (en)  20000524  20060718  Esecuredocs, Inc.  System and method for production and authentication of original documents 
US8270603B1 (en)  20000524  20120918  Tracer Detection Technology Corp.  Authentication method and system 
US9811671B1 (en)  20000524  20171107  Copilot Ventures Fund Iii Llc  Authentication method and system 
US7152047B1 (en)  20000524  20061219  Esecure.Biz, Inc.  System and method for production and authentication of original documents 
US7162035B1 (en)  20000524  20070109  Tracer Detection Technology Corp.  Authentication method and system 
US9363083B1 (en)  20000524  20160607  Copilot Ventures Fund Iii Llc  Authentication method and system 
FR2815493A1 (en) *  20000929  20020419  Bull Cp8  Internet/bank card electronic signature generation having quadratic equation generation and signature calculated using hash public function with supplementary private values preventing hacking. 
US20030051151A1 (en) *  20010807  20030313  Sony Corporation  Information processing apparatus, information processing method and program 
US8886946B1 (en)  20020904  20141111  Copilot Ventures Fund Iii Llc  Authentication method and system 
US8171567B1 (en)  20020904  20120501  Tracer Detection Technology Corp.  Authentication method and system 
US9818249B1 (en)  20020904  20171114  Copilot Ventures Fund Iii Llc  Authentication method and system 
US7627763B2 (en) *  20040121  20091201  Ntt Docomo, Inc.  Multi signature verification system, electronic signature attaching apparatus, data addition apparatus, and electronic signature verification apparatus 
US20050188207A1 (en) *  20040121  20050825  Ntt Docomo, Inc.  Multi signature verification system, electronic signature attaching apparatus, data addition apparatus, and electronic signature verification apparatus 
US8059816B2 (en) *  20050513  20111115  Temple University Of The Commonwealth System Of Higher Education  Secret sharing technique with low overhead information content 
US20100008505A1 (en) *  20050513  20100114  Temple University Of The Commonwealth System Of Higher Education  Secret sharing technique with low overhead information content 
US20090067620A1 (en) *  20060223  20090312  Matsushita Electric Industrial Co., Ltd.  Cryptographic Hashing Device and Method 
US8150030B2 (en) *  20060223  20120403  France Telecom  Cryptographic hashing device and method 
US7890763B1 (en) *  20070914  20110215  The United States Of America As Represented By The Director, National Security Agency  Method of identifying invalid digital signatures involving batch verification 
US9846814B1 (en)  20080423  20171219  Copilot Ventures Fund Iii Llc  Authentication method and system 
US9280696B1 (en)  20080423  20160308  Copilot Ventures Fund Iii Llc  Authentication method and system 
US20130294601A9 (en) *  20100602  20131107  Nds Limited  Efficient Multivariate Signature Generation 
US8958560B2 (en) *  20100602  20150217  Cisco Technology Inc.  Efficient multivariate signature generation 
US20120185946A1 (en) *  20110114  20120719  Microsoft Corporation  Secure computing in multitenant data centers 
CN102611692B (en) *  20110114  20141119  微软公司  Secure computing method in multitenant data centers 
US8700906B2 (en) *  20110114  20140415  Microsoft Corporation  Secure computing in multitenant data centers 
CN102611692A (en) *  20110114  20120725  微软公司  Secure computing in multitenant data centers 
US20120254619A1 (en) *  20110401  20121004  Cleversafe, Inc.  Generating a secure signature utilizing a plurality of key shares 
US8627091B2 (en) *  20110401  20140107  Cleversafe, Inc.  Generating a secure signature utilizing a plurality of key shares 
EP2743902A4 (en) *  20110812  20150909  Sony Corp  Information processing device and information processing method 
US9490978B2 (en)  20110812  20161108  Sony Corporation  Information processing apparatus and information processing method 
US20130046992A1 (en) *  20110817  20130221  Cleversafe, Inc.  Storage and retrieval of dispersed storage network access information 
US9229823B2 (en) *  20110817  20160105  International Business Machines Corporation  Storage and retrieval of dispersed storage network access information 
US20140192981A1 (en) *  20110829  20140710  Sony Corporation  Information processing apparatus, signature generation apparatus, information processing method, signature generation method, and program 
US9276735B2 (en) *  20110829  20160301  Sony Corporation  Information processing apparatus, signature generation apparatus, information processing method, signature generation method, and program 
WO2015004065A1 (en) *  20130712  20150115  Koninklijke Philips N.V.  Electronic signature system 
Similar Documents
Publication  Publication Date  Title 

Camenisch et al.  Simulatable adaptive oblivious transfer  
Boneh  Twenty years of attacks on the RSA cryptosystem  
Blum et al.  An efficient probabilistic publickey encryption scheme which hides all partial information  
Bresson et al.  A simple publickey cryptosystem with a double trapdoor decryption mechanism and its applications  
Nguyen et al.  The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.  
Mambo et al.  Proxy signatures: Delegation of the power to sign messages  
Yap et al.  An efficient certificateless signature scheme  
Catalano et al.  Paillier's cryptosystem revisited  
Bao et al.  A signcryption scheme with signature directly verifiable by public key  
Ong et al.  Fast signature generation with a Fiat Shamir—like scheme  
US5987131A (en)  Cryptographic key exchange using precomputation  
US6088798A (en)  Digital signature method using an elliptic curve, a digital signature system, and a program storage medium having the digital signature method stored therein  
US6266771B1 (en)  Probabilistic signature scheme  
US5299263A (en)  Twoway public key authentication and key agreement for lowcost terminals  
Abe et al.  1outofn signatures from a variety of keys  
Boneh et al.  Chosenciphertext security from identitybased encryption  
Ong et al.  An efficient signature scheme based on quadratic equations  
US6446207B1 (en)  Verification protocol  
US4633036A (en)  Method and apparatus for use in publickey data encryption system  
Lyubashevsky  FiatShamir with aborts: Applications to lattice and factoringbased signatures  
Kozlov et al.  Forwardsecure signatures with fast key update  
Boneh et al.  Strongly unforgeable signatures based on computational DiffieHellman  
Hofheinz et al.  Practical chosen ciphertext secure encryption from factoring  
Okamoto  Designated confirmer signatures and publickey encryption are equivalent  
US6396926B1 (en)  Scheme for fast realization of encrytion, decryption and authentication 
Legal Events
Date  Code  Title  Description 

AS  Assignment 
Owner name: YEDA RESEARCH AND DEVELOPMENT CO., LTD., ISRAEL Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:SHAMIR, ADI;REEL/FRAME:006400/0695 Effective date: 19921207 

FPAY  Fee payment 
Year of fee payment: 4 

REMI  Maintenance fee reminder mailed  
FP  Expired due to failure to pay maintenance fee 
Effective date: 20011116 

FPAY  Fee payment 
Year of fee payment: 8 

SULP  Surcharge for late payment  
PRDP  Patent reinstated due to the acceptance of a late maintenance fee 
Effective date: 20020527 

FPAY  Fee payment 
Year of fee payment: 12 