Impossibility of efficient information-theoretic fuzzy extraction
From MaRDI portal
Publication:6564092
Cites work
- scientific article; zbMATH DE number 3228255 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A new distribution-sensitive secure sketch and popularity-proportional hashing
- Advances in cryptology -- ASIACRYPT '96. International conference on the theory and applications of cryptology and information security, Kyongju, Korea, November 3--7, 1996. Proceedings
- Computational fuzzy extractors
- Efficient, reusable fuzzy extractors from LWE
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Generic constructions of robustly reusable fuzzy extractor
- Interactive Communication for Data Exchange
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- Obfuscation for evasive functions
- On virtual grey box obfuscation for general circuits
- Optimal numberings and isoperimetric problems on graphs
- Privacy Amplification by Public Discussion
- Randomness is linear in space
- Reusable fuzzy extractors for low-entropy distributions
- Robustly reusable fuzzy extractor from standard assumptions
- Secret Key Agreement: General Capacity and Second-Order Asymptotics
- Secret key agreement by public discussion from common information
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Some notions of entropy for cryptography. (Invited talk)
- Universal Multiparty Data Exchange and Secret Key Agreement
- When Are Fuzzy Extractors Possible?
- When Are Fuzzy Extractors Possible?
This page was built for publication: Impossibility of efficient information-theoretic fuzzy extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564092)
