We introduce a new cryptographic scheme, Witness Key Agreement (WKA), that allows party to securely agree on secret key with counter holding publicly committed information only if the also owns witness in desired (arithmetic) relation information. Our motivating applications are over-the-counter (OTC) markets and dark pools, popular trading mechanisms. In such pools investors wish communicate p...

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...

In this work we study the feasibility of knowledge extraction for succinct non-interactive arguments of knowledge (SNARKs) in a scenario that, to the best of our knowledge, has not been analyzed before. While prior work focuses on the case of adversarial provers that may receive (statically generated) auxiliary information, here we consider the scenario where adversarial provers are given acces...

We introduce weak oddness ωw, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph G, %(G) ≤ ωw(G) ≤ ω(G), where %(G) denotes the resistance of G and ω(G) denotes the oddness of G, so this new measure is an approximation of both oddness and resistance. We demonstrate that there are graphs G satisfying...

While much health data is available online, patients who are not technically astute may be unable to access it because they may not know the relevant resources, they may be reluctant to confront an unfamiliar interface, and they may not know how to compose an answer from information provided by multiple heterogeneous resources. We describe ongoing research in using natural English text queries ...

A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance hypohamiltonian, leaf-stable, and maximally non-hamiltonian graphs. In this paper, we first investigate cubic platypus graphs, covering all orders for which such...

An embedding of a 3-regular graph in a surface is called polyhedral if its dual is a simple graph. An old graph-coloring conjecture is that every 3-regular graph with a polyhedral embedding in an orientable surface has a 3-edge-coloring. An affirmative solution of this problem would generalize the dual form of the Four Color Theorem to every orientable surface. In this paper we present a negati...

Skeletal muscle is the major tissue for the increased glucose disposal caused by insulin or exercise. Each stimulus elevates GLUT4 glucose transporter translocation to skeletal muscle’s cell surface membranes, but distinct signalling pathways lead to this common outcome. Insulin’s proximal signalling events include activation of the insulin receptor, phosphatidylinositol 3-kinase, and Akt2. The...

SNAP (Standar Nasional OPEN API Pembayaran) is an implementation of open banking for encouraging digital transformation in the industry. was submitted by several sub-working groups formed jointly ASPI and Bank Indonesia. In document Pedoman Tata Kelola (Bank Indonesia, n.d.), there already a customer data protection mechanism between bank, owner Open API, user API. However, no process carried o...