Everlasting UC commitments from fully malicious PUFs

DOI10.1007/S00145-022-09432-4MaRDI QIDQ2155992zbMATH OpenOpenAlexFDO

Authors Bernardo Magri, Giulio Malavolta, Dominique Schröder, Dominique Unruh

Publication date 15 July 2022

Published in Journal of Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00145-022-09432-4

zbMATH Keywords

universal composabilitycommitment schemePUFeverlasting security

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Unconditionally secure and universally composable commitments from physical assumptions
• Unconditional UC-secure computation with (stronger-malicious) PUFs
• Physically uncloneable functions in the universal composition framework
• Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
• Feasibility and infeasibility of secure computation with malicious PUFs

Cites work

• scientific article; zbMATH DE number 1256767 (Why is no real title available?)
• scientific article; zbMATH DE number 1088242 (Why is no real title available?)
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• scientific article; zbMATH DE number 2011839 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• Efficient concurrent zero-knowledge in the auxiliary string model
• Everlasting multi-party computation
• Feasibility and infeasibility of secure computation with malicious PUFs
• Founding Cryptography on Tamper-Proof Hardware Tokens
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Interactive locking, zero-knowledge PCPs, and unconditional cryptography
• Long-Term Security and Universal Composability
• Long-term security and universal composability
• Lossy trapdoor functions and their applications
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Physically unclonable functions. Constructions, properties and applications
• Physically uncloneable functions in the universal composition framework
• Statistical concurrent non-malleable zero knowledge
• The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
• Towards a Unified Security Model for Physically Unclonable Functions
• UC-secure OT from LWE, revisited
• Unconditional UC-secure computation with (stronger-malicious) PUFs
• Unconditional and composable security using a single stateful Tamper-proof hardware token
• Unconditionally secure and universally composable commitments from physical assumptions
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
• Universally composable two-party and multi-party secure computation

Cited in

(2)

• Composable long-term security with rewinding
• Unconditionally secure and universally composable commitments from physical assumptions

This page was built for publication: Everlasting UC commitments from fully malicious PUFs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155992)