The Spammed Code Offset Method
Authors:
- 15 April 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 9 (5) , 875-884
Abstract
Helper data schemes are a security primitive used for privacy-preserving biometric databases and physical unclonable functions. One of the oldest known helper data schemes is the code offset method (COM). We propose an extension of the COM: the helper data are accompanied by many instances of fake helper data that are drawn from the same distribution as the real one. While the adversary has no way to distinguish between them, the legitimate party has more information and can see the difference. We use a low-density parity check code in order to improve the efficiency of the legitimate party's selection procedure. Our construction provides a new kind of tradeoff: more effective use of the source entropy, at the price of increased helper data storage. We give a security analysis in terms of Shannon entropy and order-2 Rényi entropy. We also propose a variant of our scheme in which the helper data list is not stored but pseudorandomly generated, changing the tradeoff to source entropy utilization versus computation effort.Keywords
This publication has 19 references indexed in Scilit:
- Reverse Fuzzy Extractors: Enabling Lightweight Mutual Authentication for PUF-Enabled RFIDs2012
- On fuzzy syndrome hashing with LDPC coding2011
- Sharp lower bounds on the extractable randomness from non-uniform sourcesInformation and Computation, 2011
- Leftover Hash Lemma, Revisited2011
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors2008
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy DataSIAM Journal on Computing, 2008
- Energy Scalable Universal HashingIEEE Transactions on Computers, 2005
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Universal hashing and authentication codesDesigns, Codes and Cryptography, 1994
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979