Feasibility and infeasibility of secure computation with malicious PUFs

Authored book
(Volume of book series)


Publication Details

Author(s): Dachman-Soled D, Fleischhacker N, Katz J, Lysyanskaya A, Schröder D
Publisher: Springer Verlag
Publication year: 2014
Title of series: Advances in Cryptology - CRYPTO 2014
Pages range: 405-420
ISBN: 9783662443804
Language: English


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. - We show that universally composable two-party computation is possible if the attacker is limited to creating (malicious) stateless PUFs. Our protocols are simple and efficient, and do not require any cryptographic assumptions. © 2014 International Association for Cryptologic Research.



FAU Authors / FAU Editors

Schröder, Dominique Prof. Dr.
Lehrstuhl für Informatik 13 (Angewandte Kryptographie)


How to cite

APA:
Dachman-Soled, D., Fleischhacker, N., Katz, J., Lysyanskaya, A., & Schröder, D. (2014). Feasibility and infeasibility of secure computation with malicious PUFs. Springer Verlag.

MLA:
Dachman-Soled, Dana, et al. Feasibility and infeasibility of secure computation with malicious PUFs. Springer Verlag, 2014.

BibTeX: 

Last updated on 2018-29-11 at 20:50