Everlasting UC commitments from fully malicious PUFs

DOI10.1007/S00145-022-09432-4zbMATH Open1492.94146OpenAlexW3157433244MaRDI QIDQ2155992FDOQ2155992

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)

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

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

zbMATH Keywords

universal composabilitycommitment schemePUFeverlasting security

Mathematics Subject Classification ID

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

Cites Work

• Efficient concurrent zero-knowledge in the auxiliary string model
• A Framework for Efficient and Composable Oblivious Transfer
• Title not available (Why is that?)
• Physically Unclonable Functions
• Lossy trapdoor functions and their applications
• Title not available (Why is that?)
• Universally composable two-party and multi-party secure computation
• Title not available (Why is that?)
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
• Long-Term Security and Universal Composability
• Long-term security and universal composability
• Statistical Concurrent Non-malleable Zero Knowledge
• Everlasting Multi-party Computation
• The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
• Title not available (Why is that?)
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Unconditional and composable security using a single stateful Tamper-proof hardware token
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Feasibility and Infeasibility of Secure Computation with Malicious PUFs
• Towards a Unified Security Model for Physically Unclonable Functions
• UC-secure OT from LWE, revisited
• Interactive locking, zero-knowledge PCPs, and unconditional cryptography
• Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
• Title not available (Why is that?)
• Physically uncloneable functions in the universal composition framework
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs

Cited In (1)

• Composable long-term security with rewinding

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)