Unconditional and composable security using a single stateful Tamper-proof hardware token
From MaRDI portal
Publication:3000538
Recommendations
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Reusing tamper-proof hardware in UC-secure protocols
- Weakening the isolation assumption of tamper-proof hardware tokens
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Cited in
(17)- Somewhere statistically binding commitment schemes with applications
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Weakening the isolation assumption of tamper-proof hardware tokens
- Two-round oblivious linear evaluation from learning with errors
- Everlasting UC commitments from fully malicious PUFs
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Pattern matching on encrypted streams
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Reusing tamper-proof hardware in UC-secure protocols
- Non-interactive secure computation from one-way functions
- A new security proof of practical cryptographic devices based on hardware, software and protocols
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- BiTR: built-in tamper resilience
- Unclonable polymers and their cryptographic applications
- Composable long-term security with rewinding
This page was built for publication: Unconditional and composable security using a single stateful Tamper-proof hardware token
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000538)