Barriers in cryptography with weak, correlated and leaky sources

DOI10.1145/2422436.2422451zbMath1364.94567OpenAlexW1972876358MaRDI QIDQ2986863

Daniel Wichs

Publication date: 16 May 2017

Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2422436.2422451

zbMATH Keywords

cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Security Against Related Randomness Attacks via Reconstructive Extractors ⋮ Memory lower bounds of reductions revisited ⋮ Incompressible cryptography ⋮ Augmented random oracles ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ Leakage-resilient cryptography from puncturable primitives and obfuscation ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Extracting randomness from extractor-dependent sources ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Leakage-resilient key exchange and two-seed extractors ⋮ Incompressible encodings ⋮ Hardness of LWE on general entropic distributions

Cites Work

• Teachability in computational learning
• Measuring teachability using variants of the teaching dimension
• Teaching a smarter learner.
• Occam's razor
• Pseudorandom generators for space-bounded computation
• On the power of inductive inference from good examples
• A model of interactive teaching
• Learning from different teachers
• On the limits of efficient teachability
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• On the complexity of teaching
• On specifying Boolean functions by labelled examples
• Recent Developments in Algorithmic Teaching
• A theory of the learnable
• Teaching Randomized Learners
• Algorithmic Learning Theory
• A theory of goal-oriented communication
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Barriers in cryptography with weak, correlated and leaky sources