Locally computable UOWHF with linear shrinkage
From MaRDI portal
Publication:4924428
Recommendations
Cited in
(7)- Locally computable UOWHF with linear shrinkage
- UOWHFs from OWFs: trading regularity for efficiency
- Cryptographic hardness of random local functions. Survey
- Low-complexity cryptographic hash functions
- Oblivious transfer with constant computational overhead
- Constant-round arguments from one-way functions
- Improved search-to-decision reduction for random local functions
This page was built for publication: Locally computable UOWHF with linear shrinkage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924428)