Pages that link to "Item:Q1777283"
From MaRDI portal
The following pages link to Computationally secure oblivious transfer (Q1777283):
Displaying 16 items.
- Efficient oblivious transfers with access control (Q453798) (← links)
- Generalized oblivious transfer by secret sharing (Q629875) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- Security of blind signatures under aborts and applications to adaptive oblivious transfer (Q3096954) (← links)
- Fully-Simulatable Oblivious Set Transfer (Q3511158) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions (Q3637148) (← links)
- Round Optimal Universally Composable Oblivious Transfer Protocols (Q5505480) (← links)
- Adaptive oblivious transfer with access control from lattice assumptions (Q5919120) (← links)
- Local differential privacy protocol for making key-value data robust against poisoning attacks (Q6072465) (← links)
- Efficient Traceable Oblivious Transfer and Its Applications (Q6163698) (← links)