Institution profile

CSIRO

Academic institutionaustralasia · au
Official website
Research library674linked papers
Opportunities0open roles
Selected work

Representative Papers

Blockchain-enabled decentralized privacy-preserving group purchasing for retail energy plans

Jun 28, 2022Energy-Efficient Computing and Networking

In traditional retail energy markets, group purchasing reliant on trusted third parties suffers from privacy leakage and insufficient transparency. This paper proposes a decentralized, privacy-preserving group purchasing mechanism that integrates Ethereum blockchain with secure multi-party computation (SMPC). Users collaboratively evaluate energy plans and jointly determine optimal supplier switching without revealing private consumption data. We design a publicly verifiable smart contract—implemented in Solidity—that ensures fraud resistance, fair cost allocation, and mutual compensation. Our approach establishes the first group-purchasing paradigm characterized by *no trusted third party*, *zero data leakage*, and *verifiable decision-making*. Empirical deployment demonstrates that the mechanism simultaneously preserves user privacy and significantly improves collective economic benefits and decision-making efficiency.

7 citationsRead paper

A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract)

Nov 04, 2019The Art of Modelling Computational Systems

This paper addresses the challenge of axiomatizing behavioral equivalence for process languages featuring both nondeterministic and probabilistic choice. We introduce the first sound and complete equational axiomatization for branching bisimilarity and its rooted variant—rooted branching probabilistic bisimilarity. Our method integrates structural operational semantics with probabilistic concurrency models to construct an equational proof system that supports mechanical verification of probabilistic behavioral equivalence. The key contribution is the first complete characterization of branching bisimulation for a basic, recursion-free process language with probabilistic choice—overcoming a longstanding limitation of classical process algebraic axiomatizations, which traditionally cannot accommodate probabilistic choice. This work bridges the theoretical gap between probabilistic semantics and standard axiomatic methods, thereby establishing a formal foundation for equivalence analysis in probabilistic concurrent systems.

5 citations1 influentialRead paper

Too Helpful to Be Safe: User-Mediated Attacks on Planning and Web-Use Agents

Jan 14, 2026arXiv.org

This work addresses a critical vulnerability in large language model (LLM) agents: their susceptibility to adversarial attacks when users inadvertently relay manipulated content. Existing defenses struggle to mitigate such user-mediated context manipulation. The paper introduces the User-Relayed Context Manipulation (UReCoM) attack paradigm, which systematically demonstrates how attackers can exploit users as unwitting channels by embedding malicious entities—such as promotional codes—into task requests, thereby bypassing state-of-the-art defenses like Sandwich, StruQ, and SecAlign. Experiments across twelve commercial LLM agents show that UReCoM substantially outperforms five categories of baseline attacks, revealing a fundamental gap in current systems’ lack of default safety validation for task-specific entities and underscoring the urgent need for entity-level security mechanisms.

3 citationsRead paper

A Case Study on Evaluating Encodings Between Process Calculi

Feb 12, 2025

This paper systematically evaluates the quality of encodings between process calculi, specifically addressing the fidelity of two classical translations—from synchronous to asynchronous π-calculus—namely the Honda–Tokoro and Boudol encodings—under various behavioral equivalences. Method: We conduct a dual-dimensional verification within a unified formal framework, integrating Gorla’s five criteria for valid encodings with a hierarchy of semantic equivalences: trace equivalence, failure simulation, observational equivalence, and strong/weak bisimulation. Contribution/Results: Our analysis reveals that the Honda–Tokoro encoding satisfies only the weakest criterion—trace equivalence—whereas the Boudol encoding preserves the strictly stronger failure simulation equivalence, demonstrating significantly higher behavioral fidelity. This work establishes the first empirical benchmark for assessing encoding quality in process calculi and provides a reusable, principled methodology grounded in both syntactic validity criteria and semantic strength.

2 citationsRead paper

Adaptive Rank, Reduced Forgetting: Knowledge Retention in Continual Learning Vision-Language Models with Dynamic Rank-Selective LoRA

Dec 01, 2024arXiv.org

To address catastrophic forgetting in continual learning of vision-language models (VLMs), this paper proposes a dynamic-rank LoRA method that requires no reference data and modifies neither the inference architecture nor pretrained weights. The method incrementally integrates new knowledge via low-rank updates while actively enhancing—rather than degrading—pretrained semantic capabilities. Its core contributions are: (1) the first module-level importance estimation mechanism that adaptively allocates LoRA ranks to jointly optimize plasticity and stability; and (2) a reference-free, unsupervised task-boundary awareness capability. Evaluated on multiple VLM continual learning benchmarks, it achieves state-of-the-art performance: average zero-shot transfer accuracy improves by 2.3%, task-sequence accuracy decay decreases by 67%, and inference overhead remains zero.

2 citationsRead paper
Recent publications

Latest Papers