activity
20102026
most citedOn Binary de Bruijn Sequences from LFSRs with Arbitrary Characteristic Polynomials

19 citations · 55 across the 24 of their papers we have counts for

collaborators

27 papers

cs.LG2026

A Robust Watermark-based Fingerprint Framework for GNNs Ownership Verification

Han Zhang, Yan Wang, Guanfeng Liu +3

The high training cost of Graph Neural Networks (GNNs) has raised growing concerns regarding model ownership infringement, such as model stealing and unauthorized misuse. To verify…

cs.CR2026

Operationalising Post Quantum TLS Automated Configuration Profiling and Hybrid PQC Deployment in Financial Infrastructure

Harish Balaji, Aarav Varshney, Prasanna Ravi +6

Organisations are upgrading their cryptographic infrastructure to become quantum safe before large scale quantum computers materialise. Post quantum cryptography (PQC) standards no…

cs.IT2023

Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes

Stanislav Kruglik, Gaojun Luo, Wilton Kim +4

We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we co…

cs.IT2023★ 1 cited

-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File Size

Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah +1

We consider the problem of designing a Private Information Retrieval (PIR) scheme on files replicated on servers that can collude or, even worse, can return incorrect answe…

cs.IT2023★ 1 cited

Two-Server Private Information Retrieval with Optimized Download Rate and Result Verification

Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah +1

Private Information Retrieval (PIR) schemes allow a client to retrieve any file of interest, while hiding the file identity from the database servers. In contrast to most existing…

cs.IT2022

Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols

Han Mao Kiah, Wilton Kim, Stanislav Kruglik +2

Motivated by applications in distributed storage, distributed computing, and homomorphic secret sharing, we study communication-efficient schemes for computing linear combinations…