Name
Affiliation
Papers
CHEN YUAN
Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore
35
Collaborators
Citations 
PageRank 
58
27
12.30
Referers 
Referees 
References 
67
215
104
Search Limit
100215
Title
Citations
PageRank
Year
More Efficient Dishonest Majority Secure Computation over ℤ 2 k via Galois Rings.00.342022
A Novel Multiserver Authentication Scheme Using Proxy Resignature With Scalability and Strong User Anonymity20.362021
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.00.342020
Graph Computing-Based WLS Fast Decoupled State Estimation00.342020
Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences.00.342020
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex00.342020
A Novel Graph-Based Energy Management System00.342020
Substation One-Line Diagram Automatic Generation and Visualization.00.342019
Towards optimal robust secret sharing with security against a rushing adversary.00.342019
An Optimal Travel Route Recommendation System for Tourists' First Visit to Japan.00.342019
pH Watch - Leveraging Pulse Oximeters in Existing Wearables for Reusable, Real-time Monitoring of pH in Sweat00.342019
Improved Building Blocks for Secure Multi-Party Computation based on Secret Sharing with Honest Majority.00.342019
Enabling Model-Based Lti For Large-Scale Power System Security Monitoring And Enhancement With Graph-Computing-Based Power Flow Calculation00.342019
On the Complexity of Arithmetic Secret Sharing.00.342019
Graph Computing based Distributed Fast Decoupled Power Flow Analysis.00.342019
Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries.00.342019
Exploration of Bi-Level PageRank Algorithm for Power Flow Analysis Using Graph Database00.342018
Amortized Complexity of Information-Theoretically Secure MPC Revisited.00.342018
A Multi-Dimensional Hyperspectral Image Mosaic Method and its Acquisition System.00.342018
List Decoding of Cover Metric Codes Up to the Singleton Bound.00.342018
Construction of optimal locally recoverable codes and connection with hypergraph.10.352018
List Decodability of Symbol-Pair Codes.10.352018
Power Flow Analysis Using Graph Based Combination Of Iterative Methods And Vertex Contraction Approach00.342018
How Long Can Optimal Locally Repairable Codes Be50.422018
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes100.522018
Multi-Party Oblivious RAM based on Function Secret Sharing and Replicated Secret Sharing Arithmetic.00.342018
Subspace Designs based on Algebraic Function Fields.10.352017
An Efficient and Provably Secure Certificateless Key Insulated Encryption with Applications to Mobile Internet.10.352017
List Decodability of Random Subcodes of Gabidulin Codes.20.412017
Linear Tail-Biting Trellis and Its Sectionalization.00.342017
Enabling Telecare Medical Information Systems With Strong Authentication and Anonymity.30.382017
Tunable, a VR reconstruction of "Listening to a Guqin" from emperor Zhao Ji.00.342016
On Multi-Point Local Decoding of Reed-Muller Codes.10.362016
Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes00.342015
A new class of rank-metric codes and their list decoding beyond the unique decoding radius.00.342015