Rejection Sampling Schemes for Extracting Uniform Distribution from Biased PUFs
نویسندگان
چکیده
منابع مشابه
Secure Key Generation from Biased PUFs
PUF-based key generators have been widely considered as a root-of-trust in digital systems. They typically require an error-correcting mechanism (e.g. based on the code-offset method) for dealing with bit errors between the enrollment and reconstruction of keys. When the used PUF does not have full entropy, entropy leakage between the helper data and the device-unique key material can occur. If...
متن کاملGeneralized rejection sampling schemes and applications in signal processing
Bayesian methods and their implementations by means of sophisticated Monte Carlo techniques, such as Markov chain Monte Carlo (MCMC) and particle filters, have become very popular in signal processing over the last years. However, in many problems of practical interest these techniques demand procedures for sampling from probability distributions with non-standard forms, hence we are often brou...
متن کاملTruncated Midzuno-Sen Sampling Schemes for Estimating Distribution Functions
Truncated Midzuno-Sen Sampling Schemes for Estimating Distribution Functions Sarjinder Singha; Jong-Min Kimb; Hakjin Jangc; Stephen Hornd a Department of Mathematics, Texas A&M University-Kingsville, Kingsville, Texas, USA b Division of Sciences and Mathematics, University of Minnesota-Morris, Morris, Minnesota, USA c Division of Applied Mathematics, Hanyang University, Ansan, Korea d Departmen...
متن کاملExtracting Group Signatures from Traitor Tracing Schemes
To appear in Advances in Cryptology — Eurocrypt 2003, May 4-8, Warsaw, Poland, Eli Biham (Ed.), Springer LNCS, 2003 Digital Signatures emerge naturally from Public-Key Encryption based on trapdoor permutations, and the “duality” of the two primitives was noted as early as Diffie-Hellman’s seminal work. The present work is centered around the crucial observation that two well known cryptographic...
متن کاملA Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove that the direct NC simulation of the sequential Markov chain technique for this problem is P-complete. Afterwards we present a randomized parallel algorithm for the problem. The technique used is based on the definition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Cryptographic Hardware and Embedded Systems
سال: 2020
ISSN: 2569-2925
DOI: 10.46586/tches.v2020.i4.86-128