Oblivious Digital Tokens

• URL: http://arxiv.org/abs/2503.03494v1
• Date: Wed, 05 Mar 2025 13:34:31 GMT
• Title: Oblivious Digital Tokens
• Authors: Mihael Liskij, Xuhua Ding, Gene Tsudik, David Basin,
• Abstract summary: A computing device typically identifies itself by exhibiting unique measurable behavior or by proving its knowledge of a secret.<n>We show how this problem naturally arises in the context of digital emblems, which were recently proposed by the International Committee of the Red Cross to protect digital resources during cyber-conflicts.<n>To address this new and important open problem, we define a new primitive, called an Oblivious Digital Token (ODT) that can be verified obliviously.
• Score: 11.423326973456438
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A computing device typically identifies itself by exhibiting unique measurable behavior or by proving its knowledge of a secret. In both cases, the identifying device must reveal information to a verifier. Considerable research has focused on protecting identifying entities (provers) and reducing the amount of leaked data. However, little has been done to conceal the fact that the verification occurred. We show how this problem naturally arises in the context of digital emblems, which were recently proposed by the International Committee of the Red Cross to protect digital resources during cyber-conflicts. To address this new and important open problem, we define a new primitive, called an Oblivious Digital Token (ODT) that can be verified obliviously. Verifiers can use this procedure to check whether a device has an ODT without revealing to any other parties (including the device itself) that this check occurred. We demonstrate the feasibility of ODTs and present a concrete construction that provably meets the ODT security requirements, even if the prover device's software is fully compromised. We also implement a prototype of the proposed construction and evaluate its performance, thereby confirming its practicality.

Related papers

• To See or Not to See -- Fingerprinting Devices in Adversarial Environments Amid Advanced Machine Learning [0.725130576615102]
  Device fingerprinting is often employed to authenticate devices, detect adversaries, and identify eavesdroppers in an environment. This requires the ability to discern between legitimate and malicious devices. We propose a generic, yet simplified, model for device fingerprinting.
  arXiv  Detail & Related papers  (2025-04-11T05:40:47Z)
• Towards Copyright Protection for Knowledge Bases of Retrieval-augmented Language Models via Ownership Verification with Reasoning [58.57194301645823]
  Large language models (LLMs) are increasingly integrated into real-world applications through retrieval-augmented generation (RAG) mechanisms.<n>Existing methods that can be generalized as watermarking techniques to protect these knowledge bases typically involve poisoning attacks.<n>We propose name for harmless' copyright protection of knowledge bases.
  arXiv  Detail & Related papers  (2025-02-10T09:15:56Z)
• Seamless Detection: Unifying Salient Object Detection and Camouflaged Object Detection [73.85890512959861]
  We propose a task-agnostic framework to unify Salient Object Detection (SOD) and Camouflaged Object Detection (COD)<n>We design a simple yet effective contextual decoder involving the interval-layer and global context, which achieves an inference speed of 67 fps.<n> Experiments on public SOD and COD datasets demonstrate the superiority of our proposed framework in both supervised and unsupervised settings.
  arXiv  Detail & Related papers  (2024-12-22T03:25:43Z)
• Semi-supervised Open-World Object Detection [74.95267079505145]
  We introduce a more realistic formulation, named semi-supervised open-world detection (SS-OWOD) We demonstrate that the performance of the state-of-the-art OWOD detector dramatically deteriorates in the proposed SS-OWOD setting. Our experiments on 4 datasets including MS COCO, PASCAL, Objects365 and DOTA demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2024-02-25T07:12:51Z)
• Domain-Agnostic Hardware Fingerprinting-Based Device Identifier for Zero-Trust IoT Security [7.8344795632171325]
  Next-generation networks aim for comprehensive connectivity, interconnecting humans, machines, devices, and systems seamlessly. To address this challenge, the Zero Trust (ZT) paradigm emerges as a key method for safeguarding network integrity and data confidentiality. This work introduces EPS-CNN, a novel deep-learning-based wireless device identification framework.
  arXiv  Detail & Related papers  (2024-02-08T00:23:42Z)
• Part Representation Learning with Teacher-Student Decoder for Occluded Person Re-identification [65.63180725319906]
  We propose a Teacher-Student Decoder (TSD) framework for occluded person ReID. Our proposed TSD consists of a Parsing-aware Teacher Decoder (PTD) and a Standard Student Decoder (SSD)
  arXiv  Detail & Related papers  (2023-12-15T13:54:48Z)
• On the Robustness of Dataset Inference [21.321310557323383]
  Machine learning (ML) models are costly to train as they can require a significant amount of data, computational resources and technical expertise. Ownership verification techniques allow the victims of model stealing attacks to demonstrate that a suspect model was in fact stolen from theirs. A fingerprinting technique, dataset inference (DI), has been shown to offer better robustness and efficiency than prior methods.
  arXiv  Detail & Related papers  (2022-10-24T22:17:55Z)
• Fact-Saboteurs: A Taxonomy of Evidence Manipulation Attacks against Fact-Verification Systems [80.3811072650087]
  We show that it is possible to subtly modify claim-salient snippets in the evidence and generate diverse and claim-aligned evidence. The attacks are also robust against post-hoc modifications of the claim. These attacks can have harmful implications on the inspectable and human-in-the-loop usage scenarios.
  arXiv  Detail & Related papers  (2022-09-07T13:39:24Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Synthetic Disinformation Attacks on Automated Fact Verification Systems [53.011635547834025]
  We explore the sensitivity of automated fact-checkers to synthetic adversarial evidence in two simulated settings. We show that these systems suffer significant performance drops against these attacks. We discuss the growing threat of modern NLG systems as generators of disinformation.
  arXiv  Detail & Related papers  (2022-02-18T19:01:01Z)
• The case for Zero Trust Digital Forensics [8.096180040270454]
  Erroneously treating features of an investigation as trusted can be damaging to the overall reliability of an investigations findings. A new approach to digital forensics is considered based on the concept of Zero Trust. Zero Trust describes the practitioner mindset and principles upon which the reliance on trust in network components is eliminated.
  arXiv  Detail & Related papers  (2022-02-05T19:54:57Z)
• Machine Learning for the Detection and Identification of Internet of Things (IoT) Devices: A Survey [16.3730669259576]
  The Internet of Things (IoT) is becoming an indispensable part of everyday life, enabling a variety of emerging services and applications. The first step in securing the IoT is detecting rogue IoT devices and identifying legitimate ones. We classify the IoT device identification and detection into four categories: device-specific pattern recognition, Deep Learning enabled device identification, unsupervised device identification, and abnormal device detection.
  arXiv  Detail & Related papers  (2021-01-25T15:51:04Z)
• When Physical Unclonable Function Meets Biometrics [0.5156484100374058]
  Electrocardiogram (ECG) based biometric has become popular as it can authenticate patients and monitor the patient's vital signs. volatile memory-based (NVM) PUF can be easily placed in the device to avoid counterfeit. Our aim is to provide a comprehensive study on the state-of-the-art developments papers based on biometrics enabled hardware security.
  arXiv  Detail & Related papers  (2020-12-14T20:00:40Z)

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.