Relational encryption for password verification

US10129028B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10129028-B2
Application numberUS-201615040959-A
CountryUS
Kind codeB2
Filing dateFeb 10, 2016
Priority dateJul 13, 2015
Publication dateNov 13, 2018
Grant dateNov 13, 2018

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method of equality verification using relational encryption including receiving a relational key that includes a first relational key component and a registration ciphertext that includes an encryption of a first plaintext data set. The method includes storing the registration ciphertext without decrypting the registration ciphertext. After the storing of the registration ciphertext, the method includes receiving an authentication request and communicating a safeguard data set that includes a random challenge in response to the authentication request. The method includes receiving an encrypted response that is generated based on the safeguard data set and a second plaintext data set. The method includes verifying a relationship between the encrypted response and the registration ciphertext using the relational key without decrypting the encrypted response and without decrypting the registration ciphertext. The relationship indicates that equality exists between the first and the second plaintext data sets.

First claim

Opening claim text (preview).

What is claimed is: 1. A method of equality verification using relational encryption, the method comprising: receiving, from a trusted entity server, a relational key that includes a first relational key component; receiving, from a user computing system, a registration ciphertext that includes an encryption of a first plaintext data set; storing, in a non-transitory computer-readable storage medium, the registration ciphertext without decrypting the registration ciphertext; after the storing of the registration ciphertext, receiving, from the user computing system, an authentication request; in response to the authentication request, communicating a safeguard data set that includes a random challenge to the user computing system; receiving, from the user computing system, an encrypted response that is generated based at least partially on the safeguard data set and a second plaintext data set; verifying, by each of a plurality of authentication servers, a relationship between the encrypted response and the registration ciphertext using the relational key without decrypting the encrypted response and without decrypting the registration ciphertext, the relationship indicating that equality exists between the first plaintext data set and the second plaintext data set; communicating to the user computing system from one of the plurality of authentication servers an authentication signal indicative of whether there is equality between the first and second plaintext data sets in a case in which a combination of a first verification key assigned to the user computing system and a second verification key assigned to the one of the plurality of authentication servers permits access to a result of the verifying, and not communicating the authenticating signal to the user computing system in a case in which the combination of the first and second verification keys denies access to the result of the verifying, regardless of whether the authentication signal indicates that there is equality between the first and second plaintext data sets; and receiving, from the trusted entity server, a public key set that includes a first public key, a second public key, a public hash key of a hash function, and the hash function, wherein: the relational key further includes a secret hash key of the hash function, and the encrypted response is further based on one or more public hash key elements of the public hash key and a random test sample data set. 2. The method as claimed in claim 1 , further comprising: receiving, from the trusted entity server, the first verification key by the user computing system; and receiving, from the trusted entity server, the second verification key. 3. The method as claimed in claim 1 , wherein each of the first plaintext data set and the second plaintext data set includes a combination of a plurality of data items, or a plurality of segments of a single data item. 4. The method as claimed in claim 1 , wherein each of the first plaintext data set and the second plaintext data set is one of medical and biological information, technical information, and financial information. 5. The method as claimed in claim 4 , wherein the medical and biological information includes one of clinical data, health data, and genome data. 6. A non-transitory computer-readable medium having encoded therein programming code executable by one or a plurality of processors to perform or control performance of operations comprising: receiving, from a trusted entity server, a relational key that includes a first relational key component; receiving, from a user computing system, a registration ciphertext that includes an encryption of a first plaintext data set; storing, in a non-transitory computer-readable storage media, the registration ciphertext without decrypting the registration ciphertext; after the storing of the registration ciphertext, receiving, from the user computing system, an authentication request; in response to the authentication request, communicating a safeguard data set that includes a random challenge to the user computing system; receiving, from the user computing system, an encrypted response that is generated based at least partially on the safeguard data set and a second plaintext data set; verifying a relationship between the encrypted response and the registration ciphertext using the relational key without decrypting the encrypted response and without decrypting the registration ciphertext, the relationship indicating that equality exists between the first plaintext data set and the second plaintext data set; communicating to the user computing system an authentication signal indicative of whether there is equality between the first and second plaintext data sets in a case in which a combination of a first verification key assigned to the user computing system and a second verification key assigned to one of the plurality of processors permits access to a result of the verifying, and not communicating the authenticating signal to the user computing system in a case in which the combination of the first and second verification keys denies access to the result of the verifying, regardless of whether the authentication signal indicates that there is equality between the first and second plaintext data sets; and receiving, from the trusted entity server, a public key set that includes a first public key, a second public key, a public hash key of a hash function, and the hash function, wherein: the relational key further includes a secret hash key of the hash function, and the encrypted response is further based on one or more public hash key elements of the public hash key and a random test sample data set. 7. The non-transitory computer-readable medium as claimed in claim 6 , wherein the operations further comprise: receiving the first and second verification keys from the trusted entity server. 8. The non-transitory computer-readable medium as claimed in claim 6 , wherein each of the first plaintext data set and the second plaintext data set includes a combination of a plurality of data items, or a plurality of segments of a single data item. 9. The non-transitory computer-readable medium as claimed in claim 6 , wherein each of the first plaintext data set and the second plaintext data set is one of medical and biological information, technical information, and financial information. 10. The non-transitory computer-readable medium as claimed in claim 9 , wherein the medical and biological information includes one of clinical data, health data, and genome data. 11. A method of equality verification of medical and biological information using relational encryption, the method comprising: receiving, from a trusted entity server, a relational key that includes a first relational key component; receiving, from a user computing system, a registration ciphertext that includes an encryption of a first plaintext data set related to medical and biological information; storing, in a non-transitory computer-readable storage medium, the registration ciphertext without decrypting the registration ciphertext; after the storing of the registration ciphertext, receiving, from the user computing system, an authentication request; in response to the authentication request, communicating a safeguard data set that includes a random challenge to the user computing system; receiving, from the user computing system, an encrypted response that is generated based at least partially on the safeguard data set and a second plaintext data set related to medical and biological information; verifying, by each of a plurality of processors, a relationship between the encrypted response a

Assignees

Inventors

Classifications

  • using challenge-response · CPC title

  • using biometrical features, e.g. fingerprint, retina-scan (cryptographic mechanisms or cryptographic arrangements for entity authentication using biological data H04L9/3231) · CPC title

  • involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC · CPC title

  • for authentication of entities (cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32) · CPC title

  • Biological data, e.g. fingerprint, voice or retina (network architectures or network communication protocols for supporting authentication of entities using biometrical features in a packet data network H04L63/0861) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10129028B2 cover?
A method of equality verification using relational encryption including receiving a relational key that includes a first relational key component and a registration ciphertext that includes an encryption of a first plaintext data set. The method includes storing the registration ciphertext without decrypting the registration ciphertext. After the storing of the registration ciphertext, the meth…
Who is the assignee on this patent?
Fujitsu Ltd
What technology area does this patent fall under?
Primary CPC classification H04L9/321. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Nov 13 2018 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).