Pages that link to "Item:Q5261634"
From MaRDI portal
The following pages link to General Statistically Secure Computation with Bounded-Resettable Hardware Tokens (Q5261634):
Displaying 6 items.
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)
- Lower Bounds in the Hardware Token Model (Q5746358) (← links)