Unconditionally secure and universally composable commitments from physical assumptions
From MaRDI portal
Recommendations
Cited in
(12)- Everlasting UC commitments from fully malicious PUFs
- Unclonable polymers and their cryptographic applications
- Feasibility and infeasibility of secure computation with malicious PUFs
- On black-box complexity of universally composable security in the CRS model
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Weakening the isolation assumption of tamper-proof hardware tokens
- Round-optimal black-box two-party computation
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
- Concurrently composable security with shielded super-polynomial simulators
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model
This page was built for publication: Unconditionally secure and universally composable commitments from physical assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867148)