Pages that link to "Item:Q2175950"
From MaRDI portal
The following pages link to Permuted puzzles and cryptographic hardness (Q2175950):
Displaying 4 items.
- Cryptoschemes based on difficulty of simultaneous solving two different difficult problems (Q495415) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)