On tolerant cryptographic constructions
From MaRDI portal
Recommendations
Cited in
(20)- Proofs of Work from worst-case assumptions
- FO-like combiners and hybrid post-quantum cryptography
- From FE combiners to secure MPC and back
- Generic attacks on hash combiners
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscation combiners
- Error-Tolerant Combiners for Oblivious Primitives
- Robust Multi-property Combiners for Hash Functions Revisited
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Multi-property Preserving Combiners for Hash Functions
- OT-Combiners via Secure Computation
- On the complexity of compressing obfuscation
- Random oracle combiners: breaking the concatenation barrier for collision-resistance
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Amplification of non-interactive zero knowledge, revisited
- Random oracle combiners: Merkle-Damgård style
- Robust combiners and universal constructions for quantum cryptography
- Robust non-interactive zero-knowledge combiners
- Strong multiple-CCA security in the quantum random oracle model for an FO-like PKE combiner
- Robust multi-property combiners for hash functions
This page was built for publication: On tolerant cryptographic constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710831)