Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
From MaRDI portal
Publication:2175905
DOI10.1007/978-3-030-36030-6_4zbMath1455.94156OpenAlexW2990595940MaRDI QIDQ2175905
Lukas Zobernig, Steven D. Galbraith
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_4
Related Items (2)
Obfuscating finite automata ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Obfuscating conjunctions
- A simple obfuscation scheme for pattern-matching with wildcards
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- On perfect correctness in (lockable) obfuscation
- New techniques for obfuscating conjunctions
- Efficient cryptographic schemes provably as secure as subset sum
- Point-Function Obfuscation: A Framework and Generic Constructions
- Obfuscating Conjunctions under Entropic Ring LWE
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
- An Introduction to Mathematical Cryptography
- Point Obfuscation and 3-Round Zero-Knowledge
- When Are Fuzzy Extractors Possible?
- Obfuscation of Hyperplane Membership
- On obfuscating point functions
- Correcting errors without leaking partial information
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Solving low-density subset sum problems
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Secure Sketch for Biometric Templates
- Reusable garbled circuits and succinct functional encryption
- Obfuscation for Evasive Functions
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- The number of steps in the Euclidean algorithm
- The number of steps in the Euclidean algorithm
This page was built for publication: Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
