Pages that link to "Item:Q3179364"
From MaRDI portal
The following pages link to Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364):
Displaying 10 items.
- Pattern matching on encrypted streams (Q1633445) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
