English
Related papers

Related papers: Universally Composable Commitments with Communicat…

200 papers

Error correction is an indispensable component when Physical Unclonable Functions (PUFs) are used in cryptographic applications. So far, there exist schemes that obtain helper data, which they need within the error correction process. We…

Cryptography and Security · Computer Science 2016-11-09 Sven Müelich , Martin Bossert

More and more companies' Intellectual Property (IP) is being integrated into Neural Network (NN) models. This IP has considerable value for companies and, therefore, requires adequate protection. For example, an attacker might replicate a…

Cryptography and Security · Computer Science 2026-03-12 Daniel Dorfmeister , Flavio Ferrarotti , Bernhard Fischer , Martin Schwandtner , Hannes Sochor

This paper presents the PUF finite state machine (PUF-FSM) that is served as a practical {\it controlled} strong PUF. Previous controlled PUF designs have the difficulties of stabilizing the noisy PUF responses where the error correction…

Cryptography and Security · Computer Science 2017-01-27 Yansong Gao , Damith C. Ranasinghe

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…

Cryptography and Security · Computer Science 2023-01-09 Michael Lachner

Embedded systems play a crucial role in fueling the growth of the Internet-of-Things (IoT) in application domains such as healthcare, home automation, transportation, etc. However, their increasingly network-connected nature, coupled with…

Cryptography and Security · Computer Science 2017-12-06 Soubhagya Sutar , Arnab Raha , Vijay Raghunathan

In this letter, a physical unclonable function (PUF)-advanced encryption standard (AES)-PUF is proposed as a new PUF architecture by embedding an AES cryptographic circuit between two conventional PUF circuits to conceal their…

Cryptography and Security · Computer Science 2018-10-18 Weize Yu , Jia Chen

The current chapter aims at establishing a relationship between artificial intelligence (AI) and hardware security. Such a connection between AI and software security has been confirmed and well-reviewed in the relevant literature. The main…

Cryptography and Security · Computer Science 2021-02-12 Fatemeh Ganji , Shahin Tajik

Encryption techniques demonstrate a great deal of security when implemented in an optical system (such as holography) due to the inherent physical properties of light and the precision it demands. However, such systems have shown to be…

In this paper, we design secure multi-party computation (MPC) protocols in the asynchronous communication setting with optimal resilience. Our protocols are secure against a computationally-unbounded malicious adversary, characterized by an…

Cryptography and Security · Computer Science 2022-05-27 Ananya Appan , Anirudh Chandramouli , Ashish Choudhury

In many Industry Internet of Things (IIoT) applications, resources like CPU, memory, and battery power are limited and cannot afford the classic cryptographic security solutions. Silicon Physical Unclonable Function (PUF) is a lightweight…

Cryptography and Security · Computer Science 2019-08-22 Jiliang Zhang , Gang Qu

Constructing stealthy malware has gained increasing popularity among cyber attackers to conceal their malicious intent. Nevertheless, the constructed stealthy malware still fails to survive the reverse engineering by security experts.…

Cryptography and Security · Computer Science 2020-11-16 Tiantian Ji , Binxing Fang , Xiang Cui , Zhongru Wang , Jiawen Diao , Tian Wang , Weiqiang Yu

We propose a new formal criterion for secure compilation, providing strong security guarantees for components written in unsafe, low-level languages with C-style undefined behavior. Our criterion goes beyond recent proposals, which protect…

In this work the novel usage of a physically unclonable function composed of a network of Mach-Zehnder interferometers for authentication tasks is described. The physically unclonable function hardware is completely reconfigurable, allowing…

Quantum Physics · Physics 2020-12-21 H S. Jacinto , A. Matthew Smith

Physical Unclonable Functions (PUFs) are hardware security primitives whose inherent physical complexity can be exploited for secure authentication and cryptographic key generation. Silicon photonic devices, owing to their suitability for…

Physical Unclonable Functions evaluate manufacturing variations to generate secure cryptographic keys for embedded systems without secure key storage. It is explained how methods from coding theory are applied in order to ensure reliable…

Information Theory · Computer Science 2015-01-28 Sven Puchinger , Sven Müelich , Martin Bossert , Matthias Hiller , Georg Sigl

Relativistic protocols have been proposed to overcome some impossibility results in classical and quantum cryptography. In such a setting, one takes the location of honest players into account, and uses the fact that information cannot…

Quantum Physics · Physics 2019-05-24 V. Vilasini , Christopher Portmann , Lidia del Rio

Physical Unclonable Functions (PUFs) are circuits designed to extract physical randomness from the underlying circuit. This randomness depends on the manufacturing process. It differs for each device enabling chip-level authentication and…

Cryptography and Security · Computer Science 2017-11-16 Yunxi Guo , Timothy Dee , Akhilesh Tyagi

Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs, serving as secure fingerprints for cryptographic protocols like authentication. Quantum PUFs (QPUFs) extend this…

Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available as a key storage, the secret key can be derived from…

We show that stand-alone statistically secure random oblivious transfer protocols based on two-party stateless primitives are statistically universally composable. I.e. they are simulatable secure with an unlimited adversary, an unlimited…

Cryptography and Security · Computer Science 2018-08-31 Rafael Dowsley , Jörn Müller-Quade , Anderson C. A. Nascimento