Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

DOI10.1007/978-3-642-42045-0_6zbMath1315.68120OpenAlexW1545721673MaRDI QIDQ2867148

Alessandra Scafuro, Ivan B. Damgård

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_6

zbMATH Keywords

unconditional securitycommitment schemeUC-securityhardware assumptions

Mathematics Subject Classification ID

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

Related Items

Round-Optimal Black-Box Two-Party Computation ⋮ 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 ⋮ A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ On black-box complexity of universally composable security in the CRS model

Uses Software

• PUFKY