Pages that link to "Item:Q5746357"
From MaRDI portal
The following pages link to (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens (Q5746357):
Displaying 10 items.
- Pattern matching on encrypted streams (Q1633445) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- A framework for universally composable oblivious transfer from one-round key-exchange (Q2177655) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← 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)
- Theory of Cryptography (Q5901778) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
