Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Robustly Reusable Fuzzy Extractors in a Post-quantum World

Amit Deo, Charlie Grover

Published Jan 1, 2023• 2 citations
Publisher
DOI
10.1007/978-3-031-33491-7_16

Related papers

Robustly reusable fuzzy extractor with imperfect randomness

Nan Cui, Shengli Liu, Dawu Gu +1 more

Designs Codes and Cryptography•Mar 22, 2021•8 citations

Computational Fuzzy Extractors

Benjamin W. Fuller, Xianrui Meng, Leonid Reyzin

Lecture notes in computer science•Jan 1, 2013•78 citations

Non-malleable Fuzzy Extractors

Danilo Francati, Daniele Venturi

Lecture notes in computer science•Jan 1, 2024•0 citations

General Constructions of Fuzzy Extractors for Continuous Sources

Yucheng Ma, Peisong Shen, Kewei Lv +2 more

Lecture notes in computer science•Jan 1, 2024•0 citations

Reusable Fuzzy Extractor Based on the LPN Assumption

Yiming Li, Shengli Liu, Dawu Gu +1 more

Abstract A fuzzy extractor derives uniformly random strings from noisy sources that are neither reliably reproducible nor uniformly random. The basic definition of fuzzy extractor was first formally introduced by Dodis et al. and has achieved various applications in cryptographic systems. However, it has been proved that a fuzzy extractor could become totally insecure when the same noisy random source is extracted multiple times. To solve this problem, the reusable fuzzy extractor is proposed. In this paper, we propose the first reusable fuzzy extractor based on the LPN assumption, which is efficient and resilient to linear fraction of errors. Furthermore, our construction serves as an alternative post-quantum reusable fuzzy extractor.

The Computer Journal•May 2, 2020•6 citations

Reusable and robust fuzzy extractor for CRS-dependent sources

Yucheng Ma, Peisong Shen, Xue Tian +2 more

Abstract Fuzzy extractors allow for the extraction and reproduction of a nearly uniform string from a noisy and non-uniform source. Reusable and robust fuzzy extractors further require that the output string should remain pseudorandom under multiple extractions and any modification of public value should be detectable. Existing constructions of reusable and robust fuzzy extractors are all designed in the Common Reference String (CRS) model and work only for CRS-independent sources. In this work, we introduce a construction of reusable and robust fuzzy extractor for CRS-dependent sources. Our construction is built upon some well-studied cryptography, including a collision resistant hash function, a symmetric key encryption that keeps secure with respect to auxiliary input, a public key encryption and simulation-sound non-interactive zero-knowledge argument. We also present some instantiations of these primitives from Learning with Parity Noise (LPN) assumption and Short Integer Solution (SIS) assumption. These instantiations result in the first reusable and robust fuzzy extractor for CRS-dependent sources that can tolerate linear errors.

Cybersecurity•Jan 14, 2025•0 citations
Abstract A fuzzy extractor derives uniformly random strings from noisy sources that are neither reliably reproducible nor uniformly random. The basic definition of fuzzy extractor was first formally introduced by Dodis et al. and has achieved various applications in cryptographic systems. However, it has been proved that a fuzzy extractor could become totally insecure when the same noisy random source is extracted multiple times. To solve this problem, the reusable fuzzy extractor is proposed. In this paper, we propose the first reusable fuzzy extractor based on the LPN assumption, which is efficient and resilient to linear fraction of errors. Furthermore, our construction serves as an alternative post-quantum reusable fuzzy extractor.
Abstract Fuzzy extractors allow for the extraction and reproduction of a nearly uniform string from a noisy and non-uniform source. Reusable and robust fuzzy extractors further require that the output string should remain pseudorandom under multiple extractions and any modification of public value should be detectable. Existing constructions of reusable and robust fuzzy extractors are all designed in the Common Reference String (CRS) model and work only for CRS-independent sources. In this work, we introduce a construction of reusable and robust fuzzy extractor for CRS-dependent sources. Our construction is built upon some well-studied cryptography, including a collision resistant hash function, a symmetric key encryption that keeps secure with respect to auxiliary input, a public key encryption and simulation-sound non-interactive zero-knowledge argument. We also present some instantiations of these primitives from Learning with Parity Noise (LPN) assumption and Short Integer Solution (SIS) assumption. These instantiations result in the first reusable and robust fuzzy extractor for CRS-dependent sources that can tolerate linear errors.