Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
From MaRDI portal
Publication:5738884
DOI10.1007/978-3-319-56620-7_14zbMath1411.94048OpenAlexW2600814570MaRDI QIDQ5738884
Ivan Visconti, Rafail Ostrovsky, Saikrishna Badrinarayanan, Dakshita Khurana
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_14
Related Items
Everlasting UC commitments from fully malicious PUFs, Feasibility and infeasibility of secure computation with malicious PUFs, 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
Cites Work
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Towards a Unified Security Model for Physically Unclonable Functions
- Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
- Feasibility and Infeasibility of Secure Computation with Malicious PUFs
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Secure Computation from Leaky Correlated Randomness
- Oblivious Transfer Is Symmetric
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
- Extracting Correlations
- Physically Uncloneable Functions in the Universal Composition Framework
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Stateless Cryptographic Protocols
- Lower Bounds in the Hardware Token Model
- Topics in Cryptology – CT-RSA 2006
