Correcting errors without leaking partial information

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Symposium on the Theory of Computing

• Publication date

  2005-05-22

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1060590.1060688
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

  2006cited by this paper
• Error Correction in the Bounded Storage Model

  2005influential reference
• Entropic Security and the Encryption of High Entropy Messages

  2005influential reference
• Optimal Error Correction Against Computationally Bounded Noise

  2005cited by this paper
• Elements of Information Theory

  2005cited by this paper
• On obfuscating point functions

  2005cited by this paper
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

  2004influential reference
• Maintaining secrecy when information leakage is unavoidable

  2004cited by this paper
• Positive Results and Techniques for Obfuscation

  2004influential reference
• Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

  2003cited by this paper
• Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model

  2003influential reference
• A Practical Protocol for Advantage Distillation and Information Reconciliation

  2003cited by this paper
• Fuzzy Extractors and Cryptography, or How to Use Your Fingerprints

  2003influential reference
• Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors

  2003cited by this paper
• New Shielding Functions to Enhance Privacy and Prevent Misuse of Biometric Templates

  2003cited by this paper
• How to fool an unbounded adversary with a short key

  2002influential reference
• A Fuzzy Vault Scheme

  2002cited by this paper
• Recent Developments in Explicit Constructions of Extractors

  2002cited by this paper
• Bounds for the weight distribution of weakly self-dual codes

  2001cited by this paper
• Upper bounds for constant-weight codes

  2000influential reference
• A fuzzy commitment scheme

  1999cited by this paper
• Communication complexity of document exchange

  1999cited by this paper
• A Pseudorandom Generator from any One-way Function

  1999cited by this paper
• Perfectly One-Way Probabilistic Hash Functions

  1998influential reference
• Perfectly one-way probabilistic hash functions (preliminary version)

  1998cited by this paper
• Tight bounds for depth-two superconcentrators

  1997influential reference
• Linking information reconciliation and privacy amplification

  1997cited by this paper
• Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

  1997influential reference
• Randomness is Linear in Space

  1996influential reference
• Notes on the Average Binary Weight Enumerator of Generalized Algebraic-Geometric Codes (Special Section on Information Theory and Its Applications)

  1996cited by this paper
• Generalized privacy amplification

  1994cited by this paper
• Secret-Key Reconciliation by Public Discussion

  1994cited by this paper
• Secret key agreement by public discussion

  1993cited by this paper
• Algebraic function fields and codes

  1993influential reference
• WEIGHT DISTRIBUTIONS OF SUBFIELD SUBCODES OF ALGEBRAIC-GEOMETRICAL CODES

  1991cited by this paper
• The average binary weight-enumerator for a class of generalized Reed-Solomon codes

  1991cited by this paper
• Small-bias probability spaces: efficient constructions and applications

  1990cited by this paper
• Pseudo-random generation from one-way functions

  1989influential reference
• How to recycle random bits

  1989cited by this paper
• Privacy Amplification by Public Discussion

  1988cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• Introduction to Coding Theory

  1982cited by this paper
• Communication theory of secrecy systems

  1949cited by this paper
• A mathematical theory of communication

  1948cited by this paper
• Theory of Error-correcting Codes

  year unknowncited by this paper

• PPEDCRF: Privacy-Preserving Enhanced Dynamic CRF for Location-Privacy Protection for Sequence Videos with Minimal Detection Degradation

  2026cites this paper
• Beyond Shannon: Operational Perfect Secrecy as a Generalised Model for Information-Theoretic Security

  2025cites this paper
• Protecting Computations against Continuous Bounded-Communication Leakage

  2025cites this paper
• Fuzzy Extractors are Practical: Cryptographic Strength Key Derivation from the Iris

  2025cites this paper
• Q-Stream: A Practical System for Operational Perfect Secrecy

  2025cites this paper
• FiveEyes: Cryptographic Biometric Authentication from the Iris

  2024cites this paper
