Lacan: Making Accountability in Anonymous Networks Real

• URL: http://arxiv.org/abs/2609.01075v1
• Date: Tue, 01 Sep 2026 11:04:40 GMT
• Title: Lacan: Making Accountability in Anonymous Networks Real
• Abstract summary: We propose Lacan, a protocol that reconciles anonymity and accountability within a realistic design.<n>In Lacan, a sender enjoys anonymity provided by on-path relays, as long as she complies with a contract established with the receiver.<n>We analyze the anonymity and accountability, implement the protocol, and evaluate the performance.
• Score: 5.4954641673299145
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Anonymity and accountability are essential properties for our everyday activity on the Internet. However, they appear contradictory, and their reconciliation remains far from reality. Existing approaches fall short in this regard, as they either rely on an on-path trustee, per-packet authorization, per-packet public-key cryptography, or per-session intervention by a central authority. We propose Lacan, a protocol that reconciles anonymity and accountability within a realistic design. In Lacan, a sender enjoys anonymity provided by on-path relays, as long as she complies with a contract established with the receiver. Upon a contract violation, the verifier, an off-path trustee on behalf of the receiver, links the malicious message to the sender's identity indirectly via the packet, path, and session, thereby reducing public-key operations from per-packet to per-session. This linkage remains robust even against malicious relays and receivers, grounded in our novel chain of successor proofs for accountable path reconstruction, together with traceable signatures, path validation, and key-committing encryption. We analyze the anonymity and accountability, implement the protocol, and evaluate the performance.

Related papers

• Stealing Reasoning Traces from Proprietary LLM APIs [84.58379404903394]
  We develop a scalable decryption jailbreak for encrypted reasoning traces.<n>It circumvents anti-distillation mechanisms, allowing adversaries to extract a proprietary model's reasoning.<n>It inadvertently reveals hazardous information hidden within the reasoning process.
  arXiv  Detail & Related papers  (2026-08-10T17:24:50Z)
• Agent Security Needs Redefinition through a Holistic Framework [46.88917910966891]
  Defenses ask whether an instruction looks malicious. Benchmarks ask whether an agent performs a harmful sounding action.<n>We operationalize contextual security through four properties that must hold jointly and be evaluated continuously across the agent's trajectory.
  arXiv  Detail & Related papers  (2026-07-24T06:43:09Z)
• Semantic Leakage and Privacy Preservation in Relay-Assisted Semantic Communications [49.494000480610225]
  Semantic communication (SemCom) has emerged as a promising paradigm in which the transmission of task-relevant information is prioritized over raw data.<n>In this paper, the privacy implications of relay-assisted SemCom systems are studied, where the intermediate relay node operates directly on learned latent representations.<n>An adversarial training framework is proposed in which a strong, adaptively trained eavesdropper at the relay is explicitly accounted for.
  arXiv  Detail & Related papers  (2026-06-30T17:15:23Z)
• Privacy-Preserving Compliance on Public Ledgers via Selective Disclosure Authorization Schemes [9.133320151595084]
  We develop a cryptographic primitive for granular and revocable compliance checks on public ledgers without revealing the underlying witness.<n>We implement the sender-binding component using a 14-constraint Circom circuit that anchors the zero-knowledge proof to the executing on-chain address.<n>Our Sepolia evaluation confirms practical viability: browser-based proof generation executes in under 200 ms, and on-chain verification costs 240,512 gas, neutralizing proof reuse by different callers while preserving strict attribute privacy.
  arXiv  Detail & Related papers  (2026-06-18T09:38:13Z)
• A Privacy Protocol Using Ephemeral Intermediaries and a Rank-Deficient Matrix Power Function (RDMPF) [0.0]
  This paper presents a private transfer architecture for the Internet Computer (ICP)<n>It decouples deposit and retrieval through two short-lived intermediaries, with sealed storage and attested by an ephemeral witness.<n>The protocol uses a non-interactive RDMPF-based encapsulation to derive per-transfer transport keys.
  arXiv  Detail & Related papers  (2025-12-29T15:19:09Z)
• Binding Agent ID: Unleashing the Power of AI Agents with accountability and credibility [46.323590135279126]
  BAID (Binding Agent ID) is a comprehensive identity infrastructure establishing verifiable user-code binding.<n>We implement and evaluate a complete prototype system, demonstrating the practical feasibility of blockchain-based identity management and zkVM-based authentication protocol.
  arXiv  Detail & Related papers  (2025-12-19T13:01:54Z)
• Malice in Agentland: Down the Rabbit Hole of Backdoors in the AI Supply Chain [82.98626829232899]
  Fine-tuning AI agents on data from their own interactions introduces a critical security vulnerability within the AI supply chain.<n>We show that adversaries can easily poison the data collection pipeline to embed hard-to-detect backdoors.
  arXiv  Detail & Related papers  (2025-10-03T12:47:21Z)
• EFPIX: A zero-trust encrypted flood protocol [0.0]
  We propose a flood-based relay communication protocol that achieves end-to-end encryption, plausible deniability for users, and untraceable messages.
  arXiv  Detail & Related papers  (2025-09-10T03:06:42Z)
• A Provably Secure Network Protocol for Private Communication with Analysis and Tracing Resistance [24.74468505942983]
  This paper proposes a novel decentralized anonymous routing protocol with resistance to tracing and traffic analysis.<n>It rigorously proves indistinguishable identity privacy for users even in highly adversarial environments.<n>The proposed protocol offers a provably secure solution for privacy-preserving communication in digital environments.
  arXiv  Detail & Related papers  (2025-08-03T10:50:04Z)
• Attacking and Improving the Tor Directory Protocol [14.733204402684215]
  The Tor network enhances clients' privacy by routing traffic through an overlay network of volunteered intermediate relays.<n>The protocol is expected to be secure even when a minority of those authorities get compromised.<n>The current consensus protocol is flawed, allowing only a single compromised authority to create a valid consensus document with malicious relays.
  arXiv  Detail & Related papers  (2025-03-24T05:04:41Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.