US5604805A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Privacy-protected transfer of electronic information
Assignee: Radialpoint Inc
•
Filing: 1996-02-09
•
Granted: 1997-02-18
•
Expires: 2016-02-09
Abstract
Abstract Cryptographic apparatus and means are disclosed for each of three types of participants in an electronic system for privacy-protected transfer of certified information. This invention reveals protocols that improve efficiency and security in such systems, and allows a variety of useful extensions in functionality without difficulty. This is achieved by a restrictive blind signature protocol in combination with a testing protocol. The restrictive blind signature protocol allows the certifying party to encode data into certified information that it provides to a receiving party, such that it cannot be altered or modified by the receiving party. The testing protocol enables parties to prove a variety of characteristics about the encoded data in their certified information.
Inventors
- 👤 Stefanus A. Brands
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 17:55
CPC Classifications
G; G06; G06Q; G06Q20/00; G06Q20/04; G06Q20/06; G06Q20/38; G06Q20/381; G07; G07F; G07F7/00; G07F7/08; G07F7/10; G07F7/1016; H; H04; H04L; H04L9/00; H04L9/30; H04L9/3006; H04L9/302; H04L9/32; H04L9/3218; H04L9/3247; H04L9/3257; G06F; G06F7/00; G06F7/60; G06F7/72; G06F7/724; G06F7/725; H04L2209/00; H04L2209/42; H04L2209/56
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
245 words
A method for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧1 and each of u 1 , . . . , u k , is a number in a ring, v , where v is a positive number, the method comprising the steps of: generating k numbers, Z 1 , . . . , Z k , each of which is a number in a group, n *, where n is a product of at least two distinct prime numbers; computing by the first party, A=Z 1 u .sbsp.1 . . . Z k u .sbsp.k u k+1 v , where u k+1 is a number in n *; transmitting by the first party to the second party, a signal representative of A; and demonstrating that the first party has access to a vector of numbers, (a 1 , . . . , a l ; a l+1 ), such that Y 1 a .sbsp.1 . . . Y l a .sbsp.l a l+1 v is equal to a product of powers of numbers in the set, {A, Z 1 , . . . , Z k }, where l≦0 and each of the numbers, Y 1 , . . . , Y l , is a product of powers of numbers in the set, {Z 1 , . . . , Z k }.
Claim 2
Independent Claim
245 words
A method for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧1 and each of u 1 , . . . , u k , is a number in a ring, v , where v is a positive number, the method comprising the steps of: generating k numbers, Z 1 , . . . , Z k , each of which is a number in a group, n *, where n is a product of at least two distinct prime numbers; computing by the first party, A=Z 1 u .sbsp.1 . . . Z k u .sbsp.k u k+1 v , where u k+1 is a number in n *; transmitting by the first party to the second party, a signal representative of A; and demonstrating that the first party has access to a vector of numbers, (a 1 , . . . , a l ; a l+1 ), such that Y 1 a .sbsp.1 . . . Y l a .sbsp.l a l+1 v is equal to a product of powers of numbers in the set, {A, Z 1 , . . . , Z k }, where l≦0 and each of the numbers, Y 1 , . . . , Y l , is a product of powers of numbers in the set, {Z 1 , . . . , Z k }.
Claim 3
Dependent Claim
211 words
A method as in claim 1, wherein the step of demonstrating that the first party has access to the vector of numbers, (a 1 , . . . , a l ; a l+1 ), comprises the steps of: generating by the first party, a vector of substantially random numbers, (b 1 , . . . , b l ; b l+1 ), where b 1 , . . . , b l are numbers in v and b l+1 is a number in n *; computing by the first party, B=Y 1 b .sbsp.l . . . Y l b .sbsp.l b l+1 v ; transmitting by the first party to the second party, a signal representative of B; computing by the first party, l response numbers, r 1 , . . . , r l , in response to a challenge number, c, in v , such that r i =ca i +b i mod v for 1≦i≦l; computing by the first party, a response number, r l+1 , in n *, such that r l+1 =(Π i=1 l Y i ca .sbsp.i +b .sbsp.i div v)·a l+1 c b l+1 ; and transmitting by the first party to the second party, signals representative of the l+1 response numbers.
Claim 4
Independent Claim
219 words
A method for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧2 and each of u 1 , . . . , u k , is a number in a ring, q , where q is a prime number, the method comprising the steps of: generating k numbers, e 1 , . . . , e k , each of which is a number in a group, G q , of order q; computing by the first party, A=e 1 u .sbsp.1 . . . e k u .sbsp.k ; transmitting by the first party to the second party, a signal representative of A; and demonstrating that the first party has access to a vector of numbers, (a 1 , . . . , a l ), such that g 1 a .sbsp.1 . . . g l a .sbsp.l is equal to a product of powers of numbers in the set, {A, e 1 , . . . , e k }, where l≧1 and each of the numbers, g 1 , . . . , g l , is a product of powers of numbers in the set, {e 1 , . . . , e k }.
Claim 5
Independent Claim
219 words
A method for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧2 and each of u 1 , . . . , u k , is a number in a ring, q , where q is a prime number, the method comprising the steps of: generating k numbers, e 1 , . . . , e k , each of which is a number in a group, G q , of order q; computing by the first party, A=e 1 u .sbsp.1 . . . e k u .sbsp.k ; transmitting by the first party to the second party, a signal representative of A; and demonstrating that the first party has access to a vector of numbers, (a 1 , . . . , a l ), such that g 1 a .sbsp.1 . . . g l a .sbsp.l is equal to a product of powers of numbers in the set, {A, e 1 , . . . , e k }, where l≧1 and each of the numbers, g 1 , . . . , g l , is a product of powers of numbers in the set, {e 1 , . . . , e k }.
Claim 6
Dependent Claim
160 words
A method as in claim 3, wherein the step of demonstrating that the first party has access to the vector of numbers, (a 1 , . . . , a l ), comprises the steps of: generating by the first party, a vector of substantially random numbers, (b 1 , . . . , b l ), where b 1 , . . . , b l are numbers in q ; computing by the first party, B=g 1 b .sbsp.1 . . . g l b .sbsp.l ; transmitting by the first party to the second party, a signal representative of B; computing by the first party, l response numbers, r 1 , . . . , r l , in response to a challenge number, c, in q , such that r i =ca i +b i mod q for 1≦i≦l; and providing by the first party to the second party, signals representative of the l response numbers.
Claim 7
Independent Claim
283 words
An apparatus for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧1 and each of u 1 , . . . , u k , is a number in a ring, v , where v is a positive number, the apparatus comprising: first processing means for use by the first party; second processing means for use by the second party; interface means between the first processing means and the second processing means; means for generating k numbers, Z 1 , . . . , Z k , each of which is a number in a group, n *, where n is a product of at least two prime distinct numbers; means within the first processing means for computing A=Z 1 u .sbsp.1 . . . Z k u .sbsp.k u k+1 v , where u k+1 is a number in n *; means within the first processing means for transmitting to the second processing means, a signal representative of A; and means within the first processing means for demonstrating access to a vector of numbers, (a 1 , . . . , a l ; a l+1 ), such that Y 1 a .sbsp.l . . . Y l a .sbsp.l a l+1 v is equal to a product of powers of numbers in the set, {A, Z 1 , . . . , Z k }, where l≧0 and each of the numbers, Y 1 , . . . , Y l , is a product of powers of numbers in the set, {Z 1 , . . . , Z k }.
Claim 8
Independent Claim
283 words
An apparatus for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧1 and each of u 1 , . . . , u k , is a number in a ring, v , where v is a positive number, the apparatus comprising: first processing means for use by the first party; second processing means for use by the second party; interface means between the first processing means and the second processing means; means for generating k numbers, Z 1 , . . . , Z k , each of which is a number in a group, n *, where n is a product of at least two prime distinct numbers; means within the first processing means for computing A=Z 1 u .sbsp.1 . . . Z k u .sbsp.k u k+1 v , where u k+1 is a number in n *; means within the first processing means for transmitting to the second processing means, a signal representative of A; and means within the first processing means for demonstrating access to a vector of numbers, (a 1 , . . . , a l ; a l+1 ), such that Y 1 a .sbsp.l . . . Y l a .sbsp.l a l+1 v is equal to a product of powers of numbers in the set, {A, Z 1 , . . . , Z k }, where l≧0 and each of the numbers, Y 1 , . . . , Y l , is a product of powers of numbers in the set, {Z 1 , . . . , Z k }.
Claim 9
Dependent Claim
201 words
An apparatus as in claim 5, wherein the means within the first processing means for demonstrating that it has access to the vector of numbers, (a 1 , . . . , a l ; a l+1 ), comprises: means for generating a vector of substantially random numbers, (b 1 , . . . , b l ; b l+1 ), where b 1 , . . . , b l are numbers in v and b l+1 is a number in n *; means for computing, B=Y 1 b .sbsp.1 . . . Y l b .sbsp.l b l+1 v ; means for transmitting to the second processing means, a signal representative of B; means for computing l response numbers, r 1 , . . . , r l , in response to a challenge number, c, in v , such that r i =ca i +b i mod v for 1≦i≦l; means for computing a response number, r l+1 , in n *, such that r l+1 =(Π i=1 l Y i ca .sbsp.i +b .sbsp.i div v)·a l+1 c b l+1 ; and means for transmitting to the second processing means, signals representative of the l+1 response numbers.
Claim 10
Independent Claim
257 words
An apparatus for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧2 and each of u 1 , . . . , u k , is a number in a ring, q , where q is a prime number, the apparatus comprising: first processing means for use by the first party; second processing means for use by the second party; interface means between the first processing means and the second processing means; means for generating k numbers, e 1 , . . . , e k , each of which is a number in a group, G q , of order q; means within the first processing means for computing, A=e 1 u .sbsp.1 . . . e k u .sbsp.k ; means within the first processing means for transmitting to the second processing means, a signal representative of A; and means within the first processing means for demonstrating access to a vector of numbers, (a 1 , . . . , a l ), such that g 1 a .sbsp.l . . . g l a .sbsp.l is equal to a product of powers of numbers in the set, {A, e 1 , . . . , e k }, where l≧1 and each of the numbers, g 1 , . . . , g l , is a product of powers of numbers in the set, {e 1 , . . . , e k }.
Claim 11
Independent Claim
257 words
An apparatus for a first party to demonstrate to a second party a property of a vector of numbers, (u 1 , . . . , u k ), where k≧2 and each of u 1 , . . . , u k , is a number in a ring, q , where q is a prime number, the apparatus comprising: first processing means for use by the first party; second processing means for use by the second party; interface means between the first processing means and the second processing means; means for generating k numbers, e 1 , . . . , e k , each of which is a number in a group, G q , of order q; means within the first processing means for computing, A=e 1 u .sbsp.1 . . . e k u .sbsp.k ; means within the first processing means for transmitting to the second processing means, a signal representative of A; and means within the first processing means for demonstrating access to a vector of numbers, (a 1 , . . . , a l ), such that g 1 a .sbsp.l . . . g l a .sbsp.l is equal to a product of powers of numbers in the set, {A, e 1 , . . . , e k }, where l≧1 and each of the numbers, g 1 , . . . , g l , is a product of powers of numbers in the set, {e 1 , . . . , e k }.
Claim 12
Dependent Claim
154 words
An apparatus as in claim 7, wherein the means within the first processing means for demonstrating to the second processing means access to the vector of numbers, (a 1 , . . . , a l ), comprises: means for generating a vector of substantially random numbers, (b 1 , . . . , b l ), where b 1 , . . . , b l are numbers in q ; means for computing, B=g 1 b .sbsp.1 . . . g l b .sbsp.l ; means for transmitting to the second processing means, a signal representative of B; means for computing l response numbers, r 1 , . . . , r l , in response to a challenge number, c, in q , such that r i =ca i +b i mod q for 1≦i≦l; and means for transmitting to the second processing means, signals representative of the l response numbers.
References Cited (Backward Citations)
US4529870A
Cited
US4759063A
Cited
US4926480A
Cited
US4759064A
Cited
US4868877A
Cited
US5005200A
Cited
US5214702A
Cited
US4914698A
Cited
US4949380A
Cited
US5483597A
Cited
US5521980A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-02-18 | 2000-08-19 | 2001-02-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-02-18 | 2004-08-19 | 2005-02-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-02-18 | 2008-08-19 | 2009-02-18 | $7700.00 | Window Closed / Lapsed |