中文
相关论文

相关论文: Active learning for fast and slow modeling attacks…

200 篇论文

In this thesis, several linear and non-linear machine learning attacks on optical physical unclonable functions (PUFs) are presented. To this end, a simulation of such a PUF is implemented to generate a variety of datasets that differ in…

密码学与安全 · 计算机科学 2023-01-09 Michael Lachner

Security is of critical importance for the Internet of Things (IoT). Many IoT devices are resource-constrained, calling for lightweight security protocols. Physical unclonable functions (PUFs) leverage integrated circuits' variations to…

密码学与安全 · 计算机科学 2021-03-25 Yu Zhuang , Khalid T. Mursi , Li Gaoxiang

Physically Unclonable Functions (PUFs) provide a streamlined solution for lightweight device authentication. Delay-based Arbiter PUFs, with their ease of implementation and vast challenge space, have received significant attention; however,…

密码学与安全 · 计算机科学 2024-03-04 Hongming Fei , Owen Millwood , Prosanta Gope , Jack Miskelly , Biplab Sikdar

Strong physical unclonable function (PUF) is a promising solution for device authentication in resourceconstrained applications but vulnerable to machine learning attacks. In order to resist such attack, many defenses have been proposed in…

密码学与安全 · 计算机科学 2019-11-14 Jiliang Zhang , Chaoqun Shen

Physically Unclonable Function (PUF) circuits are finding widespread use due to increasing adoption of IoT devices. However, the existing strong PUFs such as Arbiter PUFs (APUF) and its compositions are susceptible to machine learning (ML)…

密码学与安全 · 计算机科学 2018-12-14 Nimesh Shah , Manaar Alam , Durga Prasad Sahoo , Debdeep Mukhopadhyay , Arindam Basu

This paper deals with study of the physical unclonable functions and specifically the design of arbiter based PUF (APUF) and extends the work on different types of attacks on the PUF designs to break the security of the device, which…

密码学与安全 · 计算机科学 2020-07-20 Abhijith Manchikanti Venkata , Dinesh Reddy Jeeru , Vittal K. P

Physical Unclonable Functions (PUFs) are promising security primitives for resource-constrained network nodes. The XOR Arbiter PUF (XOR PUF or XPUF) is an intensively studied PUF invented to improve the security of the Arbiter PUF, probably…

密码学与安全 · 计算机科学 2022-06-06 Gaoxiang Li , Khalid T. Mursi , Ahmad O. Aseeri , Mohammed S. Alkatheiri , Yu Zhuang

Physical Unclonable Functions (PUFs) serve as lightweight, hardware-intrinsic entropy sources widely deployed in IoT security applications. However, delay-based PUFs are vulnerable to Machine Learning Attacks (MLAs), undermining their…

密码学与安全 · 计算机科学 2026-01-09 Hongming Fei , Zilong Hu , Prosanta Gope , Biplab Sikdar

Physically unclonable functions (PUFs) identify integrated circuits using nonlinearly-related challenge-response pairs (CRPs). Ideally, the relationship between challenges and corresponding responses is unpredictable, even if a subset of…

Physical Unclonable Functions (PUFs) are promising security primitives for resource-constrained IoT devices. And the XOR Arbiter PUF (XOR-PUF) is one of the most studied PUFs, out of an effort to improve the resistance against machine…

密码学与安全 · 计算机科学 2026-04-14 Gaoxiang Li , Khalid T. Mursi , Yu Zhuang

As a well-known physical unclonable function that can provide huge number of challenge response pairs (CRP) with a compact design and fully compatibility with current electronic fabrication process, the arbiter PUF (APUF) has attracted…

密码学与安全 · 计算机科学 2022-03-30 Yansong Gao , Jianrong Yao , Lihui Pang , Zhi Zhang , Anmin Fu , Naixue Xiong , Hyoungshick Kim

Pre-trained Vision Language Models (VLMs) have demonstrated notable progress in various zero-shot tasks, such as classification and retrieval. Despite their performance, because improving performance on new tasks requires task-specific…

计算机视觉与模式识别 · 计算机科学 2024-03-22 Jihwan Bang , Sumyeong Ahn , Jae-Gil Lee

Existing active strategies for training surrogate models yield accurate structural reliability estimates by aiming at design space regions in the vicinity of a specified limit state function. In many practical engineering applications,…

机器学习 · 计算机科学 2024-05-02 J. Moran A. , P. G. Morato , P. Rigo

Machine learning researchers have long noticed the phenomenon that the model training process will be more effective and efficient when the training samples are densely sampled around the underlying decision boundary. While this observation…

机器学习 · 计算机科学 2021-09-24 Honggang Yu , Shihfeng Zeng , Teng Zhang , Ing-Chao Lin , Yier Jin

Physical unclonable functions (PUFs), as hardware security primitives, exploit manufacturing randomness to extract hardware instance-specific secrets. One of most popular structures is time-delay based Arbiter PUF attributing to large…

密码学与安全 · 计算机科学 2017-06-21 Yansong Gao , Said F. Al-Sarawi , Derek Abbott , Ahmad-Reza Sadeghi , Damith C. Ranasinghe

Physical Unclonable Functions (PUFs) based on Non-Volatile Memory (NVM) technology have emerged as a promising solution for secure authentication and cryptographic applications. By leveraging the multi-level cell (MLC) characteristic of…

密码学与安全 · 计算机科学 2025-01-14 Hassan Nassar , Ming-Liang Wei , Chia-Lin Yang , Jörg Henkel , Kuan-Hsun Chen

Deep neural networks are known to be vulnerable to adversarially perturbed inputs. A commonly used defense is adversarial training, whose performance is influenced by model capacity. While previous works have studied the impact of varying…

机器学习 · 计算机科学 2021-10-13 Sihui Dai , Saeed Mahloujifar , Prateek Mittal

Neural operators have emerged as fast surrogate models for physics simulations, yet they remain acutely vulnerable to adversarial perturbations, a critical liability for safety-critical digital twin deployments. We present a synergistic…

机器学习 · 计算机科学 2026-04-16 Samrendra Roy , Souvik Chakraborty , Syed Bahauddin Alam

Classification models are a fundamental component of physical-asset management technologies such as structural health monitoring (SHM) systems and digital twins. Previous work introduced risk-based active learning, an online approach for…

机器学习 · 计算机科学 2022-07-13 Aidan J. Hughes , Lawrence A. Bull , Paul Gardner , Nikolaos Dervilis , Keith Worden

Hard optimisation problems such as Boolean Satisfiability typically have long solving times and can usually be solved by many algorithms, although the performance can vary widely in practice. Research has shown that no single algorithm…

机器学习 · 计算机科学 2019-09-10 Riccardo Volpato , Guangyan Song
‹ 上一页 1 2 3 10 下一页 ›