We consider cubic graphs formed with k ≥ 2 disjoint claws Ci ∼ K1,3 (0 ≤ i ≤ k−1) such that for every integer i modulo k the three vertices of degree 1 of Ci are joined to the three vertices of degree 1 of Ci−1 and joined to the three vertices of degree 1 of Ci+1. Denote by ti the vertex of degree 3 of Ci and by T the set {t1, t2, ..., tk−1}. In such a way we construct three distinct graphs, na...

Biometric identification is a convenient and reliable method in identity authentication. The widespread adoption of biometric requires strong privacy protection against possible theft or loss data. Existing techniques for privacy-preserving mainly rely on traditional cryptographic technology such as oblivious transfer homomorphic encryption, which will incur huge expenses to the system cannot b...

Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often be hand-tuned to answer queries with reasonable performance in practice. Appealing to previous theoretical work on partition-based reasoning, we propose resolutionbased theorem proving strategies that exploit the structur...

Despite evidence that the crucial role of NUAK family, SNF1-like kinase, 2 [NUAK2; also known as sucrose non-fermenting 1 (SNF1)-like kinase (SNARK)], has been highlighted in cancer development and in tumor progression, to the best of our knowledge, there are no studies available to date on the role of NUAK2 in glioblastoma. Thus, in this study, in order to determine the role of NUAK2 in gliobl...

This paper describes a case study of relation derivation within the context of situation awareness. First we present a scenario in which inputs are supplied by a simulated Level 1 system. The inputs are events annotated with terms from an ontology for situation awareness. This ontology contains concepts used to represent and reason about situations. The ontology and the annotations of events ar...

We design and build a system that enables clients to verify the outputs of programs executed by untrusted servers. A server provides a succinct non-interactive zero-knowledge proof (also known as a zk-SNARK), which the client verifies to ascertain correct execution. The system has two components: a cryptographic proof system for verifying satisfiability of arithmetic circuits, and a circuit gen...

New research allows construction of SNARK’s from lattice-based primitives, instead of pairings-based cryptography [BISW17]. We implement a proposed construction in libsnark, a popular existing zkSNARK library, using a quadratic arithmetic program representation and a ’crypto compiler’ based on an extension of standard Regev encryption [Reg05] into a linear-only vector encryption scheme [PVW08]....