Feasibility and Infeasibility of Secure Computation with Malicious PUFs

DOI10.1007/978-3-662-44381-1_23zbMath1335.94043OpenAlexW2270444006MaRDI QIDQ2874550

Nils Fleischhacker, Anna Lysyanskaya, Dominique Schröder, Dana Dachman-Soled, Jonathan N. Katz

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_23

zbMATH Keywords

secure computationphysically uncloneable functions (PUFs)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Everlasting UC commitments from fully malicious PUFs ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs

This page was built for publication: Feasibility and Infeasibility of Secure Computation with Malicious PUFs