Pages that link to "Item:Q3179368"
From MaRDI portal
The following pages link to Secure Multiparty RAM Computation in Constant Rounds (Q3179368):
Displayed 9 items.
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Secret-shared shuffle (Q2691590) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)