Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

An Attack to Universally Composable Commitments from Malicious Physically Uncloneable Functions and How to Avoid It

Lourenço Abecasis, Paulo Mateus, Chrysoula Vlachou

Published Oct 10, 2025• 0 citations
Publisher
DOI
10.1007/978-981-95-2961-2_16

Related papers

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions

Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti +1 more

Lecture notes in computer science•Jan 1, 2013•62 citations

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

Ivan Damgård, Alessandra Scafuro

Lecture notes in computer science•Jan 1, 2013•40 citations

Physically Uncloneable Functions in the Universal Composition Framework

Christina Brzuska, Marc Fischlin, Heike Schröder +1 more

Lecture notes in computer science•Jan 1, 2011•118 citations

Universally Composable Oblivious Database in the Presence of Malicious Adversaries

Huafei Zhu

Lecture notes in computer science•Jan 1, 2016•0 citations

On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols

Ulrich Rührmair, Marten van Dijk

Journal of Cryptographic Engineering•Mar 25, 2013•33 citations

Universally Composable Commitments with Communicating Malicious Physically Uncloneable Functions

Lourenço Abecasis, Paulo Mateus, Chrysoula Vlachou

In this work, we explore the possibility of universally composable (UC)-secure commitments using Physically Uncloneable Functions (PUFs) within a new adversarial model. We introduce the communicating malicious PUFs, i.e. malicious PUFs that can interact with their creator even when not in their possession, obtaining a stronger adversarial model. Prior work [ASIACRYPT 2013, LNCS, vol. 8270, pp. 100-119] proposed a compiler for constructing UC-secure commitments from ideal extractable commitments, and our task would be to adapt the ideal extractable commitment scheme proposed therein to our new model. However, we found an attack and identified a few other issues in that construction, and to address them, we modified the aforementioned ideal extractable commitment scheme and introduced new properties and tools that allow us to rigorously develop and present security proofs in this context. We propose a new UC-secure commitment scheme against adversaries that can only create stateless malicious PUFs which can receive, but not send, information from their creators. Our protocol is more efficient compared to previous proposals, as we have parallelized the ideal extractable commitments within it. The restriction to stateless malicious PUFs is significant, mainly since the protocol from [ASIACRYPT 2013, LNCS, vol. 8270, pp. 100-119] assumes malicious PUFs with unbounded state, thus limiting its applicability. However it is the only way we found to address the issues of the original construction. We hope that in future work this restriction can be lifted, and along the lines of our work, UC-secure commitments with fewer restrictions on both the state and communication can be constructed.

arXiv:2504.10120•Apr 14, 2025•0 citations
In this work, we explore the possibility of universally composable (UC)-secure commitments using Physically Uncloneable Functions (PUFs) within a new adversarial model. We introduce the communicating malicious PUFs, i.e. malicious PUFs that can interact with their creator even when not in their possession, obtaining a stronger adversarial model. Prior work [ASIACRYPT 2013, LNCS, vol. 8270, pp. 100-119] proposed a compiler for constructing UC-secure commitments from ideal extractable commitments, and our task would be to adapt the ideal extractable commitment scheme proposed therein to our new model. However, we found an attack and identified a few other issues in that construction, and to address them, we modified the aforementioned ideal extractable commitment scheme and introduced new properties and tools that allow us to rigorously develop and present security proofs in this context. We propose a new UC-secure commitment scheme against adversaries that can only create stateless malicious PUFs which can receive, but not send, information from their creators. Our protocol is more efficient compared to previous proposals, as we have parallelized the ideal extractable commitments within it. The restriction to stateless malicious PUFs is significant, mainly since the protocol from [ASIACRYPT 2013, LNCS, vol. 8270, pp. 100-119] assumes malicious PUFs with unbounded state, thus limiting its applicability. However it is the only way we found to address the issues of the original construction. We hope that in future work this restriction can be lifted, and along the lines of our work, UC-secure commitments with fewer restrictions on both the state and communication can be constructed.