How to Fake Auxiliary Input
From MaRDI portal
Publication:5746354
DOI10.1007/978-3-642-54242-8_24zbMath1326.94102OpenAlexW2142185237MaRDI QIDQ5746354
Krzysztof Pietrzak, Dimitar Jetchev
Publication date: 18 February 2014
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_24
Related Items (13)
Improved computational extractors and their applications ⋮ Simulating Auxiliary Inputs, Revisited ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ The Chain Rule for HILL Pseudoentropy, Revisited ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ ABE for circuits with constant-size secret keys and adaptive security ⋮ A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Low error efficient computational extractors in the CRS model ⋮ Advice Lower Bounds for the Dense Model Theorem ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication: How to Fake Auxiliary Input
