Cryptology ePrint Archive: Report 2015/405

Feasibility and Infeasibility of Secure Computation with Malicious PUFs

Dana Dachman-Soled and Nils Fleischhacker and Jonathan Katz and Anna Lysyanskaya and Dominique Schröder

Abstract: A recent line of work has explored the use of physically uncloneable functions (PUFs) for secure computation, with the goals of (1) achieving universal composability without additional setup, and/or (2) obtaining unconditional security (i.e., avoiding complexity-theoretic assumptions). Initial work assumed that all PUFs, even those created by an attacker, are honestly generated. Subsequently, researchers have investigated models in which an adversary can create malicious PUFs with arbitrary behavior. Researchers have considered both malicious PUFs that might be stateful, as well as malicious PUFs that can have arbitrary behavior but are guaranteed to be stateless.

We settle the main open questions regarding secure computation in the malicious-PUF model: * We prove that unconditionally secure oblivious transfer is impossible, even in the stand-alone setting, if the adversary can construct (malicious) stateful PUFs. * If the attacker is limited to creating (malicious) stateless PUFs, then universally composable two-party computation is possible without computational assumptions.

Category / Keywords: foundations / pufs, foundations, impossibility, universal composability

Original Publication (with major differences): IACR-CRYPTO-2014

Date: received 29 Apr 2015, last revised 15 Jan 2018

Contact author: jkatz at cs umd edu

Available format(s): PDF | BibTeX Citation

Note: This is the full version of the paper.

Version: 20180115:180737 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]