Everlasting UC commitments from fully malicious PUFs
From MaRDI portal
Publication:2155992
DOI10.1007/S00145-022-09432-4zbMath1492.94146OpenAlexW3157433244MaRDI QIDQ2155992
Giulio Malavolta, Dominique Schröder, Bernardo Magri, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long-term security and universal composability
- UC-secure OT from LWE, revisited
- Towards a Unified Security Model for Physically Unclonable Functions
- Everlasting Multi-party Computation
- Physically Unclonable Functions
- Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
- Feasibility and Infeasibility of Secure Computation with Malicious PUFs
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Lossy trapdoor functions and their applications
- Universally composable two-party and multi-party secure computation
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
- Long-Term Security and Universal Composability
- A Framework for Efficient and Composable Oblivious Transfer
- The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
- Physically Uncloneable Functions in the Universal Composition Framework
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
- Statistical Concurrent Non-malleable Zero Knowledge
This page was built for publication: Everlasting UC commitments from fully malicious PUFs
