Search Results for author: Yibin Xu

Found 5 papers, 1 papers with code

Privacy-Preserving UCB Decision Process Verification via zk-SNARKs

no code implementations18 Apr 2024 Xikun Jiang, He Lyu, Chenhao Ying, Yibin Xu, Boris Düdder, Yuan Luo

With the increasingly widespread application of machine learning, how to strike a balance between protecting the privacy of data and algorithm parameters and ensuring the verifiability of machine learning has always been a challenge.

Decision Making Privacy Preserving +2

THG: Transformer with Hyperbolic Geometry

no code implementations1 Jun 2021 Zhe Liu, Yibin Xu

In this work, we propose a novel Transformer with Hyperbolic Geometry (THG) model, which take the advantage of both Euclidean space and Hyperbolic space.

Machine Reading Comprehension

Global Context-enhanced Graph Convolutional Networks for Document-level Relation Extraction

1 code implementation COLING 2020 Huiwei Zhou, Yibin Xu, Weihong Yao, Zhe Liu, Chengkun Lang, Haibin Jiang

In this paper, we propose Global Context-enhanced Graph Convolutional Networks (GCGCN), a novel model which is composed of entities as nodes and context of entity pairs as edges between nodes to capture rich global context information of entities in a document.

Document-level Relation Extraction Relation

A $p/2$ Adversary Power Resistant Blockchain Sharding Approach

no code implementations9 Apr 2020 Yibin Xu, Yangyu Huang, Jianhua Shao, George Theodorakopoulos

First, in a non-sharding blockchain, nodes can have different weight (power or stake) to create a consensus, and as such an adversary needs to control half of the overall weight in order to manipulate the system ($p/2$ security level).

Distributed, Parallel, and Cluster Computing Cryptography and Security

An n/2 Byzantine node tolerate Blockchain Sharding approach

no code implementations15 Jan 2020 Yibin Xu, Yangyu Huang

Traditional Blockchain Sharding approaches can only tolerate up to n/3 of nodes being adversary because they rely on the hypergeometric distribution to make a failure (an adversary does not have n/3 of nodes globally but can manipulate the consensus of a Shard) hard to happen.

Cryptography and Security Distributed, Parallel, and Cluster Computing 68M12

Cannot find the paper you are looking for? You can Submit a new open access paper.