Zero knowledge proofs for arbitrary predicates over data
US8731199B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 28, 2012 |
| Grant date | May 20, 2014 |
| Priority date | — |
| Expiry date | Jan 29, 2033 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY04S40/20
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A first computing device transfers first and second commitments to a second computing device. The first commitment is for private data and a first random number and the second commitment is for second and third random numbers. The method includes producing a result by evaluating a predicate and a first support function of a garbled circuit. The result includes a first part and a second part, referred to as the predicate result. The method includes transferring the result to the second computing device; receiving a second challenge from the second computing device; and producing a second response from a second support function using the second challenge. The method includes transferring the second response to the second computing device. The predicate result over the private data is true if a result of a check function is equal to a third commitment of the first part and the second response.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.