Pages that link to "Item:Q2119032"
From MaRDI portal
The following pages link to Two-round oblivious transfer from CDH or LPN (Q2119032):
Displaying 24 items.
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Two-Round Oblivious Linear Evaluation from Learning with Errors (Q5087264) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT (Q6488028) (← links)
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model (Q6488035) (← links)
- Weak zero-knowledge via the Goldreich-Levin theorem (Q6562563) (← links)
- Towards topology-hiding computation from oblivious transfer (Q6581794) (← links)
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer (Q6595938) (← links)
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application (Q6618581) (← links)
- Composable oblivious pseudo-random functions via garbled circuits (Q6619935) (← links)
- Two-round maliciously-secure oblivious transfer with optimal rate (Q6637571) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
- Non-interactive zero-knowledge from LPN and MQ (Q6653050) (← links)
