Patent ID: 8750520

Claim:
A method for proving, by a prover system, a security policy to an interrogator system, wherein the security policy is described by a graph G 1 of the prover system described by a graph G 2 , the method comprising: receiving a query from the interrogator system; generating attestation data based on results of the query, wherein the attestation data comprises graph F 1 comprising a permutation of graph G 1 , and graph F 2 comprising a permutation of graph G 2 , wherein G 1 is a subgraph of G 2 ; transmitting the attestation data to the interrogator system; encrypting the edges of graphs G 1 and G 2 by labeling each vertex of graphs G 1 and G 2 with random numbers, representing each edge as a pair of vertices, and encrypting each edge with a different encryption key; receiving a request from the interrogator system of a proof of a property between two or more of G 1 , G 2 , F 1 , and F 2 , wherein the proof is an NP-complete problem; and providing the proof of the property to the interrogator.