Pages that link to "Item:Q1675724"
From MaRDI portal
The following pages link to The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited (Q1675724):
Displaying 21 items.
- High dimensional affine codes whose square has a designed minimum distance (Q782859) (← links)
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Squares of matrix-product codes (Q2302565) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5896075) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Faster Secure Multi-party Computation of AES and DES Using Lookup Tables (Q6487205) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