• ε-Almost Collision-Flat Universal Hash Functions Motivated by Information-Theoretic Security

  2023cites this paper
• Upgrading Fuzzy Extractors

  2023influential citation
• Computational fuzzy extractor from LWE

  2023cites this paper
• Spectral approach to the communication complexity of multi-party key agreement

  2023cites this paper
• Overparameterization from Computational Constraints

  2022cites this paper
• Overparameterized (robust) models from computational constraints

  2022cites this paper
• Lockable Obfuscation from Circularly Insecure Fully Homomorphic Encryption

  2021cites this paper
• New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries

  2021cites this paper
• A Secure Biometric Key Generation Mechanism via Deep Learning and Its Application

  2021cites this paper
• Encrypted-Input Program Obfuscation: Simultaneous Security Against White-Box and Black-Box Attacks

  2020cites this paper
• Single-Message Credential-Hiding Login

  2020cites this paper
• Qubit-based Unclonable Encryption with Key Recycling

  2020cites this paper
• Quantum Key Recycling with optimal key recycling rate based on a noise level

  2020cites this paper
• Innovative Security Solutions for Information Technology and Communications: 12th International Conference, SecITC 2019, Bucharest, Romania, November 14–15, 2019, Revised Selected Papers

  2020cites this paper
• Two-way unclonable encryption with a vulnerable sender

  2020cites this paper
• Cryptographic Formula Obfuscation

  2019cites this paper
• Improved fuzzy commitment scheme

  2019cites this paper
• New Techniques for Obfuscating Conjunctions

  2019cites this paper
• On the achievability of white-box cryptography

  2019cites this paper
• Logic Locking of Boolean Circuits: Provable Hardware-Based Obfuscation from a Tamper-Proof Memory

  2019cites this paper
• Leakage Resilience from Program Obfuscation

  2019influential citation
• Public-Key Function-Private Hidden Vector Encryption (and More)

  2019cites this paper
• Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems

  2019influential citation
• On the Everlasting Security of Password-Authenticated Quantum Key Exchange

  2019cites this paper
• Intrusion-Resilient Classifier Approximation: From Wildcard Matching to Range Membership

  2018cites this paper
• Secure Computation using Leaky Correlations (Asymptotically Optimal Constructions)

  2018cites this paper
• 상관 키 분산 암호화의 프라이버시 증폭 Privacy Amplification of Correlated Key Decryption over Public Channels

  2018cites this paper
• Performance of privacy Amplification in Quantum Key Distribution Systems

  2018cites this paper
• Cryptographic Formula Obfuscation

  2018cites this paper
• Cryptographic Program Obfuscation: Practical Solutions and Application-Driven Models

  2018cites this paper
• Encrypted domain matching of fingerprint minutia cylinder-code (MCC) with l1 minimization

  2017cites this paper
• Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs

  2017cites this paper
• Optimal attacks on qubit-based Quantum Key Recycling

  2017cites this paper
• Lockable Obfuscation

  2017cites this paper
• Security of Symmetric Primitives under Incorrect Usage of Keys

  2017cites this paper
• Obfuscating Compute-and-Compare Programs under LWE

  2017cites this paper
• Round-Optimal Correlation Extractors with Linear Production and Leakage Resilience

  2017cites this paper
• Quantum Key Recycling with 8-state encoding (The Quantum One-Time Pad is more interesting than we thought)

  2017cites this paper
• Deterministic Public-Key Encryption Under Continual Leakage

  2016cites this paper
• Bounded-Communication Leakage Resilience via Parity-Resilient Circuits

  2016cites this paper
• The Magic of ELFs

  2016cites this paper
• Indistinguishable Proofs of Work or Knowledge

  2016cites this paper
• Quantum Authentication and Encryption with Key Recycling

  2016cites this paper
• Statistical Methods in Cryptography

  2016cites this paper
