Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
We abstract from Applebaum\'s construction and proof, and formalize three generic technical properties that imply RKA-KDM security: one property is IND-CPA security, and the other two are the existence of suitable oracles that produce ciphertexts under related keys, resp. of key-dependent messages. We then give simple SKE schemes that achieve these properties. Our constructions are variants of known KDM-secure public-key encryption schemes. To additionally achieve RKA security, we isolate suitable homomorphic properties of the underlying schemes in order to simulate ciphertexts under related keys in the security proof.
From a conceptual point of view, our work provides a generic and extensible way to construct encryption schemes with multiple special security properties.
On the other hand, our construction also creates a new approach for constructing IND-CCA secure (leakage-free) PKE schemes, which may be of independent interest.
a well-known security primitive for secure key storage
and anti-counterfeiting. For both applications it is imperative
that PUFs provide enough entropy. The aim of this paper
is to propose a new model for binary-output PUFs such as
SRAM, DFF, Latch and Buskeeper PUFs, and a method to
accurately estimate their entropy. In our model the measurable
property of a PUF is its set of cell biases. We determine
an upper bound on the \'extractable entropy\', i.e. the number
of key bits that can be robustly extracted, by calculating the
mutual information between the bias measurements done at
enrollment and reconstruction.
In previously known methods only uniqueness was studied
using information-theoretic measures, while robustness was
typically expressed in terms of error probabilities or distances.
It is not always straightforward to use a combination of these
two metrics in order to make an informed decision about
the performance of different PUF types. Our new approach
has the advantage that it simultaneously captures both of
properties that are vital for key storage: uniqueness and
robustness. Therefore it will be possible to fairly compare
performance of PUF implementations using our new method.
Statistical validation of the new methodology shows that
it clearly captures both of these properties of PUFs. In other
words: if one of these aspects (either uniqueness or robustness)
is less than optimal, the extractable entropy decreases.
Analysis on a large database of PUF measurement data shows
very high entropy for SRAM PUFs, but rather poor results
for all other memory-based PUFs in this database.
In this paper, we describe, characterize, and exploit this surprising structure. It is our thesis that the additional structure available in these curves will give rise to novel cryptographic constructions, and we initiate the study of such constructions. Both the subgroup hiding and SXDH assumptions appear to hold in the new setting; in addition, we introduce custom-tailored assumptions designed to capture the trapdoor nature of the projection maps into $G_1$ and $G_2$. Using the old and new assumptions, we describe an extended variant of the Boneh-Goh-Nissim cryptosystem that allows a user, at the time of encryption, to restrict the homomorphic operations that may be performed. We also present a variant of the Groth-Ostrovsky-Sahai NIZK, and new anonymous IBE, signature, and encryption schemes.