Physically uncloneable functions in the universal composition framework

DOI10.1007/978-3-642-22792-9_4MaRDI QIDQ5199184zbMATH OpenOpenAlexFDO

Authors Christina Brzuska, Heike Schröder, Stefan Katzenbeisser, Marc Fischlin

Publication date 12 August 2011

Published in Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22792-9_4

Mathematics Subject Classification ID

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

Recommendations

• Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
• Towards a Unified Security Model for Physically Unclonable Functions
• Unconditional UC-secure computation with (stronger-malicious) PUFs
• Feasibility and infeasibility of secure computation with malicious PUFs
• Feasibility and infeasibility of secure computation with malicious PUFs

Cited in

(25)

• Everlasting UC commitments from fully malicious PUFs
• Unclonable polymers and their cryptographic applications
• Feasibility and infeasibility of secure computation with malicious PUFs
• On the exact round complexity of best-of-both-worlds multi-party computation
• PUF-based mutual multifactor entity and transaction authentication for secure banking
• Foundations of reconfigurable PUFs
• Unconditionally secure and universally composable commitments from physical assumptions
• Feasibility and infeasibility of secure computation with malicious PUFs
• Quantum readout of physical unclonable functions
• SIMPL systems as a keyless cryptographic and security primitive
• Weakening the isolation assumption of tamper-proof hardware tokens
• A new security proof of practical cryptographic devices based on hardware, software and protocols
• Practical security analysis of PUF-based two-player protocols
• Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
• Memory leakage-resilient secret sharing schemes
• Secure lightweight entity authentication with strong PUFs: Mission impossible?
• Unconditional UC-secure computation with (stronger-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
• Endemic oblivious transfer via random oracles, revisited
• Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
• How do the arbiter PUFs sample the Boolean function class?
• CaSCaDE: (time-based) Cryptography from Space Communications DElay
• Proofs of sequential communication delays from physical assumptions and their applications
• On combining Arbiter based PUFs

This page was built for publication: Physically uncloneable functions in the universal composition framework

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