How to fake auxiliary input
From MaRDI portal
Recommendations
Cited in
(19)- On the complexity of simulating auxiliary input
- Low error efficient computational extractors in the CRS model
- Amplifying the security of functional encryption, unconditionally
- Improved computational extractors and their applications
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Advice lower bounds for the dense model theorem
- Simulatable leakage: analysis, pitfalls, and new constructions
- The chain rule for HILL pseudoentropy, revisited
- A better chain rule for HILL pseudoentropy -- beyond bounded leakage
- A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
- Simulating auxiliary inputs, revisited
- Pseudoentropy: lower-bounds for chain rules and transformations
- A counterexample to the chain rule for conditional HILL entropy
- Efficiently simulating high min-entropy sources in the presence of side information
- Computational two-party correlation: a dichotomy for key-agreement protocols
- ABE for circuits with constant-size secret keys and adaptive security
- Uniform black-box separations via non-malleable extractors
- Generalized and unified equivalences between hardness and pseudoentropy
- Relating definitions of computational differential privacy in wider parameter regimes
This page was built for publication: How to fake auxiliary input
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746354)