• When Are Fuzzy Extractors Possible?

  2016cites this paper
• Leakage-Resilient Public-Key Encryption from Obfuscation

  2016influential citation
• Cryptanalysis of Authentication Protocol Based on Low Cost Smart Card and Biometrics

  2016cites this paper
• Quantum Authentication and Encryption with Key Recycling - Or: How to Re-use a One-Time Pad Even if P=NP - Safely & Feasibly

  2016influential citation
• Obfuscating Conjunctions under Entropic Ring LWE

  2016influential citation
• Quantum Key Recycling with eight-state encoding (The Quantum One Time Pad is more interesting than we thought)

  2016cites this paper
• Privacy-preserving face recognition with outsourced computation

  2015cites this paper
• Identity Management through Privacy-Preserving Authentication

  2015cites this paper
• Obfuscating Conjunctions

  2015cites this paper
• On Key Evolution over Wireless Channels

  2015cites this paper
• Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More

  2015cites this paper
• Secure Computation from Leaky Correlated Randomness

  2015cites this paper
• Biometrie key generator with applications in on-device encryption

  2015cites this paper
• Reconfigurable random bit storage using polymer-dispersed liquid crystal

  2014cites this paper
• Relational Hash

  2014cites this paper
• Privacy-Preserving Face Recognition with Outsourced Computation

  2014cites this paper
• Black-box obfuscation for d-CNFs

  2014cites this paper
• An Intermediate Level Obfuscation Method

  2014cites this paper
• Chosen Ciphertext Security via Point Obfuscation

  2014cites this paper
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

  2014cites this paper
• Lecture 16: Special Purpose Extractors

  2013cites this paper
• Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption

  2013cites this paper
• Obfuscating Many-toone Functional Re-encryption , and its Connection to Fully-Homomorphic Encryption

  2013cites this paper
• Robust Pseudorandom Generators

  2013cites this paper
• Analysis of Reusability of Secure Sketches and Fuzzy Extractors

  2013cites this paper
• Security Analysis of $\varepsilon $ -Almost Dual Universal2 Hash Functions: Smoothing of Min Entropy Versus Smoothing of Rényi Entropy of Order 2

  2013influential citation
• Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups

  2013cites this paper
• More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function

  2013cites this paper
• Physical key-protected one-time pad

  2013cites this paper
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES

  2013cites this paper
• Security of the Improved Fuzzy Vault Scheme in the Presence of Record Multiplicity (Full Version)

  2013cites this paper
• Efficient and Privacy-Preserving Biometric Authentication ∗

  2013cites this paper
• More Efficient Privacy Amplification with Non-Uniform Random Seeds via Dual Universal Hash Function

  2013cites this paper
• Cryptography in Constant Parallel Time

  2013cites this paper
• Cryptographic Credentials with Privacy-preserving Biometric Bindings

  2013cites this paper
• Randomness-Dependent Message Security

  2013cites this paper
• Security and Privacy in Biometrics

  2013cites this paper
• On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption

  2013cites this paper
• Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions

  2013cites this paper
• Functional Re-encryption and Collusion-Resistant Obfuscation

  2012cites this paper
• Overcoming weak expectations

  2012cites this paper
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy

  2012influential citation
• A On the ( Im )

  2012cites this paper
• Large Deviation Analysis for Quantum Security via Smoothing of Rényi Entropy of Order 2

  2012influential citation
• Secure outsourced computation of iris matching

  2012cites this paper
• On Burst Error Correction and Storage Security of Noisy Data

  2012cites this paper
• Long term confidentiality: a survey

  2012cites this paper
• On the (Non-)Reusability of Fuzzy Sketches and Extractors and Security Improvements in the Computational Setting

  2012cites this paper
• Quantum Security Analysis via Smoothing of Renyi Entropy of Order 2

  2012cites this paper
• 2 Shannon , entropy , and perfect secrecy

  2012cites this paper