Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions

DOI10.1007/978-3-642-38348-9_41zbMath1300.68029OpenAlexW72129948MaRDI QIDQ4924440

Ivan Visconti, Rafail Ostrovsky, Alessandra Scafuro, Akshay Wadia

Publication date: 31 May 2013

Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_41

zbMATH Keywords

cryptographic protocolsconcurrent compositionsecurity analysis of protocols

Mathematics Subject Classification ID

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

Related Items (10)

Everlasting UC commitments from fully malicious PUFs ⋮ Unclonable polymers and their cryptographic applications ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ Fully-secure MPC with minimal trust ⋮ A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Secure computation without computers ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ Foundations of Reconfigurable PUFs

This page was built for publication: Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions